./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label26_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/Problem15_label26_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 470b628433c20f1f4cfd605e13f92536d937b372 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:34:35,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:34:35,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:34:35,437 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:34:35,438 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:34:35,439 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:34:35,440 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:34:35,442 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:34:35,444 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:34:35,445 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:34:35,445 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:34:35,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:34:35,446 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:34:35,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:34:35,449 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:34:35,450 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:34:35,451 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:34:35,453 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:34:35,454 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:34:35,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:34:35,458 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:34:35,459 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:34:35,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:34:35,464 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:34:35,465 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:34:35,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:34:35,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:34:35,471 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:34:35,474 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:34:35,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:34:35,475 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:34:35,476 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:34:35,478 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:34:35,478 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:34:35,479 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:34:35,480 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:34:35,480 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:34:35,500 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:34:35,501 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:34:35,503 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:34:35,504 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:34:35,504 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:34:35,504 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:34:35,504 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:34:35,504 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:34:35,504 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:34:35,505 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:34:35,505 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:34:35,505 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:34:35,505 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:34:35,505 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:34:35,505 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:34:35,506 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:34:35,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:34:35,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:34:35,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:34:35,507 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:34:35,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:34:35,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:34:35,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:34:35,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:34:35,508 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:34:35,508 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:34:35,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:34:35,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:34:35,509 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 -> 470b628433c20f1f4cfd605e13f92536d937b372 [2019-01-12 04:34:35,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:34:35,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:34:35,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:34:35,576 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:34:35,577 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:34:35,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label26_true-unreach-call.c [2019-01-12 04:34:35,639 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1d1bacd/cdae4b50e18d46d1ae273967f8c42f0e/FLAG4550a4fe7 [2019-01-12 04:34:36,294 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:34:36,295 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label26_true-unreach-call.c [2019-01-12 04:34:36,323 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1d1bacd/cdae4b50e18d46d1ae273967f8c42f0e/FLAG4550a4fe7 [2019-01-12 04:34:36,428 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1d1bacd/cdae4b50e18d46d1ae273967f8c42f0e [2019-01-12 04:34:36,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:34:36,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:34:36,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:34:36,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:34:36,443 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:34:36,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:34:36" (1/1) ... [2019-01-12 04:34:36,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0e8c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:36, skipping insertion in model container [2019-01-12 04:34:36,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:34:36" (1/1) ... [2019-01-12 04:34:36,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:34:36,558 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:34:37,391 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:34:37,404 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:34:37,808 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:34:37,831 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:34:37,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37 WrapperNode [2019-01-12 04:34:37,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:34:37,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:34:37,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:34:37,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:34:37,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37" (1/1) ... [2019-01-12 04:34:38,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37" (1/1) ... [2019-01-12 04:34:38,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:34:38,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:34:38,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:34:38,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:34:38,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37" (1/1) ... [2019-01-12 04:34:38,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37" (1/1) ... [2019-01-12 04:34:38,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37" (1/1) ... [2019-01-12 04:34:38,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37" (1/1) ... [2019-01-12 04:34:38,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37" (1/1) ... [2019-01-12 04:34:38,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37" (1/1) ... [2019-01-12 04:34:38,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37" (1/1) ... [2019-01-12 04:34:38,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:34:38,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:34:38,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:34:38,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:34:38,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37" (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 04:34:38,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:34:38,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:34:46,766 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:34:46,766 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:34:46,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:46 BoogieIcfgContainer [2019-01-12 04:34:46,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:34:46,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:34:46,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:34:46,773 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:34:46,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:34:36" (1/3) ... [2019-01-12 04:34:46,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e956fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:34:46, skipping insertion in model container [2019-01-12 04:34:46,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:37" (2/3) ... [2019-01-12 04:34:46,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e956fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:34:46, skipping insertion in model container [2019-01-12 04:34:46,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:46" (3/3) ... [2019-01-12 04:34:46,777 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label26_true-unreach-call.c [2019-01-12 04:34:46,787 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:34:46,798 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:34:46,815 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:34:46,861 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:34:46,861 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:34:46,862 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:34:46,862 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:34:46,862 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:34:46,862 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:34:46,862 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:34:46,862 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:34:46,862 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:34:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:34:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 04:34:46,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:46,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:46,899 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2019-01-12 04:34:46,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:46,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:46,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:46,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:46,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:47,359 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 04:34:47,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:47,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:34:47,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:47,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:47,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:47,385 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:34:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:53,694 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-01-12 04:34:53,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:34:53,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-12 04:34:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:53,722 INFO L225 Difference]: With dead ends: 1466 [2019-01-12 04:34:53,723 INFO L226 Difference]: Without dead ends: 974 [2019-01-12 04:34:53,729 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 04:34:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-01-12 04:34:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-01-12 04:34:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-01-12 04:34:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-01-12 04:34:53,833 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 53 [2019-01-12 04:34:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:53,834 INFO L480 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-01-12 04:34:53,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:34:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-01-12 04:34:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-12 04:34:53,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:53,840 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, 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] [2019-01-12 04:34:53,841 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:53,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1371805199, now seen corresponding path program 1 times [2019-01-12 04:34:53,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:53,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:53,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:53,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:53,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:34:54,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:54,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:34:54,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:54,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:54,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:54,230 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2019-01-12 04:35:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:00,484 INFO L93 Difference]: Finished difference Result 3751 states and 5444 transitions. [2019-01-12 04:35:00,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:00,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-01-12 04:35:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:00,501 INFO L225 Difference]: With dead ends: 3751 [2019-01-12 04:35:00,501 INFO L226 Difference]: Without dead ends: 2781 [2019-01-12 04:35:00,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 04:35:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2019-01-12 04:35:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2477. [2019-01-12 04:35:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-01-12 04:35:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3302 transitions. [2019-01-12 04:35:00,567 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3302 transitions. Word has length 118 [2019-01-12 04:35:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:00,568 INFO L480 AbstractCegarLoop]: Abstraction has 2477 states and 3302 transitions. [2019-01-12 04:35:00,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3302 transitions. [2019-01-12 04:35:00,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-01-12 04:35:00,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:00,578 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:00,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:00,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:00,580 INFO L82 PathProgramCache]: Analyzing trace with hash 687400732, now seen corresponding path program 1 times [2019-01-12 04:35:00,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:00,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:00,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:00,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:00,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-01-12 04:35:01,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:01,136 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 04:35:01,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:01,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:35:01,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:35:01,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-01-12 04:35:01,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:35:01,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:35:01,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:01,425 INFO L87 Difference]: Start difference. First operand 2477 states and 3302 transitions. Second operand 4 states. [2019-01-12 04:35:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:06,843 INFO L93 Difference]: Finished difference Result 9147 states and 12151 transitions. [2019-01-12 04:35:06,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:06,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2019-01-12 04:35:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:06,877 INFO L225 Difference]: With dead ends: 9147 [2019-01-12 04:35:06,877 INFO L226 Difference]: Without dead ends: 6672 [2019-01-12 04:35:06,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 263 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 04:35:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6672 states. [2019-01-12 04:35:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6672 to 2775. [2019-01-12 04:35:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-01-12 04:35:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3654 transitions. [2019-01-12 04:35:06,960 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3654 transitions. Word has length 263 [2019-01-12 04:35:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:06,963 INFO L480 AbstractCegarLoop]: Abstraction has 2775 states and 3654 transitions. [2019-01-12 04:35:06,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3654 transitions. [2019-01-12 04:35:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-12 04:35:06,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:06,973 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:06,973 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:06,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:06,973 INFO L82 PathProgramCache]: Analyzing trace with hash -628651217, now seen corresponding path program 1 times [2019-01-12 04:35:06,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:06,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:06,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-12 04:35:07,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:07,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:35:07,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:35:07,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:35:07,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:07,520 INFO L87 Difference]: Start difference. First operand 2775 states and 3654 transitions. Second operand 5 states. [2019-01-12 04:35:11,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:11,596 INFO L93 Difference]: Finished difference Result 6746 states and 8608 transitions. [2019-01-12 04:35:11,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:11,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 330 [2019-01-12 04:35:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:11,617 INFO L225 Difference]: With dead ends: 6746 [2019-01-12 04:35:11,617 INFO L226 Difference]: Without dead ends: 3973 [2019-01-12 04:35:11,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 04:35:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2019-01-12 04:35:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3673. [2019-01-12 04:35:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-01-12 04:35:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4606 transitions. [2019-01-12 04:35:11,693 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4606 transitions. Word has length 330 [2019-01-12 04:35:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:11,694 INFO L480 AbstractCegarLoop]: Abstraction has 3673 states and 4606 transitions. [2019-01-12 04:35:11,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:35:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4606 transitions. [2019-01-12 04:35:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-01-12 04:35:11,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:11,702 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:11,704 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:11,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:11,704 INFO L82 PathProgramCache]: Analyzing trace with hash 424213697, now seen corresponding path program 1 times [2019-01-12 04:35:11,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:11,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:11,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:11,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:11,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:12,381 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 04:35:12,559 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-01-12 04:35:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 111 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:35:13,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:13,250 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 04:35:13,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:13,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:35:13,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:35:13,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-01-12 04:35:13,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:35:13,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:35:13,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:35:13,513 INFO L87 Difference]: Start difference. First operand 3673 states and 4606 transitions. Second operand 9 states. [2019-01-12 04:35:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:22,213 INFO L93 Difference]: Finished difference Result 8892 states and 11158 transitions. [2019-01-12 04:35:22,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:35:22,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 404 [2019-01-12 04:35:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:22,243 INFO L225 Difference]: With dead ends: 8892 [2019-01-12 04:35:22,243 INFO L226 Difference]: Without dead ends: 5221 [2019-01-12 04:35:22,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 407 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:35:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2019-01-12 04:35:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 4571. [2019-01-12 04:35:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4571 states. [2019-01-12 04:35:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 5459 transitions. [2019-01-12 04:35:22,344 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 5459 transitions. Word has length 404 [2019-01-12 04:35:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:22,345 INFO L480 AbstractCegarLoop]: Abstraction has 4571 states and 5459 transitions. [2019-01-12 04:35:22,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:35:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 5459 transitions. [2019-01-12 04:35:22,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-01-12 04:35:22,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:22,355 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:22,355 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:22,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:22,357 INFO L82 PathProgramCache]: Analyzing trace with hash 39762111, now seen corresponding path program 1 times [2019-01-12 04:35:22,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:22,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:22,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-12 04:35:22,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:22,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:35:22,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:35:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:35:22,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:22,879 INFO L87 Difference]: Start difference. First operand 4571 states and 5459 transitions. Second operand 4 states. [2019-01-12 04:35:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:26,021 INFO L93 Difference]: Finished difference Result 10036 states and 12084 transitions. [2019-01-12 04:35:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:26,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 422 [2019-01-12 04:35:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:26,050 INFO L225 Difference]: With dead ends: 10036 [2019-01-12 04:35:26,050 INFO L226 Difference]: Without dead ends: 5467 [2019-01-12 04:35:26,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:35:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2019-01-12 04:35:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 5465. [2019-01-12 04:35:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5465 states. [2019-01-12 04:35:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 6392 transitions. [2019-01-12 04:35:26,142 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 6392 transitions. Word has length 422 [2019-01-12 04:35:26,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:26,144 INFO L480 AbstractCegarLoop]: Abstraction has 5465 states and 6392 transitions. [2019-01-12 04:35:26,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 6392 transitions. [2019-01-12 04:35:26,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-01-12 04:35:26,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:26,156 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:26,157 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1964586309, now seen corresponding path program 1 times [2019-01-12 04:35:26,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:26,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:26,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:26,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:26,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-01-12 04:35:26,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:26,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:35:26,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:35:26,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:35:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:26,701 INFO L87 Difference]: Start difference. First operand 5465 states and 6392 transitions. Second operand 3 states. [2019-01-12 04:35:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:29,796 INFO L93 Difference]: Finished difference Result 12721 states and 15122 transitions. [2019-01-12 04:35:29,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:35:29,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 517 [2019-01-12 04:35:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:29,826 INFO L225 Difference]: With dead ends: 12721 [2019-01-12 04:35:29,826 INFO L226 Difference]: Without dead ends: 7258 [2019-01-12 04:35:29,833 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 04:35:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7258 states. [2019-01-12 04:35:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7258 to 7258. [2019-01-12 04:35:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7258 states. [2019-01-12 04:35:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7258 states to 7258 states and 8466 transitions. [2019-01-12 04:35:29,944 INFO L78 Accepts]: Start accepts. Automaton has 7258 states and 8466 transitions. Word has length 517 [2019-01-12 04:35:29,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:29,945 INFO L480 AbstractCegarLoop]: Abstraction has 7258 states and 8466 transitions. [2019-01-12 04:35:29,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:35:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7258 states and 8466 transitions. [2019-01-12 04:35:29,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-01-12 04:35:29,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:29,963 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:29,963 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:29,965 INFO L82 PathProgramCache]: Analyzing trace with hash 667607770, now seen corresponding path program 1 times [2019-01-12 04:35:29,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:29,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:29,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:29,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:29,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:30,626 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:35:31,132 WARN L181 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2019-01-12 04:35:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 634 proven. 3 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 04:35:31,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:31,925 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 04:35:31,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:32,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 04:35:32,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:35:32,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-01-12 04:35:32,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:35:32,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:35:32,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:35:32,957 INFO L87 Difference]: Start difference. First operand 7258 states and 8466 transitions. Second operand 9 states. [2019-01-12 04:35:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:42,238 INFO L93 Difference]: Finished difference Result 19453 states and 22363 transitions. [2019-01-12 04:35:42,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 04:35:42,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 608 [2019-01-12 04:35:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:42,259 INFO L225 Difference]: With dead ends: 19453 [2019-01-12 04:35:42,260 INFO L226 Difference]: Without dead ends: 9051 [2019-01-12 04:35:42,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 605 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:35:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2019-01-12 04:35:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 6658. [2019-01-12 04:35:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6658 states. [2019-01-12 04:35:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 7070 transitions. [2019-01-12 04:35:42,366 INFO L78 Accepts]: Start accepts. Automaton has 6658 states and 7070 transitions. Word has length 608 [2019-01-12 04:35:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:42,367 INFO L480 AbstractCegarLoop]: Abstraction has 6658 states and 7070 transitions. [2019-01-12 04:35:42,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:35:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 6658 states and 7070 transitions. [2019-01-12 04:35:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2019-01-12 04:35:42,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:42,376 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:42,377 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:42,378 INFO L82 PathProgramCache]: Analyzing trace with hash -450281948, now seen corresponding path program 1 times [2019-01-12 04:35:42,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:42,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:42,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:42,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:42,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-01-12 04:35:42,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:42,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:35:42,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:35:42,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:35:42,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:42,792 INFO L87 Difference]: Start difference. First operand 6658 states and 7070 transitions. Second operand 3 states. [2019-01-12 04:35:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:44,257 INFO L93 Difference]: Finished difference Result 13312 states and 14136 transitions. [2019-01-12 04:35:44,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:35:44,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 650 [2019-01-12 04:35:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:44,272 INFO L225 Difference]: With dead ends: 13312 [2019-01-12 04:35:44,272 INFO L226 Difference]: Without dead ends: 6656 [2019-01-12 04:35:44,280 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 04:35:44,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2019-01-12 04:35:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6656. [2019-01-12 04:35:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6656 states. [2019-01-12 04:35:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 7066 transitions. [2019-01-12 04:35:44,366 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 7066 transitions. Word has length 650 [2019-01-12 04:35:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:44,367 INFO L480 AbstractCegarLoop]: Abstraction has 6656 states and 7066 transitions. [2019-01-12 04:35:44,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:35:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 7066 transitions. [2019-01-12 04:35:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2019-01-12 04:35:44,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:44,378 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:44,378 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1841661433, now seen corresponding path program 1 times [2019-01-12 04:35:44,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:44,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:44,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:44,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:44,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-01-12 04:35:45,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:45,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:35:45,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:35:45,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:35:45,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:45,112 INFO L87 Difference]: Start difference. First operand 6656 states and 7066 transitions. Second operand 4 states. [2019-01-12 04:35:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:47,192 INFO L93 Difference]: Finished difference Result 18401 states and 19606 transitions. [2019-01-12 04:35:47,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:47,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 685 [2019-01-12 04:35:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:47,219 INFO L225 Difference]: With dead ends: 18401 [2019-01-12 04:35:47,220 INFO L226 Difference]: Without dead ends: 11747 [2019-01-12 04:35:47,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:35:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11747 states. [2019-01-12 04:35:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11747 to 8451. [2019-01-12 04:35:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8451 states. [2019-01-12 04:35:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8451 states to 8451 states and 8974 transitions. [2019-01-12 04:35:47,350 INFO L78 Accepts]: Start accepts. Automaton has 8451 states and 8974 transitions. Word has length 685 [2019-01-12 04:35:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:47,351 INFO L480 AbstractCegarLoop]: Abstraction has 8451 states and 8974 transitions. [2019-01-12 04:35:47,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 8451 states and 8974 transitions. [2019-01-12 04:35:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-01-12 04:35:47,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:47,363 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, 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, 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, 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, 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] [2019-01-12 04:35:47,363 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:47,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1459953853, now seen corresponding path program 1 times [2019-01-12 04:35:47,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:47,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:47,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:47,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:47,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-01-12 04:35:48,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:48,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:35:48,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:35:48,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:35:48,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:48,024 INFO L87 Difference]: Start difference. First operand 8451 states and 8974 transitions. Second operand 5 states. [2019-01-12 04:35:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:51,352 INFO L93 Difference]: Finished difference Result 21095 states and 22468 transitions. [2019-01-12 04:35:51,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:35:51,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 711 [2019-01-12 04:35:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:51,369 INFO L225 Difference]: With dead ends: 21095 [2019-01-12 04:35:51,370 INFO L226 Difference]: Without dead ends: 12048 [2019-01-12 04:35:51,380 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 04:35:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12048 states. [2019-01-12 04:35:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12048 to 9645. [2019-01-12 04:35:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9645 states. [2019-01-12 04:35:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9645 states to 9645 states and 10139 transitions. [2019-01-12 04:35:51,538 INFO L78 Accepts]: Start accepts. Automaton has 9645 states and 10139 transitions. Word has length 711 [2019-01-12 04:35:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:51,539 INFO L480 AbstractCegarLoop]: Abstraction has 9645 states and 10139 transitions. [2019-01-12 04:35:51,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:35:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 9645 states and 10139 transitions. [2019-01-12 04:35:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-01-12 04:35:51,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:51,557 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:51,558 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:51,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash -137040025, now seen corresponding path program 1 times [2019-01-12 04:35:51,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:51,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:51,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:51,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:51,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-01-12 04:35:52,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:52,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:35:52,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:35:52,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:35:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:52,521 INFO L87 Difference]: Start difference. First operand 9645 states and 10139 transitions. Second operand 5 states. [2019-01-12 04:35:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:56,398 INFO L93 Difference]: Finished difference Result 22584 states and 23736 transitions. [2019-01-12 04:35:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:35:56,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 722 [2019-01-12 04:35:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:56,414 INFO L225 Difference]: With dead ends: 22584 [2019-01-12 04:35:56,414 INFO L226 Difference]: Without dead ends: 12941 [2019-01-12 04:35:56,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12941 states. [2019-01-12 04:35:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12941 to 8748. [2019-01-12 04:35:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8748 states. [2019-01-12 04:35:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8748 states to 8748 states and 9158 transitions. [2019-01-12 04:35:56,595 INFO L78 Accepts]: Start accepts. Automaton has 8748 states and 9158 transitions. Word has length 722 [2019-01-12 04:35:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:56,597 INFO L480 AbstractCegarLoop]: Abstraction has 8748 states and 9158 transitions. [2019-01-12 04:35:56,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:35:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 8748 states and 9158 transitions. [2019-01-12 04:35:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2019-01-12 04:35:56,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:56,621 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, 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, 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, 3, 3, 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] [2019-01-12 04:35:56,622 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:56,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:56,622 INFO L82 PathProgramCache]: Analyzing trace with hash 285225601, now seen corresponding path program 1 times [2019-01-12 04:35:56,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:56,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:56,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 51 proven. 582 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-01-12 04:35:58,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:58,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:35:58,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:58,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:58,633 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 17 [2019-01-12 04:35:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-01-12 04:35:59,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:35:59,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 04:35:59,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:35:59,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:35:59,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:35:59,152 INFO L87 Difference]: Start difference. First operand 8748 states and 9158 transitions. Second operand 7 states. [2019-01-12 04:36:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:59,602 INFO L93 Difference]: Finished difference Result 30993 states and 32331 transitions. [2019-01-12 04:36:59,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:36:59,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 775 [2019-01-12 04:36:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:59,629 INFO L225 Difference]: With dead ends: 30993 [2019-01-12 04:36:59,629 INFO L226 Difference]: Without dead ends: 21948 [2019-01-12 04:36:59,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 778 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:36:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21948 states. [2019-01-12 04:36:59,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21948 to 17134. [2019-01-12 04:36:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17134 states. [2019-01-12 04:36:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17134 states to 17134 states and 17857 transitions. [2019-01-12 04:36:59,995 INFO L78 Accepts]: Start accepts. Automaton has 17134 states and 17857 transitions. Word has length 775 [2019-01-12 04:36:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:59,997 INFO L480 AbstractCegarLoop]: Abstraction has 17134 states and 17857 transitions. [2019-01-12 04:36:59,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:36:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 17134 states and 17857 transitions. [2019-01-12 04:37:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2019-01-12 04:37:00,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:00,039 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:00,040 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:00,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1707673115, now seen corresponding path program 1 times [2019-01-12 04:37:00,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:00,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:00,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:00,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:00,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 828 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2019-01-12 04:37:01,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:01,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:37:01,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:37:01,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:37:01,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:37:01,113 INFO L87 Difference]: Start difference. First operand 17134 states and 17857 transitions. Second operand 3 states. [2019-01-12 04:37:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:02,592 INFO L93 Difference]: Finished difference Result 29441 states and 30657 transitions. [2019-01-12 04:37:02,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:37:02,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 877 [2019-01-12 04:37:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:02,608 INFO L225 Difference]: With dead ends: 29441 [2019-01-12 04:37:02,609 INFO L226 Difference]: Without dead ends: 14405 [2019-01-12 04:37:02,619 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 04:37:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14405 states. [2019-01-12 04:37:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14405 to 11412. [2019-01-12 04:37:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11412 states. [2019-01-12 04:37:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11412 states to 11412 states and 11788 transitions. [2019-01-12 04:37:02,797 INFO L78 Accepts]: Start accepts. Automaton has 11412 states and 11788 transitions. Word has length 877 [2019-01-12 04:37:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:02,797 INFO L480 AbstractCegarLoop]: Abstraction has 11412 states and 11788 transitions. [2019-01-12 04:37:02,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:37:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 11412 states and 11788 transitions. [2019-01-12 04:37:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2019-01-12 04:37:02,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:02,820 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, 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, 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, 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, 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, 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] [2019-01-12 04:37:02,821 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash -293567428, now seen corresponding path program 1 times [2019-01-12 04:37:02,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:02,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:02,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:02,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:02,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2019-01-12 04:37:03,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:03,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:37:03,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:37:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:37:03,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:03,516 INFO L87 Difference]: Start difference. First operand 11412 states and 11788 transitions. Second operand 4 states. [2019-01-12 04:37:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:05,642 INFO L93 Difference]: Finished difference Result 29719 states and 30697 transitions. [2019-01-12 04:37:05,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:37:05,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 887 [2019-01-12 04:37:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:05,658 INFO L225 Difference]: With dead ends: 29719 [2019-01-12 04:37:05,658 INFO L226 Difference]: Without dead ends: 18010 [2019-01-12 04:37:05,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:37:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18010 states. [2019-01-12 04:37:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18010 to 7816. [2019-01-12 04:37:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7816 states. [2019-01-12 04:37:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7816 states to 7816 states and 8069 transitions. [2019-01-12 04:37:05,794 INFO L78 Accepts]: Start accepts. Automaton has 7816 states and 8069 transitions. Word has length 887 [2019-01-12 04:37:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:05,795 INFO L480 AbstractCegarLoop]: Abstraction has 7816 states and 8069 transitions. [2019-01-12 04:37:05,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:37:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 7816 states and 8069 transitions. [2019-01-12 04:37:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2019-01-12 04:37:05,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:05,815 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, 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, 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, 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, 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 04:37:05,816 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:05,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:05,818 INFO L82 PathProgramCache]: Analyzing trace with hash -196750209, now seen corresponding path program 1 times [2019-01-12 04:37:05,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:05,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:05,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:05,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:05,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-01-12 04:37:06,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:06,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:37:06,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:37:06,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:37:06,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:37:06,387 INFO L87 Difference]: Start difference. First operand 7816 states and 8069 transitions. Second operand 3 states. [2019-01-12 04:37:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:07,667 INFO L93 Difference]: Finished difference Result 14726 states and 15201 transitions. [2019-01-12 04:37:07,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:37:07,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 925 [2019-01-12 04:37:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:07,669 INFO L225 Difference]: With dead ends: 14726 [2019-01-12 04:37:07,669 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:37:07,676 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 04:37:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:37:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:37:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:37:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:37:07,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 925 [2019-01-12 04:37:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:07,677 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:37:07,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:37:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:37:07,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:37:07,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:37:07,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:07,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:07,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:07,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:07,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:08,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:08,363 WARN L181 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 329 [2019-01-12 04:37:08,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:08,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:08,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:08,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:08,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:08,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:08,917 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 329 [2019-01-12 04:37:09,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:09,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:09,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:09,357 WARN L181 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 299 [2019-01-12 04:37:14,085 WARN L181 SmtUtils]: Spent 4.72 s on a formula simplification. DAG size of input: 313 DAG size of output: 101 [2019-01-12 04:37:16,184 WARN L181 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 313 DAG size of output: 101 [2019-01-12 04:37:18,670 WARN L181 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 286 DAG size of output: 100 [2019-01-12 04:37:18,673 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,674 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,674 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,674 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,674 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:37:18,674 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,674 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,674 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,674 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,674 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,675 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,676 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:37:18,677 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:37:18,678 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:37:18,678 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,679 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,679 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,679 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,679 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,679 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,679 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,679 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:37:18,680 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,681 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:37:18,682 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,683 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,684 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:37:18,685 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,686 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,687 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:37:18,688 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,689 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:37:18,690 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,691 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,692 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,692 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,692 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,692 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,692 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,692 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,692 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:37:18,692 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:37:18,692 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:37:18,692 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:37:18,692 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,693 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,693 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,693 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,693 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse11 (not (= 2 ~a2~0))) (.cse15 (+ ~a0~0 98)) (.cse6 (+ ~a4~0 86))) (let ((.cse0 (<= (+ ~a4~0 42) 0)) (.cse7 (let ((.cse16 (<= .cse6 0))) (or (<= 0 (+ ~a0~0 44)) (and .cse16 .cse11) (and .cse16 (< 0 .cse15))))) (.cse14 (+ ~a0~0 147))) (let ((.cse3 (= ~a2~0 2)) (.cse2 (<= 0 (+ ~a0~0 599999))) (.cse4 (<= .cse14 0)) (.cse13 (<= (+ ~a4~0 89) 0)) (.cse12 (not (= 4 ~a2~0))) (.cse5 (<= .cse15 0)) (.cse1 (<= ~a29~0 43)) (.cse8 (and (not (= 5 ~a2~0)) .cse0 .cse7))) (or (and .cse0 (and (= ~a2~0 1) .cse1 (< 0 (+ ~a29~0 144))) .cse2) (and .cse3 (<= (+ ~a0~0 386992) 0)) (and .cse0 .cse4 (= ~a2~0 3)) (and .cse5 (and .cse0 (< 0 .cse6) .cse3)) (and .cse7 (<= (+ ~a0~0 61) 0)) (and .cse8 (exists ((v_prenex_3 Int)) (let ((.cse9 (* 9 v_prenex_3))) (let ((.cse10 (div .cse9 10))) (and (= 0 (mod .cse9 10)) (<= ~a29~0 (+ (mod .cse10 29) 14)) (<= 0 .cse10)))))) (and (and .cse0 .cse11 .cse4) .cse2) (and .cse0 .cse7 .cse12) (and .cse13 .cse4) (and .cse5 (and .cse0 .cse11 (< 0 .cse14) .cse12)) (and (and .cse13 .cse12) .cse1) (and .cse5 (<= ~a29~0 31) (<= 0 (+ ~a0~0 140)) (and .cse0 .cse11)) (and .cse1 .cse8 (<= 94 ~a0~0)))))) [2019-01-12 04:37:18,693 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:37:18,693 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:37:18,694 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,694 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,694 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,694 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,694 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,694 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,694 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,694 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:37:18,694 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,694 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:37:18,694 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:37:18,694 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,695 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:37:18,695 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:37:18,695 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:37:18,695 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:37:18,695 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,695 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,695 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,695 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,695 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,695 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:37:18,696 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:37:18,696 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,696 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:37:18,696 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:37:18,696 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,696 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,696 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,696 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,696 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,696 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,697 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse2 (not (= 2 ~a2~0))) (.cse15 (+ ~a0~0 98)) (.cse10 (+ ~a4~0 86))) (let ((.cse1 (<= (+ ~a4~0 42) 0)) (.cse5 (let ((.cse16 (<= .cse10 0))) (or (<= 0 (+ ~a0~0 44)) (and .cse16 .cse2) (and .cse16 (< 0 .cse15))))) (.cse14 (+ ~a0~0 147))) (let ((.cse7 (<= (+ ~a4~0 89) 0)) (.cse0 (= ~a2~0 2)) (.cse3 (<= .cse14 0)) (.cse11 (and .cse1 (and (not (= 5 ~a2~0)) .cse5))) (.cse9 (<= .cse15 0)) (.cse6 (not (= 4 ~a2~0))) (.cse8 (<= ~a29~0 43)) (.cse4 (<= 0 (+ ~a0~0 599999)))) (or (and .cse0 (<= (+ ~a0~0 386992) 0)) (and (and .cse1 .cse2 .cse3) .cse4) (and .cse1 .cse5 .cse6) (and .cse7 .cse3) (and (and .cse7 .cse6) .cse8) (and .cse5 (<= (+ ~a0~0 61) 0)) (and .cse9 (and .cse1 (< 0 .cse10) .cse0)) (and .cse9 (<= ~a29~0 31) (<= 0 (+ ~a0~0 140)) (and .cse1 .cse2)) (and .cse1 (= ~a2~0 3) .cse3) (and .cse8 .cse11 (<= 94 ~a0~0)) (and .cse11 (exists ((v_prenex_3 Int)) (let ((.cse12 (* 9 v_prenex_3))) (let ((.cse13 (div .cse12 10))) (and (= 0 (mod .cse12 10)) (<= ~a29~0 (+ (mod .cse13 29) 14)) (<= 0 .cse13)))))) (and .cse9 (and .cse1 .cse2 (< 0 .cse14) .cse6)) (and (and (= ~a2~0 1) .cse8 (< 0 (+ ~a29~0 144))) .cse1 .cse4))))) [2019-01-12 04:37:18,697 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,697 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:37:18,697 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:37:18,697 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,697 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,697 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2019-01-12 04:37:18,697 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,698 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:37:18,699 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:37:18,700 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,701 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,702 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,703 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,703 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse2 (not (= 2 ~a2~0))) (.cse15 (+ ~a0~0 98)) (.cse10 (+ ~a4~0 86))) (let ((.cse1 (<= (+ ~a4~0 42) 0)) (.cse5 (let ((.cse16 (<= .cse10 0))) (or (<= 0 (+ ~a0~0 44)) (and .cse16 .cse2) (and .cse16 (< 0 .cse15))))) (.cse14 (+ ~a0~0 147))) (let ((.cse7 (<= (+ ~a4~0 89) 0)) (.cse0 (= ~a2~0 2)) (.cse3 (<= .cse14 0)) (.cse11 (and .cse1 (and (not (= 5 ~a2~0)) .cse5))) (.cse9 (<= .cse15 0)) (.cse6 (not (= 4 ~a2~0))) (.cse8 (<= ~a29~0 43)) (.cse4 (<= 0 (+ ~a0~0 599999)))) (or (and .cse0 (<= (+ ~a0~0 386992) 0)) (and (and .cse1 .cse2 .cse3) .cse4) (and .cse1 .cse5 .cse6) (and .cse7 .cse3) (and (and .cse7 .cse6) .cse8) (and .cse5 (<= (+ ~a0~0 61) 0)) (and .cse9 (and .cse1 (< 0 .cse10) .cse0)) (and .cse9 (<= ~a29~0 31) (<= 0 (+ ~a0~0 140)) (and .cse1 .cse2)) (and .cse1 (= ~a2~0 3) .cse3) (and .cse8 .cse11 (<= 94 ~a0~0)) (and .cse11 (exists ((v_prenex_3 Int)) (let ((.cse12 (* 9 v_prenex_3))) (let ((.cse13 (div .cse12 10))) (and (= 0 (mod .cse12 10)) (<= ~a29~0 (+ (mod .cse13 29) 14)) (<= 0 .cse13)))))) (and .cse9 (and .cse1 .cse2 (< 0 .cse14) .cse6)) (and (and (= ~a2~0 1) .cse8 (< 0 (+ ~a29~0 144))) .cse1 .cse4))))) [2019-01-12 04:37:18,703 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:37:18,703 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:37:18,703 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,703 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,703 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,703 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,704 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:37:18,705 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,706 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,707 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,708 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,709 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,709 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,709 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,709 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,709 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,709 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:37:18,709 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:37:18,709 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,709 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,709 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,709 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:37:18,710 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,710 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,710 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,710 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,710 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,710 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:37:18,710 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,710 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,710 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:37:18,710 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:37:18,710 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,711 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:18,711 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:37:18,711 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,711 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:37:18,711 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,711 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:37:18,711 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:37:18,711 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,711 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,711 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:37:18,711 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:37:18,712 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:37:18,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:18,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:37:18 BoogieIcfgContainer [2019-01-12 04:37:18,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:37:18,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:37:18,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:37:18,783 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:37:18,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:46" (3/4) ... [2019-01-12 04:37:18,789 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:37:18,838 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:37:18,841 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:37:18,878 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(4 == a2))) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((a4 + 89 <= 0 && !(4 == a2)) && a29 <= 43)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (((a0 + 98 <= 0 && a29 <= 31) && 0 <= a0 + 140) && a4 + 42 <= 0 && !(2 == a2))) || ((a4 + 42 <= 0 && a2 == 3) && a0 + 147 <= 0)) || ((a29 <= 43 && a4 + 42 <= 0 && !(5 == a2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 94 <= a0)) || ((a4 + 42 <= 0 && !(5 == a2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (a0 + 98 <= 0 && ((a4 + 42 <= 0 && !(2 == a2)) && 0 < a0 + 147) && !(4 == a2))) || ((((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999) [2019-01-12 04:37:18,883 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(4 == a2))) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((a4 + 89 <= 0 && !(4 == a2)) && a29 <= 43)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (((a0 + 98 <= 0 && a29 <= 31) && 0 <= a0 + 140) && a4 + 42 <= 0 && !(2 == a2))) || ((a4 + 42 <= 0 && a2 == 3) && a0 + 147 <= 0)) || ((a29 <= 43 && a4 + 42 <= 0 && !(5 == a2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 94 <= a0)) || ((a4 + 42 <= 0 && !(5 == a2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (a0 + 98 <= 0 && ((a4 + 42 <= 0 && !(2 == a2)) && 0 < a0 + 147) && !(4 == a2))) || ((((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999) [2019-01-12 04:37:18,905 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((a4 + 42 <= 0 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 599999) || (a2 == 2 && a0 + 386992 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && a2 == 3)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(4 == a2))) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || (a0 + 98 <= 0 && ((a4 + 42 <= 0 && !(2 == a2)) && 0 < a0 + 147) && !(4 == a2))) || ((a4 + 89 <= 0 && !(4 == a2)) && a29 <= 43)) || (((a0 + 98 <= 0 && a29 <= 31) && 0 <= a0 + 140) && a4 + 42 <= 0 && !(2 == a2))) || ((a29 <= 43 && (!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 94 <= a0) [2019-01-12 04:37:19,168 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:37:19,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:37:19,170 INFO L168 Benchmark]: Toolchain (without parser) took 162735.58 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 941.8 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 984.9 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:19,170 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:37:19,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1394.77 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 849.2 MB in the end (delta: 92.6 MB). Peak memory consumption was 92.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:19,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 351.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 849.2 MB in the beginning and 1.1 GB in the end (delta: -274.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:19,171 INFO L168 Benchmark]: Boogie Preprocessor took 233.07 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: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:19,171 INFO L168 Benchmark]: RCFGBuilder took 8349.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.1 MB). Peak memory consumption was 297.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:19,172 INFO L168 Benchmark]: TraceAbstraction took 152013.56 ms. Allocated memory was 1.3 GB in the beginning and 3.2 GB in the end (delta: 1.9 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -973.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-01-12 04:37:19,172 INFO L168 Benchmark]: Witness Printer took 385.76 ms. Allocated memory is still 3.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:19,175 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1394.77 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 849.2 MB in the end (delta: 92.6 MB). Peak memory consumption was 92.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 351.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 849.2 MB in the beginning and 1.1 GB in the end (delta: -274.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 233.07 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: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 8349.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.1 MB). Peak memory consumption was 297.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 152013.56 ms. Allocated memory was 1.3 GB in the beginning and 3.2 GB in the end (delta: 1.9 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -973.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 385.76 ms. Allocated memory is still 3.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 166]: 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: 1766]: Loop Invariant [2019-01-12 04:37:19,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(4 == a2))) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((a4 + 89 <= 0 && !(4 == a2)) && a29 <= 43)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (((a0 + 98 <= 0 && a29 <= 31) && 0 <= a0 + 140) && a4 + 42 <= 0 && !(2 == a2))) || ((a4 + 42 <= 0 && a2 == 3) && a0 + 147 <= 0)) || ((a29 <= 43 && a4 + 42 <= 0 && !(5 == a2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 94 <= a0)) || ((a4 + 42 <= 0 && !(5 == a2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (a0 + 98 <= 0 && ((a4 + 42 <= 0 && !(2 == a2)) && 0 < a0 + 147) && !(4 == a2))) || ((((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999) - InvariantResult [Line: 23]: Loop Invariant [2019-01-12 04:37:19,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(4 == a2))) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((a4 + 89 <= 0 && !(4 == a2)) && a29 <= 43)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (((a0 + 98 <= 0 && a29 <= 31) && 0 <= a0 + 140) && a4 + 42 <= 0 && !(2 == a2))) || ((a4 + 42 <= 0 && a2 == 3) && a0 + 147 <= 0)) || ((a29 <= 43 && a4 + 42 <= 0 && !(5 == a2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 94 <= a0)) || ((a4 + 42 <= 0 && !(5 == a2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (a0 + 98 <= 0 && ((a4 + 42 <= 0 && !(2 == a2)) && 0 < a0 + 147) && !(4 == a2))) || ((((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999) - InvariantResult [Line: 1658]: Loop Invariant [2019-01-12 04:37:19,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:37:19,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: (((((((((((((a4 + 42 <= 0 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 599999) || (a2 == 2 && a0 + 386992 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && a2 == 3)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(4 == a2))) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || (a0 + 98 <= 0 && ((a4 + 42 <= 0 && !(2 == a2)) && 0 < a0 + 147) && !(4 == a2))) || ((a4 + 89 <= 0 && !(4 == a2)) && a29 <= 43)) || (((a0 + 98 <= 0 && a29 <= 31) && 0 <= a0 + 140) && a4 + 42 <= 0 && !(2 == a2))) || ((a29 <= 43 && (!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 94 <= a0) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 151.8s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 122.8s AutomataDifference, 0.0s DeadEndRemovalTime, 10.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 3314 SDtfs, 14460 SDslu, 1254 SDs, 0 SdLazy, 34480 SolverSat, 5228 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 111.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2144 GetRequests, 2075 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17134occurred in iteration=13, 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: 1.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 35441 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 130 NumberOfFragments, 1028 HoareAnnotationTreeSize, 4 FomulaSimplifications, 121188 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 4 FomulaSimplificationsInter, 80893 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 10997 NumberOfCodeBlocks, 10997 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 10977 ConstructedInterpolants, 51 QuantifiedInterpolants, 20459721 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2465 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 11843/12540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...