./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label54_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/eca-rers2012/Problem11_label54_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48edbfa8959379fa18549d69e0d1320a333e10c1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-12 03:43:30,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:43:30,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:43:30,485 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:43:30,486 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:43:30,488 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:43:30,489 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:43:30,491 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:43:30,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:43:30,494 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:43:30,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:43:30,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:43:30,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:43:30,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:43:30,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:43:30,509 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:43:30,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:43:30,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:43:30,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:43:30,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:43:30,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:43:30,525 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:43:30,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:43:30,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:43:30,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:43:30,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:43:30,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:43:30,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:43:30,532 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:43:30,536 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:43:30,536 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:43:30,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:43:30,537 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:43:30,537 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:43:30,538 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:43:30,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:43:30,539 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:43:30,566 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:43:30,567 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:43:30,568 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:43:30,568 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:43:30,568 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:43:30,569 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:43:30,569 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:43:30,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:43:30,570 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:43:30,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:43:30,570 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:43:30,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:43:30,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:43:30,571 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:43:30,571 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:43:30,571 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:43:30,571 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:43:30,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:43:30,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:43:30,572 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:43:30,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:43:30,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:43:30,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:43:30,574 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:43:30,574 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:43:30,574 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:43:30,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:43:30,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:43:30,575 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 ! call(__VERIFIER_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 48edbfa8959379fa18549d69e0d1320a333e10c1 [2019-01-12 03:43:30,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:43:30,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:43:30,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:43:30,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:43:30,651 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:43:30,652 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label54_true-unreach-call.c [2019-01-12 03:43:30,709 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6072eaaab/cdaf85403fcc4650a5e8d21b417f201c/FLAG57ce7de53 [2019-01-12 03:43:31,243 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:43:31,244 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label54_true-unreach-call.c [2019-01-12 03:43:31,273 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6072eaaab/cdaf85403fcc4650a5e8d21b417f201c/FLAG57ce7de53 [2019-01-12 03:43:31,497 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6072eaaab/cdaf85403fcc4650a5e8d21b417f201c [2019-01-12 03:43:31,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:43:31,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:43:31,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:43:31,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:43:31,508 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:43:31,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:43:31" (1/1) ... [2019-01-12 03:43:31,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5089c550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:31, skipping insertion in model container [2019-01-12 03:43:31,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:43:31" (1/1) ... [2019-01-12 03:43:31,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:43:31,602 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:43:32,183 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:43:32,188 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:43:32,399 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:43:32,420 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:43:32,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32 WrapperNode [2019-01-12 03:43:32,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:43:32,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:43:32,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:43:32,422 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:43:32,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32" (1/1) ... [2019-01-12 03:43:32,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32" (1/1) ... [2019-01-12 03:43:32,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:43:32,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:43:32,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:43:32,741 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:43:32,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32" (1/1) ... [2019-01-12 03:43:32,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32" (1/1) ... [2019-01-12 03:43:32,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32" (1/1) ... [2019-01-12 03:43:32,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32" (1/1) ... [2019-01-12 03:43:32,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32" (1/1) ... [2019-01-12 03:43:32,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32" (1/1) ... [2019-01-12 03:43:32,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32" (1/1) ... [2019-01-12 03:43:32,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:43:32,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:43:32,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:43:32,922 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:43:32,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:43:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:43:33,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:43:37,281 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:43:37,282 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:43:37,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:43:37 BoogieIcfgContainer [2019-01-12 03:43:37,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:43:37,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:43:37,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:43:37,288 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:43:37,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:43:31" (1/3) ... [2019-01-12 03:43:37,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fe69f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:43:37, skipping insertion in model container [2019-01-12 03:43:37,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:43:32" (2/3) ... [2019-01-12 03:43:37,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fe69f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:43:37, skipping insertion in model container [2019-01-12 03:43:37,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:43:37" (3/3) ... [2019-01-12 03:43:37,291 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label54_true-unreach-call.c [2019-01-12 03:43:37,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:43:37,311 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:43:37,328 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:43:37,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:43:37,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:43:37,363 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:43:37,363 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:43:37,363 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:43:37,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:43:37,364 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:43:37,364 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:43:37,364 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:43:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-01-12 03:43:37,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 03:43:37,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:37,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:37,402 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:37,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2019-01-12 03:43:37,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:37,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:37,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:37,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:37,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:37,875 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-12 03:43:37,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:37,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:43:37,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:37,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:37,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:37,908 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-01-12 03:43:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:41,302 INFO L93 Difference]: Finished difference Result 951 states and 1718 transitions. [2019-01-12 03:43:41,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:41,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-12 03:43:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:41,325 INFO L225 Difference]: With dead ends: 951 [2019-01-12 03:43:41,325 INFO L226 Difference]: Without dead ends: 600 [2019-01-12 03:43:41,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-01-12 03:43:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 410. [2019-01-12 03:43:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-01-12 03:43:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 593 transitions. [2019-01-12 03:43:41,423 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 593 transitions. Word has length 37 [2019-01-12 03:43:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:41,424 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 593 transitions. [2019-01-12 03:43:41,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 593 transitions. [2019-01-12 03:43:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 03:43:41,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:41,428 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:41,428 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:41,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:41,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1017074320, now seen corresponding path program 1 times [2019-01-12 03:43:41,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:41,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:41,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:41,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:41,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:43:41,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:41,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:43:41,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:41,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:41,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:41,685 INFO L87 Difference]: Start difference. First operand 410 states and 593 transitions. Second operand 4 states. [2019-01-12 03:43:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:44,385 INFO L93 Difference]: Finished difference Result 1572 states and 2289 transitions. [2019-01-12 03:43:44,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:44,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-01-12 03:43:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:44,393 INFO L225 Difference]: With dead ends: 1572 [2019-01-12 03:43:44,393 INFO L226 Difference]: Without dead ends: 1164 [2019-01-12 03:43:44,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-01-12 03:43:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1150. [2019-01-12 03:43:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-01-12 03:43:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1568 transitions. [2019-01-12 03:43:44,440 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1568 transitions. Word has length 105 [2019-01-12 03:43:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:44,441 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 1568 transitions. [2019-01-12 03:43:44,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1568 transitions. [2019-01-12 03:43:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 03:43:44,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:44,445 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:44,445 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:44,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:44,446 INFO L82 PathProgramCache]: Analyzing trace with hash -815400060, now seen corresponding path program 1 times [2019-01-12 03:43:44,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:44,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:44,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:44,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:44,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:43:44,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:44,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:43:44,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:44,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:44,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:44,751 INFO L87 Difference]: Start difference. First operand 1150 states and 1568 transitions. Second operand 4 states. [2019-01-12 03:43:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:47,843 INFO L93 Difference]: Finished difference Result 3966 states and 5431 transitions. [2019-01-12 03:43:47,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:47,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-01-12 03:43:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:47,861 INFO L225 Difference]: With dead ends: 3966 [2019-01-12 03:43:47,861 INFO L226 Difference]: Without dead ends: 2818 [2019-01-12 03:43:47,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-01-12 03:43:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2255. [2019-01-12 03:43:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2019-01-12 03:43:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2822 transitions. [2019-01-12 03:43:47,915 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2822 transitions. Word has length 113 [2019-01-12 03:43:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:47,915 INFO L480 AbstractCegarLoop]: Abstraction has 2255 states and 2822 transitions. [2019-01-12 03:43:47,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2822 transitions. [2019-01-12 03:43:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-12 03:43:47,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:47,920 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:47,920 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1041606763, now seen corresponding path program 1 times [2019-01-12 03:43:47,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:47,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:47,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:47,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:47,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:43:48,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:48,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:43:48,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:43:48,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:43:48,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:43:48,190 INFO L87 Difference]: Start difference. First operand 2255 states and 2822 transitions. Second operand 5 states. [2019-01-12 03:43:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:53,004 INFO L93 Difference]: Finished difference Result 7660 states and 9974 transitions. [2019-01-12 03:43:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:43:53,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-01-12 03:43:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:53,031 INFO L225 Difference]: With dead ends: 7660 [2019-01-12 03:43:53,031 INFO L226 Difference]: Without dead ends: 5591 [2019-01-12 03:43:53,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:43:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2019-01-12 03:43:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 5590. [2019-01-12 03:43:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2019-01-12 03:43:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 7031 transitions. [2019-01-12 03:43:53,146 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 7031 transitions. Word has length 164 [2019-01-12 03:43:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:53,148 INFO L480 AbstractCegarLoop]: Abstraction has 5590 states and 7031 transitions. [2019-01-12 03:43:53,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:43:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 7031 transitions. [2019-01-12 03:43:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-12 03:43:53,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:53,160 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:53,160 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:53,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:53,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1265356488, now seen corresponding path program 1 times [2019-01-12 03:43:53,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:53,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:53,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:53,775 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 03:43:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:43:53,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:53,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:43:53,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:53,850 INFO L87 Difference]: Start difference. First operand 5590 states and 7031 transitions. Second operand 4 states. [2019-01-12 03:43:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:55,958 INFO L93 Difference]: Finished difference Result 13956 states and 17807 transitions. [2019-01-12 03:43:55,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:55,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-01-12 03:43:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:55,993 INFO L225 Difference]: With dead ends: 13956 [2019-01-12 03:43:55,993 INFO L226 Difference]: Without dead ends: 8552 [2019-01-12 03:43:56,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:56,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8552 states. [2019-01-12 03:43:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8552 to 8166. [2019-01-12 03:43:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8166 states. [2019-01-12 03:43:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8166 states to 8166 states and 10171 transitions. [2019-01-12 03:43:56,142 INFO L78 Accepts]: Start accepts. Automaton has 8166 states and 10171 transitions. Word has length 241 [2019-01-12 03:43:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:56,142 INFO L480 AbstractCegarLoop]: Abstraction has 8166 states and 10171 transitions. [2019-01-12 03:43:56,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 8166 states and 10171 transitions. [2019-01-12 03:43:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-01-12 03:43:56,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:56,149 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:56,149 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:56,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:56,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1645985453, now seen corresponding path program 1 times [2019-01-12 03:43:56,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:56,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:56,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:56,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:56,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 03:43:56,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:56,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:43:56,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:56,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:56,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:56,395 INFO L87 Difference]: Start difference. First operand 8166 states and 10171 transitions. Second operand 4 states. [2019-01-12 03:43:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:58,319 INFO L93 Difference]: Finished difference Result 16351 states and 20392 transitions. [2019-01-12 03:43:58,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:58,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-01-12 03:43:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:58,367 INFO L225 Difference]: With dead ends: 16351 [2019-01-12 03:43:58,371 INFO L226 Difference]: Without dead ends: 8371 [2019-01-12 03:43:58,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8371 states. [2019-01-12 03:43:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8371 to 8165. [2019-01-12 03:43:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8165 states. [2019-01-12 03:43:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8165 states to 8165 states and 9878 transitions. [2019-01-12 03:43:58,515 INFO L78 Accepts]: Start accepts. Automaton has 8165 states and 9878 transitions. Word has length 246 [2019-01-12 03:43:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:58,516 INFO L480 AbstractCegarLoop]: Abstraction has 8165 states and 9878 transitions. [2019-01-12 03:43:58,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 8165 states and 9878 transitions. [2019-01-12 03:43:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-12 03:43:58,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:58,523 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:58,524 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:58,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1892161860, now seen corresponding path program 1 times [2019-01-12 03:43:58,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:58,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:58,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:58,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:58,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 03:43:58,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:58,900 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-12 03:43:58,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:59,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 03:43:59,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:43:59,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-01-12 03:43:59,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:43:59,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:43:59,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:43:59,289 INFO L87 Difference]: Start difference. First operand 8165 states and 9878 transitions. Second operand 5 states. [2019-01-12 03:44:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:03,181 INFO L93 Difference]: Finished difference Result 23515 states and 28459 transitions. [2019-01-12 03:44:03,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:44:03,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 272 [2019-01-12 03:44:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:03,226 INFO L225 Difference]: With dead ends: 23515 [2019-01-12 03:44:03,227 INFO L226 Difference]: Without dead ends: 15536 [2019-01-12 03:44:03,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:44:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15536 states. [2019-01-12 03:44:03,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15536 to 10921. [2019-01-12 03:44:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10921 states. [2019-01-12 03:44:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10921 states to 10921 states and 13172 transitions. [2019-01-12 03:44:03,543 INFO L78 Accepts]: Start accepts. Automaton has 10921 states and 13172 transitions. Word has length 272 [2019-01-12 03:44:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:03,545 INFO L480 AbstractCegarLoop]: Abstraction has 10921 states and 13172 transitions. [2019-01-12 03:44:03,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:44:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 10921 states and 13172 transitions. [2019-01-12 03:44:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-01-12 03:44:03,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:03,581 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:03,581 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:03,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1148105623, now seen corresponding path program 1 times [2019-01-12 03:44:03,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:03,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:03,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:03,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 35 proven. 285 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-01-12 03:44:04,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:44:04,109 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-12 03:44:04,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:04,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:44:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 35 proven. 285 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-01-12 03:44:04,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:44:04,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-01-12 03:44:04,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 03:44:04,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 03:44:04,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 03:44:04,417 INFO L87 Difference]: Start difference. First operand 10921 states and 13172 transitions. Second operand 6 states. [2019-01-12 03:44:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:08,520 INFO L93 Difference]: Finished difference Result 33296 states and 39888 transitions. [2019-01-12 03:44:08,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 03:44:08,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 394 [2019-01-12 03:44:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:08,569 INFO L225 Difference]: With dead ends: 33296 [2019-01-12 03:44:08,570 INFO L226 Difference]: Without dead ends: 22561 [2019-01-12 03:44:08,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:44:08,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22561 states. [2019-01-12 03:44:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22561 to 18676. [2019-01-12 03:44:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18676 states. [2019-01-12 03:44:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18676 states to 18676 states and 22166 transitions. [2019-01-12 03:44:08,894 INFO L78 Accepts]: Start accepts. Automaton has 18676 states and 22166 transitions. Word has length 394 [2019-01-12 03:44:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:08,895 INFO L480 AbstractCegarLoop]: Abstraction has 18676 states and 22166 transitions. [2019-01-12 03:44:08,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 03:44:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 18676 states and 22166 transitions. [2019-01-12 03:44:08,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-01-12 03:44:08,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:08,922 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:08,923 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:08,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:08,923 INFO L82 PathProgramCache]: Analyzing trace with hash -993773348, now seen corresponding path program 1 times [2019-01-12 03:44:08,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:08,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:08,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:08,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:08,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-01-12 03:44:09,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:09,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 03:44:09,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:44:09,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:44:09,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:44:09,528 INFO L87 Difference]: Start difference. First operand 18676 states and 22166 transitions. Second operand 3 states. [2019-01-12 03:44:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:11,269 INFO L93 Difference]: Finished difference Result 39368 states and 46744 transitions. [2019-01-12 03:44:11,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:44:11,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 406 [2019-01-12 03:44:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:11,302 INFO L225 Difference]: With dead ends: 39368 [2019-01-12 03:44:11,302 INFO L226 Difference]: Without dead ends: 19958 [2019-01-12 03:44:11,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:44:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19958 states. [2019-01-12 03:44:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19958 to 14616. [2019-01-12 03:44:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14616 states. [2019-01-12 03:44:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14616 states to 14616 states and 16704 transitions. [2019-01-12 03:44:11,588 INFO L78 Accepts]: Start accepts. Automaton has 14616 states and 16704 transitions. Word has length 406 [2019-01-12 03:44:11,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:11,589 INFO L480 AbstractCegarLoop]: Abstraction has 14616 states and 16704 transitions. [2019-01-12 03:44:11,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:44:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 14616 states and 16704 transitions. [2019-01-12 03:44:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-01-12 03:44:11,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:11,630 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:11,632 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash -584826003, now seen corresponding path program 1 times [2019-01-12 03:44:11,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:11,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:11,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:11,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:11,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 70 proven. 489 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-01-12 03:44:12,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:44:12,186 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-12 03:44:12,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:12,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:44:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 70 proven. 489 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-01-12 03:44:12,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:44:12,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-01-12 03:44:12,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 03:44:12,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 03:44:12,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 03:44:12,660 INFO L87 Difference]: Start difference. First operand 14616 states and 16704 transitions. Second operand 6 states. [2019-01-12 03:44:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:15,457 INFO L93 Difference]: Finished difference Result 34596 states and 39620 transitions. [2019-01-12 03:44:15,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 03:44:15,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 535 [2019-01-12 03:44:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:15,491 INFO L225 Difference]: With dead ends: 34596 [2019-01-12 03:44:15,492 INFO L226 Difference]: Without dead ends: 21090 [2019-01-12 03:44:15,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 534 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:44:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21090 states. [2019-01-12 03:44:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21090 to 14616. [2019-01-12 03:44:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14616 states. [2019-01-12 03:44:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14616 states to 14616 states and 16704 transitions. [2019-01-12 03:44:16,083 INFO L78 Accepts]: Start accepts. Automaton has 14616 states and 16704 transitions. Word has length 535 [2019-01-12 03:44:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:16,085 INFO L480 AbstractCegarLoop]: Abstraction has 14616 states and 16704 transitions. [2019-01-12 03:44:16,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 03:44:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 14616 states and 16704 transitions. [2019-01-12 03:44:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-01-12 03:44:16,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:16,120 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:16,120 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:16,120 INFO L82 PathProgramCache]: Analyzing trace with hash -861206840, now seen corresponding path program 1 times [2019-01-12 03:44:16,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:16,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:16,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:16,941 WARN L181 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-01-12 03:44:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-01-12 03:44:17,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:17,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:44:17,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:44:17,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:44:17,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:44:17,142 INFO L87 Difference]: Start difference. First operand 14616 states and 16704 transitions. Second operand 4 states. [2019-01-12 03:44:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:19,799 INFO L93 Difference]: Finished difference Result 29626 states and 33843 transitions. [2019-01-12 03:44:19,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:44:19,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 561 [2019-01-12 03:44:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:19,821 INFO L225 Difference]: With dead ends: 29626 [2019-01-12 03:44:19,821 INFO L226 Difference]: Without dead ends: 15196 [2019-01-12 03:44:19,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:44:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15196 states. [2019-01-12 03:44:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15196 to 14432. [2019-01-12 03:44:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14432 states. [2019-01-12 03:44:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14432 states to 14432 states and 16176 transitions. [2019-01-12 03:44:20,044 INFO L78 Accepts]: Start accepts. Automaton has 14432 states and 16176 transitions. Word has length 561 [2019-01-12 03:44:20,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:20,045 INFO L480 AbstractCegarLoop]: Abstraction has 14432 states and 16176 transitions. [2019-01-12 03:44:20,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:44:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 14432 states and 16176 transitions. [2019-01-12 03:44:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2019-01-12 03:44:20,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:20,084 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:20,084 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1717664100, now seen corresponding path program 1 times [2019-01-12 03:44:20,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:20,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:20,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:20,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 876 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-01-12 03:44:20,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:20,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:44:20,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:44:20,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:44:20,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:44:20,756 INFO L87 Difference]: Start difference. First operand 14432 states and 16176 transitions. Second operand 3 states. [2019-01-12 03:44:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:21,866 INFO L93 Difference]: Finished difference Result 33463 states and 37479 transitions. [2019-01-12 03:44:21,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:44:21,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 645 [2019-01-12 03:44:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:21,889 INFO L225 Difference]: With dead ends: 33463 [2019-01-12 03:44:21,889 INFO L226 Difference]: Without dead ends: 19217 [2019-01-12 03:44:21,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:44:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19217 states. [2019-01-12 03:44:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19217 to 16824. [2019-01-12 03:44:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16824 states. [2019-01-12 03:44:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16824 states to 16824 states and 18804 transitions. [2019-01-12 03:44:22,132 INFO L78 Accepts]: Start accepts. Automaton has 16824 states and 18804 transitions. Word has length 645 [2019-01-12 03:44:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:22,134 INFO L480 AbstractCegarLoop]: Abstraction has 16824 states and 18804 transitions. [2019-01-12 03:44:22,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:44:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 16824 states and 18804 transitions. [2019-01-12 03:44:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-01-12 03:44:22,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:22,173 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:22,174 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:22,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:22,174 INFO L82 PathProgramCache]: Analyzing trace with hash 431768013, now seen corresponding path program 1 times [2019-01-12 03:44:22,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:22,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:22,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 800 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2019-01-12 03:44:22,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:22,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:44:22,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:44:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:44:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:44:22,817 INFO L87 Difference]: Start difference. First operand 16824 states and 18804 transitions. Second operand 5 states. [2019-01-12 03:44:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:24,613 INFO L93 Difference]: Finished difference Result 33862 states and 37906 transitions. [2019-01-12 03:44:24,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:44:24,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 666 [2019-01-12 03:44:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:24,634 INFO L225 Difference]: With dead ends: 33862 [2019-01-12 03:44:24,634 INFO L226 Difference]: Without dead ends: 19068 [2019-01-12 03:44:24,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:44:24,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19068 states. [2019-01-12 03:44:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19068 to 17388. [2019-01-12 03:44:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17388 states. [2019-01-12 03:44:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17388 states to 17388 states and 19330 transitions. [2019-01-12 03:44:24,841 INFO L78 Accepts]: Start accepts. Automaton has 17388 states and 19330 transitions. Word has length 666 [2019-01-12 03:44:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:24,842 INFO L480 AbstractCegarLoop]: Abstraction has 17388 states and 19330 transitions. [2019-01-12 03:44:24,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:44:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 17388 states and 19330 transitions. [2019-01-12 03:44:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2019-01-12 03:44:24,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:24,863 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:24,863 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:24,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:24,863 INFO L82 PathProgramCache]: Analyzing trace with hash -507910000, now seen corresponding path program 1 times [2019-01-12 03:44:24,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:24,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:24,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:24,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:24,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-01-12 03:44:25,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:25,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:44:25,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:44:25,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:44:25,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:44:25,477 INFO L87 Difference]: Start difference. First operand 17388 states and 19330 transitions. Second operand 3 states. [2019-01-12 03:44:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:26,823 INFO L93 Difference]: Finished difference Result 35328 states and 39284 transitions. [2019-01-12 03:44:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:44:26,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 712 [2019-01-12 03:44:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:26,839 INFO L225 Difference]: With dead ends: 35328 [2019-01-12 03:44:26,840 INFO L226 Difference]: Without dead ends: 18126 [2019-01-12 03:44:26,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:44:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18126 states. [2019-01-12 03:44:26,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18126 to 17939. [2019-01-12 03:44:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17939 states. [2019-01-12 03:44:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17939 states to 17939 states and 19630 transitions. [2019-01-12 03:44:27,011 INFO L78 Accepts]: Start accepts. Automaton has 17939 states and 19630 transitions. Word has length 712 [2019-01-12 03:44:27,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:27,011 INFO L480 AbstractCegarLoop]: Abstraction has 17939 states and 19630 transitions. [2019-01-12 03:44:27,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:44:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 17939 states and 19630 transitions. [2019-01-12 03:44:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2019-01-12 03:44:27,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:27,028 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:27,028 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash -366256285, now seen corresponding path program 1 times [2019-01-12 03:44:27,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:27,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:27,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:27,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:27,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2019-01-12 03:44:27,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:27,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:44:27,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:44:27,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:44:27,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:44:27,894 INFO L87 Difference]: Start difference. First operand 17939 states and 19630 transitions. Second operand 3 states. [2019-01-12 03:44:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:28,956 INFO L93 Difference]: Finished difference Result 35130 states and 38364 transitions. [2019-01-12 03:44:28,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:44:28,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 735 [2019-01-12 03:44:28,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:28,974 INFO L225 Difference]: With dead ends: 35130 [2019-01-12 03:44:28,974 INFO L226 Difference]: Without dead ends: 19405 [2019-01-12 03:44:28,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:44:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19405 states. [2019-01-12 03:44:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19405 to 17564. [2019-01-12 03:44:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17564 states. [2019-01-12 03:44:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17564 states to 17564 states and 19109 transitions. [2019-01-12 03:44:29,170 INFO L78 Accepts]: Start accepts. Automaton has 17564 states and 19109 transitions. Word has length 735 [2019-01-12 03:44:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:29,171 INFO L480 AbstractCegarLoop]: Abstraction has 17564 states and 19109 transitions. [2019-01-12 03:44:29,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:44:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 17564 states and 19109 transitions. [2019-01-12 03:44:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2019-01-12 03:44:29,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:29,190 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:29,190 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:29,192 INFO L82 PathProgramCache]: Analyzing trace with hash 410572850, now seen corresponding path program 1 times [2019-01-12 03:44:29,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:29,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:29,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:29,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:29,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:29,786 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2019-01-12 03:44:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 1336 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2019-01-12 03:44:30,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:30,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:44:30,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:44:30,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:44:30,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:44:30,082 INFO L87 Difference]: Start difference. First operand 17564 states and 19109 transitions. Second operand 3 states. [2019-01-12 03:44:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:31,046 INFO L93 Difference]: Finished difference Result 30344 states and 32999 transitions. [2019-01-12 03:44:31,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:44:31,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 787 [2019-01-12 03:44:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:31,047 INFO L225 Difference]: With dead ends: 30344 [2019-01-12 03:44:31,047 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:44:31,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:44:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:44:31,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:44:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:44:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:44:31,057 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 787 [2019-01-12 03:44:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:31,057 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:44:31,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:44:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:44:31,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:44:31,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:44:31,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:31,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,057 WARN L181 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 484 DAG size of output: 352 [2019-01-12 03:44:32,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:32,814 WARN L181 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 484 DAG size of output: 352 [2019-01-12 03:44:35,426 WARN L181 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 340 DAG size of output: 86 [2019-01-12 03:44:37,613 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 340 DAG size of output: 86 [2019-01-12 03:44:37,617 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-12 03:44:37,617 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-01-12 03:44:37,617 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-12 03:44:37,617 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-01-12 03:44:37,617 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,618 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,618 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,618 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,618 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,618 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,618 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,618 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 03:44:37,618 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-12 03:44:37,618 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 03:44:37,618 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,618 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,619 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,619 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,619 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,619 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,619 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,619 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,619 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,619 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-01-12 03:44:37,619 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-01-12 03:44:37,619 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-12 03:44:37,619 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,620 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse11 (= ~a25~0 13))) (let ((.cse15 (= ~a25~0 9)) (.cse0 (not .cse11)) (.cse4 (<= ~a29~0 140))) (let ((.cse10 (<= ~a29~0 277)) (.cse1 (= ~a25~0 10)) (.cse9 (and .cse0 .cse4)) (.cse6 (<= ~a23~0 599999)) (.cse16 (<= 312 ~a23~0)) (.cse19 (not .cse15)) (.cse17 (<= ~a23~0 312)) (.cse7 (<= ~a29~0 276)) (.cse8 (<= (+ ~a23~0 212) 0)) (.cse18 (= ~a25~0 12)) (.cse12 (<= ~a23~0 138)) (.cse2 (<= 0 (+ ~a23~0 42))) (.cse13 (<= ~a23~0 600000)) (.cse5 (< 140 ~a29~0)) (.cse14 (< 306 ~a23~0)) (.cse3 (= ~a4~0 1))) (or (and .cse0 (not .cse1) (<= (+ ~a23~0 213) 0)) (and .cse2 (and (not .cse3) (and .cse1 .cse4))) (and .cse5 (and .cse6 .cse7 .cse3)) (and .cse8 .cse9) (and (and .cse3 (and .cse10 .cse1)) .cse5) (and .cse11 .cse5 .cse3 (<= ~a29~0 245)) (and .cse11 .cse12 .cse2) (and .cse13 .cse11 .cse14 .cse3) (and (and .cse15 .cse3 .cse16) .cse5 .cse10) (and .cse15 .cse12) (and .cse13 (and .cse3 .cse1)) (and .cse3 (and .cse17 .cse9)) (or (and .cse18 (<= ~a4~0 0) .cse7) (and .cse18 .cse7 .cse12)) (and .cse6 .cse19 .cse3 (<= ~a29~0 130) .cse16) (and .cse19 .cse17 .cse3 .cse2) (and .cse11 .cse7 .cse5 .cse12) (or (and .cse7 .cse3 .cse12 (<= 130 ~a29~0)) (and .cse0 .cse3 .cse12)) (and .cse18 .cse8) (and .cse18 .cse12 .cse2) (and .cse13 .cse5 .cse14 .cse3))))) [2019-01-12 03:44:37,620 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,620 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,620 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,620 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,620 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,620 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,620 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,621 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,621 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-01-12 03:44:37,621 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-01-12 03:44:37,621 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-12 03:44:37,621 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:44:37,621 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:44:37,621 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:44:37,621 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:44:37,621 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,621 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,621 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,622 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,622 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,622 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,622 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,622 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,622 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,622 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,622 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2019-01-12 03:44:37,622 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-12 03:44:37,622 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,623 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,624 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,624 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:44:37,624 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:44:37,624 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,624 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,624 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,624 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,624 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,624 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,624 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:44:37,624 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,625 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:44:37,626 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:44:37,627 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,627 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,627 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,627 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,627 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,627 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 03:44:37,627 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-01-12 03:44:37,627 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-01-12 03:44:37,627 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,627 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,627 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,628 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,629 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,630 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,631 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:44:37,632 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:44:37,632 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,632 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,633 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,633 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,633 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,633 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-01-12 03:44:37,633 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-01-12 03:44:37,633 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,633 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,633 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:44:37,634 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:44:37,634 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,634 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,634 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,634 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,634 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,634 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,634 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-01-12 03:44:37,634 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-12 03:44:37,634 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-01-12 03:44:37,635 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-01-12 03:44:37,636 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,637 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,638 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-12 03:44:37,639 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,640 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,640 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,640 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:44:37,640 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,640 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,640 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,640 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,640 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,640 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,640 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,640 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,641 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-01-12 03:44:37,642 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-01-12 03:44:37,642 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-12 03:44:37,642 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,642 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,642 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,642 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse11 (= ~a25~0 13))) (let ((.cse15 (= ~a25~0 9)) (.cse0 (not .cse11)) (.cse4 (<= ~a29~0 140))) (let ((.cse10 (<= ~a29~0 277)) (.cse1 (= ~a25~0 10)) (.cse9 (and .cse0 .cse4)) (.cse6 (<= ~a23~0 599999)) (.cse16 (<= 312 ~a23~0)) (.cse19 (not .cse15)) (.cse17 (<= ~a23~0 312)) (.cse7 (<= ~a29~0 276)) (.cse8 (<= (+ ~a23~0 212) 0)) (.cse18 (= ~a25~0 12)) (.cse12 (<= ~a23~0 138)) (.cse2 (<= 0 (+ ~a23~0 42))) (.cse13 (<= ~a23~0 600000)) (.cse5 (< 140 ~a29~0)) (.cse14 (< 306 ~a23~0)) (.cse3 (= ~a4~0 1))) (or (and .cse0 (not .cse1) (<= (+ ~a23~0 213) 0)) (and .cse2 (and (not .cse3) (and .cse1 .cse4))) (and .cse5 (and .cse6 .cse7 .cse3)) (and .cse8 .cse9) (and (and .cse3 (and .cse10 .cse1)) .cse5) (and .cse11 .cse5 .cse3 (<= ~a29~0 245)) (and .cse11 .cse12 .cse2) (and .cse13 .cse11 .cse14 .cse3) (and (and .cse15 .cse3 .cse16) .cse5 .cse10) (and .cse15 .cse12) (and .cse13 (and .cse3 .cse1)) (and .cse3 (and .cse17 .cse9)) (or (and .cse18 (<= ~a4~0 0) .cse7) (and .cse18 .cse7 .cse12)) (and .cse6 .cse19 .cse3 (<= ~a29~0 130) .cse16) (and .cse19 .cse17 .cse3 .cse2) (and .cse11 .cse7 .cse5 .cse12) (or (and .cse7 .cse3 .cse12 (<= 130 ~a29~0)) (and .cse0 .cse3 .cse12)) (and .cse18 .cse8) (and .cse18 .cse12 .cse2) (and .cse13 .cse5 .cse14 .cse3))))) [2019-01-12 03:44:37,642 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,643 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:44:37,643 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:44:37,643 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,643 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,643 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-01-12 03:44:37,643 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,643 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,643 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:37,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:44:37 BoogieIcfgContainer [2019-01-12 03:44:37,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:44:37,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:44:37,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:44:37,686 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:44:37,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:43:37" (3/4) ... [2019-01-12 03:44:37,702 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:44:37,744 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:44:37,746 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:44:37,978 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:44:37,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:44:37,979 INFO L168 Benchmark]: Toolchain (without parser) took 66477.34 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 943.3 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 461.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:37,982 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:44:37,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 917.92 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 889.6 MB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:37,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 317.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 889.6 MB in the beginning and 1.1 GB in the end (delta: -226.3 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:37,983 INFO L168 Benchmark]: Boogie Preprocessor took 180.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:37,985 INFO L168 Benchmark]: RCFGBuilder took 4362.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 932.9 MB in the end (delta: 169.3 MB). Peak memory consumption was 169.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:37,986 INFO L168 Benchmark]: TraceAbstraction took 60400.94 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 932.9 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-01-12 03:44:37,986 INFO L168 Benchmark]: Witness Printer took 292.36 ms. Allocated memory is still 2.8 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:37,992 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 917.92 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 889.6 MB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 317.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 889.6 MB in the beginning and 1.1 GB in the end (delta: -226.3 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 180.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4362.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 932.9 MB in the end (delta: 169.3 MB). Peak memory consumption was 169.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60400.94 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 932.9 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 292.36 ms. Allocated memory is still 2.8 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 117]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(a25 == 13) && !(a25 == 10)) && a23 + 213 <= 0) || (0 <= a23 + 42 && !(a4 == 1) && a25 == 10 && a29 <= 140)) || (140 < a29 && (a23 <= 599999 && a29 <= 276) && a4 == 1)) || (a23 + 212 <= 0 && !(a25 == 13) && a29 <= 140)) || ((a4 == 1 && a29 <= 277 && a25 == 10) && 140 < a29)) || (((a25 == 13 && 140 < a29) && a4 == 1) && a29 <= 245)) || ((a25 == 13 && a23 <= 138) && 0 <= a23 + 42)) || (((a23 <= 600000 && a25 == 13) && 306 < a23) && a4 == 1)) || ((((a25 == 9 && a4 == 1) && 312 <= a23) && 140 < a29) && a29 <= 277)) || (a25 == 9 && a23 <= 138)) || (a23 <= 600000 && a4 == 1 && a25 == 10)) || (a4 == 1 && a23 <= 312 && !(a25 == 13) && a29 <= 140)) || ((a25 == 12 && a4 <= 0) && a29 <= 276) || ((a25 == 12 && a29 <= 276) && a23 <= 138)) || ((((a23 <= 599999 && !(a25 == 9)) && a4 == 1) && a29 <= 130) && 312 <= a23)) || (((!(a25 == 9) && a23 <= 312) && a4 == 1) && 0 <= a23 + 42)) || (((a25 == 13 && a29 <= 276) && 140 < a29) && a23 <= 138)) || (((a29 <= 276 && a4 == 1) && a23 <= 138) && 130 <= a29) || ((!(a25 == 13) && a4 == 1) && a23 <= 138)) || (a25 == 12 && a23 + 212 <= 0)) || ((a25 == 12 && a23 <= 138) && 0 <= a23 + 42)) || (((a23 <= 600000 && 140 < a29) && 306 < a23) && a4 == 1) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(a25 == 13) && !(a25 == 10)) && a23 + 213 <= 0) || (0 <= a23 + 42 && !(a4 == 1) && a25 == 10 && a29 <= 140)) || (140 < a29 && (a23 <= 599999 && a29 <= 276) && a4 == 1)) || (a23 + 212 <= 0 && !(a25 == 13) && a29 <= 140)) || ((a4 == 1 && a29 <= 277 && a25 == 10) && 140 < a29)) || (((a25 == 13 && 140 < a29) && a4 == 1) && a29 <= 245)) || ((a25 == 13 && a23 <= 138) && 0 <= a23 + 42)) || (((a23 <= 600000 && a25 == 13) && 306 < a23) && a4 == 1)) || ((((a25 == 9 && a4 == 1) && 312 <= a23) && 140 < a29) && a29 <= 277)) || (a25 == 9 && a23 <= 138)) || (a23 <= 600000 && a4 == 1 && a25 == 10)) || (a4 == 1 && a23 <= 312 && !(a25 == 13) && a29 <= 140)) || ((a25 == 12 && a4 <= 0) && a29 <= 276) || ((a25 == 12 && a29 <= 276) && a23 <= 138)) || ((((a23 <= 599999 && !(a25 == 9)) && a4 == 1) && a29 <= 130) && 312 <= a23)) || (((!(a25 == 9) && a23 <= 312) && a4 == 1) && 0 <= a23 + 42)) || (((a25 == 13 && a29 <= 276) && 140 < a29) && a23 <= 138)) || (((a29 <= 276 && a4 == 1) && a23 <= 138) && 130 <= a29) || ((!(a25 == 13) && a4 == 1) && a23 <= 138)) || (a25 == 12 && a23 + 212 <= 0)) || ((a25 == 12 && a23 <= 138) && 0 <= a23 + 42)) || (((a23 <= 600000 && 140 < a29) && 306 < a23) && a4 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 60.2s OverallTime, 16 OverallIterations, 7 TraceHistogramMax, 40.1s AutomataDifference, 0.0s DeadEndRemovalTime, 6.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2674 SDtfs, 6771 SDslu, 656 SDs, 0 SdLazy, 16523 SolverSat, 3774 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1264 GetRequests, 1219 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18676occurred in iteration=8, 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: 2.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 28541 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 184 NumberOfFragments, 583 HoareAnnotationTreeSize, 3 FomulaSimplifications, 90326 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 81780 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 7820 NumberOfCodeBlocks, 7820 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 7801 ConstructedInterpolants, 0 QuantifiedInterpolants, 8680186 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1566 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 10074/11760 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...