./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5_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-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5_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 457415f9b28998cf0ba7f80d69eaf14873f5a98f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:31:38,437 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:31:38,439 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:31:38,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:31:38,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:31:38,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:31:38,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:31:38,458 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:31:38,460 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:31:38,461 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:31:38,461 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:31:38,462 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:31:38,463 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:31:38,464 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:31:38,465 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:31:38,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:31:38,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:31:38,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:31:38,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:31:38,473 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:31:38,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:31:38,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:31:38,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:31:38,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:31:38,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:31:38,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:31:38,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:31:38,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:31:38,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:31:38,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:31:38,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:31:38,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:31:38,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:31:38,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:31:38,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:31:38,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:31:38,488 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:31:38,503 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:31:38,503 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:31:38,504 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:31:38,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:31:38,505 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:31:38,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:31:38,505 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:31:38,505 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:31:38,506 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:31:38,506 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:31:38,506 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:31:38,506 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:31:38,506 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:31:38,506 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:31:38,506 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:31:38,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:31:38,508 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:31:38,508 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:31:38,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:31:38,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:31:38,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:31:38,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:31:38,509 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:31:38,509 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:31:38,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:31:38,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:31:38,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:31:38,511 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 -> 457415f9b28998cf0ba7f80d69eaf14873f5a98f [2019-01-14 01:31:38,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:31:38,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:31:38,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:31:38,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:31:38,568 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:31:38,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5_true-termination_true-no-overflow.c [2019-01-14 01:31:38,632 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51471c7f2/5a567649435943d0b2e70fb2e436e973/FLAG5458b038f [2019-01-14 01:31:39,054 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:31:39,055 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5_true-termination_true-no-overflow.c [2019-01-14 01:31:39,062 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51471c7f2/5a567649435943d0b2e70fb2e436e973/FLAG5458b038f [2019-01-14 01:31:39,443 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51471c7f2/5a567649435943d0b2e70fb2e436e973 [2019-01-14 01:31:39,447 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:31:39,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:31:39,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:31:39,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:31:39,454 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:31:39,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:31:39" (1/1) ... [2019-01-14 01:31:39,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e13714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39, skipping insertion in model container [2019-01-14 01:31:39,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:31:39" (1/1) ... [2019-01-14 01:31:39,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:31:39,487 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:31:39,711 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:31:39,716 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:31:39,733 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:31:39,748 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:31:39,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39 WrapperNode [2019-01-14 01:31:39,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:31:39,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:31:39,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:31:39,750 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:31:39,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39" (1/1) ... [2019-01-14 01:31:39,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39" (1/1) ... [2019-01-14 01:31:39,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:31:39,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:31:39,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:31:39,793 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:31:39,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39" (1/1) ... [2019-01-14 01:31:39,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39" (1/1) ... [2019-01-14 01:31:39,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39" (1/1) ... [2019-01-14 01:31:39,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39" (1/1) ... [2019-01-14 01:31:39,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39" (1/1) ... [2019-01-14 01:31:39,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39" (1/1) ... [2019-01-14 01:31:39,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39" (1/1) ... [2019-01-14 01:31:39,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:31:39,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:31:39,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:31:39,820 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:31:39,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39" (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 01:31:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-14 01:31:39,942 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-14 01:31:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:31:39,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:31:40,294 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:31:40,294 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 01:31:40,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:31:40 BoogieIcfgContainer [2019-01-14 01:31:40,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:31:40,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:31:40,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:31:40,299 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:31:40,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:31:39" (1/3) ... [2019-01-14 01:31:40,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d7d443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:31:40, skipping insertion in model container [2019-01-14 01:31:40,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:39" (2/3) ... [2019-01-14 01:31:40,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d7d443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:31:40, skipping insertion in model container [2019-01-14 01:31:40,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:31:40" (3/3) ... [2019-01-14 01:31:40,303 INFO L112 eAbstractionObserver]: Analyzing ICFG LeeJonesBen-Amram-POPL2001-Ex5_true-termination_true-no-overflow.c [2019-01-14 01:31:40,312 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:31:40,319 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 01:31:40,336 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 01:31:40,366 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:31:40,367 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:31:40,367 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:31:40,367 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:31:40,367 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:31:40,367 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:31:40,367 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:31:40,368 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:31:40,368 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:31:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-01-14 01:31:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:31:40,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:40,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:40,398 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:40,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1461861353, now seen corresponding path program 1 times [2019-01-14 01:31:40,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:40,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:40,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:40,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:40,643 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 01:31:40,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:31:40,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:31:40,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:31:40,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:31:40,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:31:40,668 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2019-01-14 01:31:40,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:40,867 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-01-14 01:31:40,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:31:40,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 01:31:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:40,878 INFO L225 Difference]: With dead ends: 44 [2019-01-14 01:31:40,879 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 01:31:40,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:31:40,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 01:31:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-01-14 01:31:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 01:31:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-01-14 01:31:40,920 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2019-01-14 01:31:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:40,921 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-14 01:31:40,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:31:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-01-14 01:31:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:31:40,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:40,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:40,923 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:40,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1461861577, now seen corresponding path program 1 times [2019-01-14 01:31:40,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:40,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:40,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:40,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:40,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:41,041 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 01:31:41,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:31:41,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:31:41,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:31:41,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:31:41,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:31:41,046 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2019-01-14 01:31:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:41,251 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-01-14 01:31:41,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:31:41,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 01:31:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:41,254 INFO L225 Difference]: With dead ends: 34 [2019-01-14 01:31:41,254 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 01:31:41,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:31:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 01:31:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-01-14 01:31:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 01:31:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-01-14 01:31:41,267 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2019-01-14 01:31:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:41,267 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-14 01:31:41,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:31:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-01-14 01:31:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 01:31:41,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:41,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:41,268 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:41,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:41,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1926938272, now seen corresponding path program 1 times [2019-01-14 01:31:41,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:41,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:41,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:41,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:41,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:41,377 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 01:31:41,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:31:41,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:31:41,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:31:41,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:31:41,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:31:41,379 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-01-14 01:31:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:41,435 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-01-14 01:31:41,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:31:41,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-14 01:31:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:41,439 INFO L225 Difference]: With dead ends: 33 [2019-01-14 01:31:41,439 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 01:31:41,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:31:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 01:31:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-01-14 01:31:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 01:31:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-14 01:31:41,450 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 8 [2019-01-14 01:31:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:41,452 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-14 01:31:41,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:31:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-14 01:31:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 01:31:41,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:41,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:41,454 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:41,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:41,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1926931321, now seen corresponding path program 1 times [2019-01-14 01:31:41,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:41,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:41,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:41,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:41,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:41,548 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 01:31:41,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:31:41,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:31:41,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:31:41,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:31:41,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:31:41,550 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2019-01-14 01:31:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:41,722 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-01-14 01:31:41,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:31:41,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-14 01:31:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:41,724 INFO L225 Difference]: With dead ends: 32 [2019-01-14 01:31:41,725 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 01:31:41,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:31:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 01:31:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-01-14 01:31:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 01:31:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-01-14 01:31:41,732 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 8 [2019-01-14 01:31:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:41,732 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-14 01:31:41,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:31:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-01-14 01:31:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 01:31:41,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:41,733 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:41,734 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:41,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1954337320, now seen corresponding path program 1 times [2019-01-14 01:31:41,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:41,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:41,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:41,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:31:41,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:31:41,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:31:41,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:31:41,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:31:41,802 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-01-14 01:31:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:41,970 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-01-14 01:31:41,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:31:41,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 01:31:41,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:41,972 INFO L225 Difference]: With dead ends: 43 [2019-01-14 01:31:41,973 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 01:31:41,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:31:41,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 01:31:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2019-01-14 01:31:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 01:31:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-01-14 01:31:41,981 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 13 [2019-01-14 01:31:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:41,982 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-01-14 01:31:41,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:31:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-01-14 01:31:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 01:31:41,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:41,983 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:41,983 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:41,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:41,984 INFO L82 PathProgramCache]: Analyzing trace with hash -906050173, now seen corresponding path program 1 times [2019-01-14 01:31:41,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:41,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:41,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:41,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:41,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:42,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:42,052 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 01:31:42,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:42,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:42,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:31:42,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2019-01-14 01:31:42,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:31:42,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:31:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:31:42,384 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 8 states. [2019-01-14 01:31:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:42,878 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-01-14 01:31:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 01:31:42,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-14 01:31:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:42,880 INFO L225 Difference]: With dead ends: 50 [2019-01-14 01:31:42,880 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 01:31:42,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:31:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 01:31:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-01-14 01:31:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 01:31:42,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-14 01:31:42,887 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2019-01-14 01:31:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:42,887 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-14 01:31:42,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:31:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-14 01:31:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 01:31:42,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:42,889 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:42,889 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:42,889 INFO L82 PathProgramCache]: Analyzing trace with hash -906049949, now seen corresponding path program 1 times [2019-01-14 01:31:42,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:42,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:42,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:42,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:42,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:42,964 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 01:31:42,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:42,965 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 01:31:42,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:42,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:42,997 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 01:31:43,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:43,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:31:43,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:31:43,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:31:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:31:43,020 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2019-01-14 01:31:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:43,262 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-14 01:31:43,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:31:43,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-14 01:31:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:43,264 INFO L225 Difference]: With dead ends: 38 [2019-01-14 01:31:43,264 INFO L226 Difference]: Without dead ends: 37 [2019-01-14 01:31:43,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:31:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-14 01:31:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-01-14 01:31:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 01:31:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-14 01:31:43,273 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2019-01-14 01:31:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:43,274 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-14 01:31:43,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:31:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-14 01:31:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 01:31:43,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:43,276 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:43,276 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash 454914824, now seen corresponding path program 1 times [2019-01-14 01:31:43,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:43,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:43,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:43,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:43,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:43,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:43,350 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 01:31:43,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:43,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:43,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:31:43,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-01-14 01:31:43,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:31:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:31:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:31:43,441 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 10 states. [2019-01-14 01:31:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:43,581 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-14 01:31:43,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:31:43,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-01-14 01:31:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:43,587 INFO L225 Difference]: With dead ends: 45 [2019-01-14 01:31:43,587 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 01:31:43,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:31:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 01:31:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-01-14 01:31:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 01:31:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-01-14 01:31:43,596 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 14 [2019-01-14 01:31:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:43,596 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-01-14 01:31:43,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:31:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-01-14 01:31:43,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 01:31:43,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:43,597 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 01:31:43,598 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:43,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:43,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1341115267, now seen corresponding path program 2 times [2019-01-14 01:31:43,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:43,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:43,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:43,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:43,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:43,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:43,710 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 01:31:43,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:31:43,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:31:43,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:43,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:43,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:43,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:31:43,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:31:43,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:31:43,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:31:43,784 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 7 states. [2019-01-14 01:31:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:44,004 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-01-14 01:31:44,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:31:44,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-14 01:31:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:44,011 INFO L225 Difference]: With dead ends: 51 [2019-01-14 01:31:44,011 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 01:31:44,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:31:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 01:31:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 24. [2019-01-14 01:31:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 01:31:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-14 01:31:44,017 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2019-01-14 01:31:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:44,018 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-14 01:31:44,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:31:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-14 01:31:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 01:31:44,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:44,019 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:44,019 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash 451770350, now seen corresponding path program 1 times [2019-01-14 01:31:44,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:44,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:44,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:44,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:44,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:44,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:44,119 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 01:31:44,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:44,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:44,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:44,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:31:44,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:31:44,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:31:44,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:31:44,175 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2019-01-14 01:31:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:44,319 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-01-14 01:31:44,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:31:44,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-14 01:31:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:44,322 INFO L225 Difference]: With dead ends: 37 [2019-01-14 01:31:44,322 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 01:31:44,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:31:44,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 01:31:44,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-01-14 01:31:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 01:31:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-14 01:31:44,330 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2019-01-14 01:31:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:44,331 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-14 01:31:44,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:31:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-14 01:31:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 01:31:44,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:44,332 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-14 01:31:44,332 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:44,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1375099731, now seen corresponding path program 1 times [2019-01-14 01:31:44,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:44,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:44,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:44,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:44,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:44,476 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 01:31:44,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:44,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:44,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:44,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:31:44,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:31:44,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:31:44,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:31:44,521 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2019-01-14 01:31:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:44,811 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-14 01:31:44,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:31:44,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-14 01:31:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:44,813 INFO L225 Difference]: With dead ends: 43 [2019-01-14 01:31:44,813 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 01:31:44,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:31:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 01:31:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-01-14 01:31:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 01:31:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-01-14 01:31:44,822 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-01-14 01:31:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:44,822 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-01-14 01:31:44,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:31:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-01-14 01:31:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 01:31:44,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:44,823 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:44,824 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash 511948884, now seen corresponding path program 2 times [2019-01-14 01:31:44,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:44,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:44,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:45,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:45,064 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 01:31:45,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:31:45,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:31:45,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:45,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:45,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:45,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:31:45,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:31:45,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:31:45,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:31:45,123 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 11 states. [2019-01-14 01:31:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:45,360 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-01-14 01:31:45,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 01:31:45,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-01-14 01:31:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:45,362 INFO L225 Difference]: With dead ends: 50 [2019-01-14 01:31:45,362 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 01:31:45,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:31:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 01:31:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2019-01-14 01:31:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 01:31:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-14 01:31:45,371 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 26 [2019-01-14 01:31:45,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:45,372 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-14 01:31:45,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:31:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-14 01:31:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 01:31:45,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:45,373 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:45,373 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:45,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1009095738, now seen corresponding path program 3 times [2019-01-14 01:31:45,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:45,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:45,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:45,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:45,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:45,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:45,661 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 01:31:45,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:31:45,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 01:31:45,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:45,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:45,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:45,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 01:31:45,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 01:31:45,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 01:31:45,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:31:45,731 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 13 states. [2019-01-14 01:31:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:46,101 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-01-14 01:31:46,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 01:31:46,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-01-14 01:31:46,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:46,102 INFO L225 Difference]: With dead ends: 61 [2019-01-14 01:31:46,102 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 01:31:46,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:31:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 01:31:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2019-01-14 01:31:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 01:31:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-14 01:31:46,113 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 32 [2019-01-14 01:31:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:46,114 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-14 01:31:46,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 01:31:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-14 01:31:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 01:31:46,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:46,115 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-14 01:31:46,115 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:46,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:46,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1872988191, now seen corresponding path program 2 times [2019-01-14 01:31:46,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:46,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:46,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:46,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:46,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:46,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:46,252 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 01:31:46,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:31:46,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:31:46,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:46,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:46,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:46,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 01:31:46,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 01:31:46,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 01:31:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:31:46,337 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2019-01-14 01:31:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:46,740 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-01-14 01:31:46,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 01:31:46,741 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-01-14 01:31:46,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:46,742 INFO L225 Difference]: With dead ends: 67 [2019-01-14 01:31:46,742 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 01:31:46,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:31:46,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 01:31:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2019-01-14 01:31:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 01:31:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-01-14 01:31:46,755 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 32 [2019-01-14 01:31:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:46,756 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-01-14 01:31:46,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 01:31:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-01-14 01:31:46,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 01:31:46,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:46,757 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:46,757 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:46,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:46,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1485859744, now seen corresponding path program 4 times [2019-01-14 01:31:46,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:46,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:46,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:46,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:46,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 01:31:46,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:46,899 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 01:31:46,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:31:46,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:31:46,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:46,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-14 01:31:47,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:47,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2019-01-14 01:31:47,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 01:31:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 01:31:47,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-01-14 01:31:47,108 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 15 states. [2019-01-14 01:31:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:47,570 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-01-14 01:31:47,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 01:31:47,571 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2019-01-14 01:31:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:47,572 INFO L225 Difference]: With dead ends: 85 [2019-01-14 01:31:47,572 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 01:31:47,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2019-01-14 01:31:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 01:31:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 48. [2019-01-14 01:31:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 01:31:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-14 01:31:47,584 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 38 [2019-01-14 01:31:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:47,585 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-14 01:31:47,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 01:31:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-14 01:31:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 01:31:47,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:47,586 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:47,587 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1828298374, now seen corresponding path program 5 times [2019-01-14 01:31:47,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:47,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:47,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:47,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:47,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:48,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:48,070 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 01:31:48,087 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:31:48,109 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 01:31:48,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:48,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:48,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:48,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-14 01:31:48,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 01:31:48,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 01:31:48,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-01-14 01:31:48,154 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 17 states. [2019-01-14 01:31:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:48,815 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-01-14 01:31:48,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 01:31:48,819 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2019-01-14 01:31:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:48,821 INFO L225 Difference]: With dead ends: 92 [2019-01-14 01:31:48,821 INFO L226 Difference]: Without dead ends: 91 [2019-01-14 01:31:48,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 01:31:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-14 01:31:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 57. [2019-01-14 01:31:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 01:31:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-14 01:31:48,842 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 44 [2019-01-14 01:31:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:48,842 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-14 01:31:48,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 01:31:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-14 01:31:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 01:31:48,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:48,846 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1] [2019-01-14 01:31:48,846 INFO L423 AbstractCegarLoop]: === Iteration 17 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:48,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:48,846 INFO L82 PathProgramCache]: Analyzing trace with hash 123200235, now seen corresponding path program 3 times [2019-01-14 01:31:48,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:48,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:48,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:48,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:48,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:49,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:49,071 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 01:31:49,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:31:49,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-14 01:31:49,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:49,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:49,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:49,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-14 01:31:49,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 01:31:49,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 01:31:49,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-01-14 01:31:49,167 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 17 states. [2019-01-14 01:31:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:49,874 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-01-14 01:31:49,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 01:31:49,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2019-01-14 01:31:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:49,876 INFO L225 Difference]: With dead ends: 97 [2019-01-14 01:31:49,876 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 01:31:49,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:31:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 01:31:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 60. [2019-01-14 01:31:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 01:31:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-14 01:31:49,892 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 44 [2019-01-14 01:31:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:49,893 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-14 01:31:49,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 01:31:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-14 01:31:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 01:31:49,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:49,894 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:49,894 INFO L423 AbstractCegarLoop]: === Iteration 18 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash -319514926, now seen corresponding path program 6 times [2019-01-14 01:31:49,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:49,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:49,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:50,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:50,170 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 01:31:50,181 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:31:50,206 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-14 01:31:50,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:50,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:50,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:50,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-14 01:31:50,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 01:31:50,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 01:31:50,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-01-14 01:31:50,245 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 21 states. [2019-01-14 01:31:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:51,161 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2019-01-14 01:31:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 01:31:51,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2019-01-14 01:31:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:51,162 INFO L225 Difference]: With dead ends: 116 [2019-01-14 01:31:51,162 INFO L226 Difference]: Without dead ends: 115 [2019-01-14 01:31:51,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=398, Invalid=1494, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 01:31:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-14 01:31:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 69. [2019-01-14 01:31:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 01:31:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-14 01:31:51,183 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 56 [2019-01-14 01:31:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:51,183 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-14 01:31:51,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 01:31:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-14 01:31:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 01:31:51,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:51,185 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1, 1] [2019-01-14 01:31:51,185 INFO L423 AbstractCegarLoop]: === Iteration 19 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:51,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:51,185 INFO L82 PathProgramCache]: Analyzing trace with hash -776049737, now seen corresponding path program 4 times [2019-01-14 01:31:51,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:51,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:51,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:51,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:51,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:51,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:51,409 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 01:31:51,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:31:51,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:31:51,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:51,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 20 proven. 138 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-14 01:31:51,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:51,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 25 [2019-01-14 01:31:51,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 01:31:51,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 01:31:51,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2019-01-14 01:31:51,598 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 26 states. [2019-01-14 01:31:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:51,914 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2019-01-14 01:31:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:31:51,915 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-01-14 01:31:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:51,916 INFO L225 Difference]: With dead ends: 120 [2019-01-14 01:31:51,916 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 01:31:51,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-01-14 01:31:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 01:31:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-14 01:31:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 01:31:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-14 01:31:51,933 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 56 [2019-01-14 01:31:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:51,934 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-14 01:31:51,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 01:31:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-14 01:31:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 01:31:51,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:51,935 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:51,935 INFO L423 AbstractCegarLoop]: === Iteration 20 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash 52526366, now seen corresponding path program 7 times [2019-01-14 01:31:51,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:51,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:51,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:51,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:51,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:52,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:52,304 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 01:31:52,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:52,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:52,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:52,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-14 01:31:52,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 01:31:52,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 01:31:52,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-01-14 01:31:52,376 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 25 states. [2019-01-14 01:31:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:52,924 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-14 01:31:52,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 01:31:52,925 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 68 [2019-01-14 01:31:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:52,926 INFO L225 Difference]: With dead ends: 83 [2019-01-14 01:31:52,927 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 01:31:52,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=459, Invalid=1611, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 01:31:52,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 01:31:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-01-14 01:31:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 01:31:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-14 01:31:52,948 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 68 [2019-01-14 01:31:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:52,948 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-14 01:31:52,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 01:31:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-14 01:31:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-14 01:31:52,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:52,950 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:52,950 INFO L423 AbstractCegarLoop]: === Iteration 21 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:52,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:52,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1106554518, now seen corresponding path program 8 times [2019-01-14 01:31:52,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:52,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:52,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:52,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:52,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:54,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:54,236 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 01:31:54,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:31:54,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:31:54,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:54,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:54,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:54,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-14 01:31:54,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 01:31:54,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 01:31:54,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-01-14 01:31:54,343 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 29 states. [2019-01-14 01:31:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:55,044 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-14 01:31:55,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 01:31:55,045 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 80 [2019-01-14 01:31:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:55,046 INFO L225 Difference]: With dead ends: 95 [2019-01-14 01:31:55,046 INFO L226 Difference]: Without dead ends: 94 [2019-01-14 01:31:55,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=632, Invalid=2230, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 01:31:55,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-14 01:31:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-01-14 01:31:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 01:31:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-14 01:31:55,071 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 80 [2019-01-14 01:31:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:55,071 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-14 01:31:55,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 01:31:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-14 01:31:55,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 01:31:55,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:55,073 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:55,073 INFO L423 AbstractCegarLoop]: === Iteration 22 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:55,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:55,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1279454282, now seen corresponding path program 9 times [2019-01-14 01:31:55,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:55,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:55,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:55,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:55,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 0 proven. 575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:55,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:55,568 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 01:31:55,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:31:55,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-14 01:31:55,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:55,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 0 proven. 573 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:31:55,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:55,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 35 [2019-01-14 01:31:55,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 01:31:55,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 01:31:55,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 01:31:55,719 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 36 states. [2019-01-14 01:31:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:56,998 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2019-01-14 01:31:57,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 01:31:57,000 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 92 [2019-01-14 01:31:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:57,003 INFO L225 Difference]: With dead ends: 119 [2019-01-14 01:31:57,003 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 01:31:57,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1140, Invalid=3830, Unknown=0, NotChecked=0, Total=4970 [2019-01-14 01:31:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 01:31:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-01-14 01:31:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 01:31:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-01-14 01:31:57,027 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 92 [2019-01-14 01:31:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:57,027 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-01-14 01:31:57,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 01:31:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-01-14 01:31:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-14 01:31:57,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:57,029 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:57,029 INFO L423 AbstractCegarLoop]: === Iteration 23 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:57,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash -853253554, now seen corresponding path program 10 times [2019-01-14 01:31:57,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:57,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 0 proven. 955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:58,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:58,238 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 01:31:58,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:31:58,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:31:58,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:58,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 10 proven. 682 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-01-14 01:31:59,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:59,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 15] total 51 [2019-01-14 01:31:59,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-14 01:31:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-14 01:31:59,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=2221, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 01:31:59,371 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 52 states. [2019-01-14 01:31:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:59,801 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-14 01:31:59,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:31:59,803 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 116 [2019-01-14 01:31:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:59,803 INFO L225 Difference]: With dead ends: 117 [2019-01-14 01:31:59,803 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:31:59,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=646, Invalid=2660, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 01:31:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:31:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:31:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:31:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:31:59,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2019-01-14 01:31:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:59,808 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:31:59,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-14 01:31:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:31:59,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:31:59,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:31:59,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:59,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:59,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:59,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:59,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:59,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,898 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 105 [2019-01-14 01:32:00,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,195 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 76 [2019-01-14 01:32:01,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,411 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2019-01-14 01:32:01,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,550 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-01-14 01:32:01,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,803 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2019-01-14 01:32:01,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:01,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,028 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 105 [2019-01-14 01:32:02,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,177 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 93 [2019-01-14 01:32:02,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,297 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2019-01-14 01:32:02,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,424 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 106 [2019-01-14 01:32:02,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,613 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 106 [2019-01-14 01:32:02,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,795 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 105 [2019-01-14 01:32:02,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,897 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 103 [2019-01-14 01:32:02,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:02,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:04,585 WARN L181 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 26 [2019-01-14 01:32:05,845 WARN L181 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 351 DAG size of output: 1 [2019-01-14 01:32:09,880 WARN L181 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 575 DAG size of output: 47 [2019-01-14 01:32:09,883 INFO L448 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:32:09,883 INFO L448 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:32:09,884 INFO L448 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-14 01:32:09,884 INFO L448 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-01-14 01:32:09,884 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 01:32:09,884 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 13 23) no Hoare annotation was computed. [2019-01-14 01:32:09,884 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-14 01:32:09,884 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-01-14 01:32:09,885 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse1 (< 2147483647 |f_#in~y|)) (.cse2 (< 2147483647 |f_#in~x|))) (let ((.cse3 (or (= 0 |f_#in~x|) .cse1 .cse2)) (.cse0 (< |f_#in~y| 0))) (and (or (and (not (= 0 f_~x)) (and (<= 0 f_~x) (and (not (= 0 f_~y)) (<= f_~x 2147483648) (<= f_~y 2147483647)) (<= 0 f_~y))) .cse0 .cse1 (< |f_#in~x| 0) .cse2) (or (<= f_~x 2147483647) (or .cse0 .cse3) (< |f_#in~x| 1)) (or (and (<= f_~y f_~x) (<= f_~x (+ f_~y 1))) (< |f_#in~x| |f_#in~y|) (or .cse3 .cse0) (< (+ |f_#in~y| 1) |f_#in~x|))))) [2019-01-14 01:32:09,885 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2019-01-14 01:32:09,885 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-01-14 01:32:09,885 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-14 01:32:09,885 INFO L444 ceAbstractionStarter]: At program point L18-2(line 18) the Hoare annotation is: (let ((.cse3 (< |f_#in~y| 0)) (.cse0 (< 2147483647 |f_#in~y|)) (.cse2 (< |f_#in~x| 0)) (.cse1 (< 2147483647 |f_#in~x|))) (and (or (or (or (= 0 |f_#in~x|) .cse0 .cse1) .cse2) .cse3) (or (and (<= f_~x f_~y) (<= f_~y 2147483647) (not (= 0 f_~y)) (<= 0 f_~x)) .cse3 .cse0 .cse2 .cse1))) [2019-01-14 01:32:09,885 INFO L448 ceAbstractionStarter]: For program point L18-3(line 18) no Hoare annotation was computed. [2019-01-14 01:32:09,885 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 22) no Hoare annotation was computed. [2019-01-14 01:32:09,885 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 13 23) no Hoare annotation was computed. [2019-01-14 01:32:09,886 INFO L451 ceAbstractionStarter]: At program point fENTRY(lines 13 23) the Hoare annotation is: true [2019-01-14 01:32:09,886 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:32:09,886 INFO L444 ceAbstractionStarter]: At program point L31(lines 25 32) the Hoare annotation is: (<= ULTIMATE.start_main_~y~0 2147483647) [2019-01-14 01:32:09,886 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:32:09,886 INFO L444 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= ULTIMATE.start_main_~y~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0)) [2019-01-14 01:32:09,886 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:32:09,886 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2019-01-14 01:32:09,886 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-01-14 01:32:09,886 INFO L448 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-01-14 01:32:09,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:32:09 BoogieIcfgContainer [2019-01-14 01:32:09,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:32:09,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:32:09,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:32:09,902 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:32:09,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:31:40" (3/4) ... [2019-01-14 01:32:09,906 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:32:09,912 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-01-14 01:32:09,917 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 01:32:09,917 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 01:32:09,958 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:32:09,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:32:09,959 INFO L168 Benchmark]: Toolchain (without parser) took 30511.29 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 423.1 MB). Free memory was 951.3 MB in the beginning and 803.3 MB in the end (delta: 148.0 MB). Peak memory consumption was 571.1 MB. Max. memory is 11.5 GB. [2019-01-14 01:32:09,960 INFO L168 Benchmark]: CDTParser took 0.16 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 01:32:09,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.99 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 01:32:09,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.35 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 01:32:09,961 INFO L168 Benchmark]: Boogie Preprocessor took 27.13 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 01:32:09,962 INFO L168 Benchmark]: RCFGBuilder took 475.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:32:09,962 INFO L168 Benchmark]: TraceAbstraction took 29604.77 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 305.7 MB). Free memory was 1.1 GB in the beginning and 804.0 MB in the end (delta: 287.9 MB). Peak memory consumption was 606.0 MB. Max. memory is 11.5 GB. [2019-01-14 01:32:09,963 INFO L168 Benchmark]: Witness Printer took 56.86 ms. Allocated memory is still 1.5 GB. Free memory was 804.0 MB in the beginning and 803.3 MB in the end (delta: 739.2 kB). Peak memory consumption was 739.2 kB. Max. memory is 11.5 GB. [2019-01-14 01:32:09,967 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.16 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 298.99 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.35 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 27.13 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 475.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29604.77 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 305.7 MB). Free memory was 1.1 GB in the beginning and 804.0 MB in the end (delta: 287.9 MB). Peak memory consumption was 606.0 MB. Max. memory is 11.5 GB. * Witness Printer took 56.86 ms. Allocated memory is still 1.5 GB. Free memory was 804.0 MB in the beginning and 803.3 MB in the end (delta: 739.2 kB). Peak memory consumption was 739.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: 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: 25]: Loop Invariant Derived loop invariant: y <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 4 error locations. SAFE Result, 29.5s OverallTime, 23 OverallIterations, 19 TraceHistogramMax, 9.4s AutomataDifference, 0.0s DeadEndRemovalTime, 10.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 272 SDtfs, 1539 SDslu, 1122 SDs, 0 SdLazy, 2486 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1290 GetRequests, 765 SyntacticMatches, 6 SemanticMatches, 519 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4251 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=22, 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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 300 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 92 PreInvPairs, 92 NumberOfFragments, 174 HoareAnnotationTreeSize, 92 FomulaSimplifications, 42603069 FormulaSimplificationTreeSizeReduction, 3.7s HoareSimplificationTime, 5 FomulaSimplificationsInter, 2255871 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1609 NumberOfCodeBlocks, 1609 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 1568 ConstructedInterpolants, 0 QuantifiedInterpolants, 450795 SizeOfPredicates, 126 NumberOfNonLiveVariables, 1975 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 41 InterpolantComputations, 7 PerfectInterpolantSequences, 422/6215 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...