./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.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/Problem02_label06_true-unreach-call_false-termination.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 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:54:44,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:54:44,419 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:54:44,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:54:44,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:54:44,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:54:44,433 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:54:44,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:54:44,436 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:54:44,437 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:54:44,438 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:54:44,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:54:44,439 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:54:44,440 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:54:44,441 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:54:44,442 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:54:44,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:54:44,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:54:44,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:54:44,448 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:54:44,449 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:54:44,450 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:54:44,453 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:54:44,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:54:44,453 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:54:44,454 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:54:44,455 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:54:44,456 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:54:44,457 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:54:44,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:54:44,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:54:44,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:54:44,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:54:44,459 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:54:44,460 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:54:44,461 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:54:44,461 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:54:44,484 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:54:44,484 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:54:44,486 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:54:44,486 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:54:44,486 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:54:44,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:54:44,487 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:54:44,487 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:54:44,487 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:54:44,487 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:54:44,487 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:54:44,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:54:44,488 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:54:44,488 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:54:44,488 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:54:44,488 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:54:44,488 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:54:44,488 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:54:44,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:54:44,490 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:54:44,490 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:54:44,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:54:44,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:54:44,491 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:54:44,492 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:54:44,492 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:54:44,492 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:54:44,492 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:54:44,492 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 -> 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 [2019-01-12 00:54:44,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:54:44,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:54:44,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:54:44,555 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:54:44,555 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:54:44,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2019-01-12 00:54:44,614 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1547624/a235e879918644c99659eb0ae4a85ece/FLAG681ff7c07 [2019-01-12 00:54:45,184 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:54:45,186 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2019-01-12 00:54:45,205 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1547624/a235e879918644c99659eb0ae4a85ece/FLAG681ff7c07 [2019-01-12 00:54:45,399 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1547624/a235e879918644c99659eb0ae4a85ece [2019-01-12 00:54:45,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:54:45,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:54:45,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:54:45,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:54:45,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:54:45,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:54:45" (1/1) ... [2019-01-12 00:54:45,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707b848b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:45, skipping insertion in model container [2019-01-12 00:54:45,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:54:45" (1/1) ... [2019-01-12 00:54:45,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:54:45,480 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:54:45,971 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:54:45,979 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:54:46,087 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:54:46,105 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:54:46,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46 WrapperNode [2019-01-12 00:54:46,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:54:46,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:54:46,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:54:46,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:54:46,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46" (1/1) ... [2019-01-12 00:54:46,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46" (1/1) ... [2019-01-12 00:54:46,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:54:46,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:54:46,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:54:46,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:54:46,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46" (1/1) ... [2019-01-12 00:54:46,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46" (1/1) ... [2019-01-12 00:54:46,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46" (1/1) ... [2019-01-12 00:54:46,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46" (1/1) ... [2019-01-12 00:54:46,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46" (1/1) ... [2019-01-12 00:54:46,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46" (1/1) ... [2019-01-12 00:54:46,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46" (1/1) ... [2019-01-12 00:54:46,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:54:46,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:54:46,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:54:46,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:54:46,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46" (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 00:54:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:54:46,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:54:49,634 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:54:49,634 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:54:49,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:49 BoogieIcfgContainer [2019-01-12 00:54:49,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:54:49,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:54:49,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:54:49,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:54:49,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:54:45" (1/3) ... [2019-01-12 00:54:49,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8aefd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:54:49, skipping insertion in model container [2019-01-12 00:54:49,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:46" (2/3) ... [2019-01-12 00:54:49,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8aefd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:54:49, skipping insertion in model container [2019-01-12 00:54:49,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:49" (3/3) ... [2019-01-12 00:54:49,652 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2019-01-12 00:54:49,663 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:54:49,672 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:54:49,691 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:54:49,726 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:54:49,727 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:54:49,727 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:54:49,727 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:54:49,728 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:54:49,728 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:54:49,728 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:54:49,728 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:54:49,728 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:54:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:54:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-12 00:54:49,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:49,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:54:49,771 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:49,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1439061899, now seen corresponding path program 1 times [2019-01-12 00:54:49,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:49,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:49,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:49,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:49,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:50,484 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 00:54:50,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:50,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:50,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:50,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:50,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:50,517 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-01-12 00:54:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:53,608 INFO L93 Difference]: Finished difference Result 748 states and 1325 transitions. [2019-01-12 00:54:53,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:54:53,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-01-12 00:54:53,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:53,648 INFO L225 Difference]: With dead ends: 748 [2019-01-12 00:54:53,648 INFO L226 Difference]: Without dead ends: 454 [2019-01-12 00:54:53,653 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 00:54:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-01-12 00:54:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 449. [2019-01-12 00:54:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-01-12 00:54:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 613 transitions. [2019-01-12 00:54:53,723 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 613 transitions. Word has length 140 [2019-01-12 00:54:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:53,724 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 613 transitions. [2019-01-12 00:54:53,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 613 transitions. [2019-01-12 00:54:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-12 00:54:53,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:53,730 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 00:54:53,731 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:53,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2046676736, now seen corresponding path program 1 times [2019-01-12 00:54:53,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:53,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:53,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:53,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:53,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:54,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:54,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 00:54:54,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 00:54:54,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 00:54:54,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:54:54,389 INFO L87 Difference]: Start difference. First operand 449 states and 613 transitions. Second operand 10 states. [2019-01-12 00:54:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:56,997 INFO L93 Difference]: Finished difference Result 1672 states and 2295 transitions. [2019-01-12 00:54:56,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 00:54:56,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 145 [2019-01-12 00:54:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:57,006 INFO L225 Difference]: With dead ends: 1672 [2019-01-12 00:54:57,006 INFO L226 Difference]: Without dead ends: 1151 [2019-01-12 00:54:57,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:54:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-01-12 00:54:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1011. [2019-01-12 00:54:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-01-12 00:54:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1227 transitions. [2019-01-12 00:54:57,062 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1227 transitions. Word has length 145 [2019-01-12 00:54:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:57,063 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 1227 transitions. [2019-01-12 00:54:57,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 00:54:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1227 transitions. [2019-01-12 00:54:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-12 00:54:57,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:57,071 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:54:57,072 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:57,072 INFO L82 PathProgramCache]: Analyzing trace with hash 706730423, now seen corresponding path program 1 times [2019-01-12 00:54:57,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:57,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:57,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:57,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:54:57,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:57,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:54:57,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:57,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:57,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:57,447 INFO L87 Difference]: Start difference. First operand 1011 states and 1227 transitions. Second operand 4 states. [2019-01-12 00:54:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:59,881 INFO L93 Difference]: Finished difference Result 2867 states and 3568 transitions. [2019-01-12 00:54:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:54:59,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-01-12 00:54:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:59,892 INFO L225 Difference]: With dead ends: 2867 [2019-01-12 00:54:59,893 INFO L226 Difference]: Without dead ends: 1858 [2019-01-12 00:54:59,895 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 00:54:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2019-01-12 00:54:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1431. [2019-01-12 00:54:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-01-12 00:54:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1691 transitions. [2019-01-12 00:54:59,934 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1691 transitions. Word has length 167 [2019-01-12 00:54:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:59,936 INFO L480 AbstractCegarLoop]: Abstraction has 1431 states and 1691 transitions. [2019-01-12 00:54:59,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1691 transitions. [2019-01-12 00:54:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-12 00:54:59,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:59,944 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-01-12 00:54:59,945 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:59,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash 514204718, now seen corresponding path program 1 times [2019-01-12 00:54:59,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:59,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:59,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:55:00,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:00,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:00,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:00,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:00,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:00,124 INFO L87 Difference]: Start difference. First operand 1431 states and 1691 transitions. Second operand 3 states. [2019-01-12 00:55:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:01,143 INFO L93 Difference]: Finished difference Result 3559 states and 4205 transitions. [2019-01-12 00:55:01,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:01,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-01-12 00:55:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:01,151 INFO L225 Difference]: With dead ends: 3559 [2019-01-12 00:55:01,152 INFO L226 Difference]: Without dead ends: 1566 [2019-01-12 00:55:01,154 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 00:55:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2019-01-12 00:55:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1286. [2019-01-12 00:55:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-01-12 00:55:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1411 transitions. [2019-01-12 00:55:01,179 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1411 transitions. Word has length 233 [2019-01-12 00:55:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:01,180 INFO L480 AbstractCegarLoop]: Abstraction has 1286 states and 1411 transitions. [2019-01-12 00:55:01,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1411 transitions. [2019-01-12 00:55:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-12 00:55:01,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:01,186 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:55:01,186 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:01,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash 209319723, now seen corresponding path program 1 times [2019-01-12 00:55:01,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:01,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:01,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:01,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:01,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 00:55:01,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:55:01,446 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 00:55:01,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:01,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:55:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 00:55:01,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:55:01,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2019-01-12 00:55:01,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 00:55:01,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 00:55:01,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 00:55:01,770 INFO L87 Difference]: Start difference. First operand 1286 states and 1411 transitions. Second operand 7 states. [2019-01-12 00:55:02,720 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 00:55:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:04,306 INFO L93 Difference]: Finished difference Result 3160 states and 3462 transitions. [2019-01-12 00:55:04,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 00:55:04,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 247 [2019-01-12 00:55:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:04,313 INFO L225 Difference]: With dead ends: 3160 [2019-01-12 00:55:04,313 INFO L226 Difference]: Without dead ends: 1736 [2019-01-12 00:55:04,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:55:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2019-01-12 00:55:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1286. [2019-01-12 00:55:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-01-12 00:55:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1400 transitions. [2019-01-12 00:55:04,343 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1400 transitions. Word has length 247 [2019-01-12 00:55:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:04,343 INFO L480 AbstractCegarLoop]: Abstraction has 1286 states and 1400 transitions. [2019-01-12 00:55:04,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 00:55:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1400 transitions. [2019-01-12 00:55:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-12 00:55:04,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:04,350 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:55:04,350 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash 287206733, now seen corresponding path program 1 times [2019-01-12 00:55:04,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:04,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:04,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 00:55:04,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:04,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:55:04,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:04,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:04,743 INFO L87 Difference]: Start difference. First operand 1286 states and 1400 transitions. Second operand 4 states. [2019-01-12 00:55:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:07,756 INFO L93 Difference]: Finished difference Result 3414 states and 3743 transitions. [2019-01-12 00:55:07,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:07,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-01-12 00:55:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:07,765 INFO L225 Difference]: With dead ends: 3414 [2019-01-12 00:55:07,765 INFO L226 Difference]: Without dead ends: 2130 [2019-01-12 00:55:07,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-01-12 00:55:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1986. [2019-01-12 00:55:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1986 states. [2019-01-12 00:55:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2155 transitions. [2019-01-12 00:55:07,805 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2155 transitions. Word has length 268 [2019-01-12 00:55:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:07,806 INFO L480 AbstractCegarLoop]: Abstraction has 1986 states and 2155 transitions. [2019-01-12 00:55:07,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2155 transitions. [2019-01-12 00:55:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-01-12 00:55:07,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:07,815 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, 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] [2019-01-12 00:55:07,815 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:07,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1285312662, now seen corresponding path program 1 times [2019-01-12 00:55:07,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:07,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:07,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:07,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:07,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:08,322 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 00:55:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:08,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:08,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 00:55:08,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:55:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:55:08,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:55:08,380 INFO L87 Difference]: Start difference. First operand 1986 states and 2155 transitions. Second operand 5 states. [2019-01-12 00:55:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:09,300 INFO L93 Difference]: Finished difference Result 3971 states and 4293 transitions. [2019-01-12 00:55:09,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:55:09,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 291 [2019-01-12 00:55:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:09,308 INFO L225 Difference]: With dead ends: 3971 [2019-01-12 00:55:09,308 INFO L226 Difference]: Without dead ends: 1704 [2019-01-12 00:55:09,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:55:09,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-01-12 00:55:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1561. [2019-01-12 00:55:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2019-01-12 00:55:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1632 transitions. [2019-01-12 00:55:09,339 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1632 transitions. Word has length 291 [2019-01-12 00:55:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:09,339 INFO L480 AbstractCegarLoop]: Abstraction has 1561 states and 1632 transitions. [2019-01-12 00:55:09,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:55:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1632 transitions. [2019-01-12 00:55:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-01-12 00:55:09,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:09,348 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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] [2019-01-12 00:55:09,348 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:09,349 INFO L82 PathProgramCache]: Analyzing trace with hash 733079694, now seen corresponding path program 1 times [2019-01-12 00:55:09,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:09,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:09,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:09,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:09,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 00:55:09,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:09,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:09,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:09,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:09,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:09,522 INFO L87 Difference]: Start difference. First operand 1561 states and 1632 transitions. Second operand 3 states. [2019-01-12 00:55:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:10,078 INFO L93 Difference]: Finished difference Result 3120 states and 3262 transitions. [2019-01-12 00:55:10,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:10,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-01-12 00:55:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:10,085 INFO L225 Difference]: With dead ends: 3120 [2019-01-12 00:55:10,085 INFO L226 Difference]: Without dead ends: 1561 [2019-01-12 00:55:10,107 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 00:55:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2019-01-12 00:55:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2019-01-12 00:55:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2019-01-12 00:55:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1618 transitions. [2019-01-12 00:55:10,134 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1618 transitions. Word has length 318 [2019-01-12 00:55:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:10,134 INFO L480 AbstractCegarLoop]: Abstraction has 1561 states and 1618 transitions. [2019-01-12 00:55:10,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1618 transitions. [2019-01-12 00:55:10,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-01-12 00:55:10,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:10,143 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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 00:55:10,143 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:10,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1479463842, now seen corresponding path program 1 times [2019-01-12 00:55:10,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:10,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:10,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:10,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:10,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-01-12 00:55:10,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:10,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:10,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:10,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:10,298 INFO L87 Difference]: Start difference. First operand 1561 states and 1618 transitions. Second operand 3 states. [2019-01-12 00:55:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:10,871 INFO L93 Difference]: Finished difference Result 3119 states and 3233 transitions. [2019-01-12 00:55:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:10,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-01-12 00:55:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:10,876 INFO L225 Difference]: With dead ends: 3119 [2019-01-12 00:55:10,876 INFO L226 Difference]: Without dead ends: 994 [2019-01-12 00:55:10,877 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 00:55:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-01-12 00:55:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2019-01-12 00:55:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-01-12 00:55:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1022 transitions. [2019-01-12 00:55:10,894 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1022 transitions. Word has length 324 [2019-01-12 00:55:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:10,894 INFO L480 AbstractCegarLoop]: Abstraction has 994 states and 1022 transitions. [2019-01-12 00:55:10,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1022 transitions. [2019-01-12 00:55:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-01-12 00:55:10,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:10,899 INFO L402 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:55:10,899 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:10,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash 495955641, now seen corresponding path program 1 times [2019-01-12 00:55:10,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:10,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:10,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:10,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:10,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-12 00:55:11,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:11,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 00:55:11,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:55:11,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:55:11,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:55:11,201 INFO L87 Difference]: Start difference. First operand 994 states and 1022 transitions. Second operand 5 states. [2019-01-12 00:55:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:11,983 INFO L93 Difference]: Finished difference Result 2267 states and 2334 transitions. [2019-01-12 00:55:11,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:11,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 343 [2019-01-12 00:55:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:11,989 INFO L225 Difference]: With dead ends: 2267 [2019-01-12 00:55:11,990 INFO L226 Difference]: Without dead ends: 1275 [2019-01-12 00:55:11,991 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 00:55:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-01-12 00:55:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1134. [2019-01-12 00:55:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-01-12 00:55:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1164 transitions. [2019-01-12 00:55:12,012 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1164 transitions. Word has length 343 [2019-01-12 00:55:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:12,013 INFO L480 AbstractCegarLoop]: Abstraction has 1134 states and 1164 transitions. [2019-01-12 00:55:12,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:55:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1164 transitions. [2019-01-12 00:55:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-01-12 00:55:12,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:12,018 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:55:12,018 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:12,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1889946957, now seen corresponding path program 1 times [2019-01-12 00:55:12,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:12,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:12,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:12,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:12,334 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 00:55:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-12 00:55:12,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:12,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:55:12,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:12,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:12,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:12,445 INFO L87 Difference]: Start difference. First operand 1134 states and 1164 transitions. Second operand 4 states. [2019-01-12 00:55:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:13,549 INFO L93 Difference]: Finished difference Result 1836 states and 1878 transitions. [2019-01-12 00:55:13,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:13,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 367 [2019-01-12 00:55:13,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:13,555 INFO L225 Difference]: With dead ends: 1836 [2019-01-12 00:55:13,555 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:55:13,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:55:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:55:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:55:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:55:13,558 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 367 [2019-01-12 00:55:13,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:13,558 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:55:13,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:13,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:55:13,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:55:13,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:55:13,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:13,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:14,407 WARN L181 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-01-12 00:55:14,837 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-01-12 00:55:14,841 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,842 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,842 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,842 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:55:14,842 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:55:14,842 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:55:14,842 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:55:14,842 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:55:14,842 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:55:14,842 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:55:14,842 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,842 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,843 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,843 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:55:14,843 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:55:14,843 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:55:14,843 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:55:14,843 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:14,843 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:14,843 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:55:14,843 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,843 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,843 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,844 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:55:14,844 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:55:14,844 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:55:14,844 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:55:14,844 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:55:14,844 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,844 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,844 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,844 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:55:14,844 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:55:14,845 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:55:14,845 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:55:14,845 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:55:14,845 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:55:14,845 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:55:14,845 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:55:14,845 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,845 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,845 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,845 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:55:14,845 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:55:14,846 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:55:14,846 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:55:14,846 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:55:14,846 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:55:14,846 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:55:14,846 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:55:14,846 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,846 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,846 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,846 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:14,846 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:55:14,847 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:55:14,848 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:55:14,848 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:55:14,848 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:55:14,848 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:55:14,848 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,848 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,848 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,848 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:55:14,848 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:55:14,848 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:55:14,848 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:55:14,849 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:55:14,849 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:55:14,849 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:55:14,849 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:55:14,849 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:55:14,849 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,849 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,849 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,849 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:55:14,849 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:55:14,849 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:55:14,850 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:55:14,850 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:55:14,850 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,850 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,850 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,850 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:55:14,850 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:55:14,850 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:55:14,850 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:55:14,850 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:55:14,851 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:55:14,852 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:55:14,852 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:55:14,852 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:55:14,852 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:14,852 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:14,852 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:55:14,853 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1))) (let ((.cse8 (not (= ~a17~0 9))) (.cse7 (= ~a28~0 7)) (.cse5 (= ~a28~0 10)) (.cse3 (= ~a25~0 1)) (.cse6 (not .cse1)) (.cse0 (= ~a17~0 8)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a11~0 1))) (or (and (= ~a28~0 9) (and .cse0 .cse1 .cse2)) (and .cse1 .cse3 (not .cse4) (not .cse5)) (and (and .cse6 .cse7) .cse8) (and .cse0 .cse7 .cse2) (and .cse5 .cse0 .cse1 (= ULTIMATE.start_calculate_output_~input 5) .cse2) (and .cse0 .cse1 .cse2 .cse3) (and (= ~a28~0 8) (<= ~a25~0 0) .cse6 .cse8) (and (<= ~a17~0 7) .cse3 .cse7) (and .cse4 .cse6) (and .cse5 (or (= ULTIMATE.start_calculate_output_~input 1) (= 4 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2) (and .cse5 .cse0 .cse1 .cse2 (or (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input))) (and .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse4)))) [2019-01-12 00:55:14,853 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,853 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,853 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:55:14,853 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:55:14,853 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:55:14,853 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:55:14,853 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:14,853 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:14,853 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,854 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,855 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:14,855 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:14,855 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:55:14,855 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:55:14,855 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:55:14,855 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:55:14,855 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1))) (let ((.cse8 (not (= ~a17~0 9))) (.cse7 (= ~a28~0 7)) (.cse5 (= ~a28~0 10)) (.cse3 (= ~a25~0 1)) (.cse6 (not .cse1)) (.cse0 (= ~a17~0 8)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a11~0 1))) (or (and (= ~a28~0 9) (and .cse0 .cse1 .cse2)) (and .cse1 .cse3 (not .cse4) (not .cse5)) (and (and .cse6 .cse7) .cse8) (and .cse0 .cse7 .cse2) (and .cse5 .cse0 .cse1 (= ULTIMATE.start_calculate_output_~input 5) .cse2) (and .cse0 .cse1 .cse2 .cse3) (and (= ~a28~0 8) (<= ~a25~0 0) .cse6 .cse8) (and (<= ~a17~0 7) .cse3 .cse7) (and .cse4 .cse6) (and .cse5 (or (= ULTIMATE.start_calculate_output_~input 1) (= 4 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2) (and .cse5 .cse0 .cse1 .cse2 (or (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input))) (and .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse4)))) [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:55:14,856 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:55:14,857 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:55:14,858 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:55:14,858 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:55:14,858 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:55:14,858 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:55:14,858 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:55:14,858 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,858 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,858 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,858 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:55:14,858 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:55:14,858 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:55:14,859 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:55:14,860 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,861 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,861 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,861 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:55:14,861 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:55:14,861 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:55:14,861 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:55:14,861 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:55:14,861 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,861 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,861 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:14,861 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:55:14,862 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:55:14,862 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:55:14,862 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:55:14,862 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:55:14,862 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:55:14,862 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:14,862 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:55:14,862 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:14,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2019-01-12 00:55:14,862 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:55:14,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:55:14 BoogieIcfgContainer [2019-01-12 00:55:14,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:55:14,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:55:14,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:55:14,886 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:55:14,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:49" (3/4) ... [2019-01-12 00:55:14,890 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:55:14,913 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:55:14,915 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:55:15,111 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:55:15,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:55:15,112 INFO L168 Benchmark]: Toolchain (without parser) took 29707.87 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 475.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -102.2 MB). Peak memory consumption was 373.3 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:15,112 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:55:15,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.39 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.4 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:15,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 183.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 916.4 MB in the beginning and 1.1 GB in the end (delta: -197.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:15,115 INFO L168 Benchmark]: Boogie Preprocessor took 110.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:15,115 INFO L168 Benchmark]: RCFGBuilder took 3236.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.6 MB). Peak memory consumption was 99.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:15,115 INFO L168 Benchmark]: TraceAbstraction took 25246.35 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 348.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -63.8 MB). Peak memory consumption was 284.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:15,117 INFO L168 Benchmark]: Witness Printer took 224.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:15,120 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 698.39 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.4 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 183.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 916.4 MB in the beginning and 1.1 GB in the end (delta: -197.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3236.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.6 MB). Peak memory consumption was 99.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25246.35 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 348.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -63.8 MB). Peak memory consumption was 284.9 MB. Max. memory is 11.5 GB. * Witness Printer took 224.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((a28 == 9 && (a17 == 8 && a19 == 1) && a21 == 1) || (((a19 == 1 && a25 == 1) && !(a11 == 1)) && !(a28 == 10))) || ((!(a19 == 1) && a28 == 7) && !(a17 == 9))) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && input == 5) && a21 == 1)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || (((a28 == 8 && a25 <= 0) && !(a19 == 1)) && !(a17 == 9))) || ((a17 <= 7 && a25 == 1) && a28 == 7)) || (a11 == 1 && !(a19 == 1))) || ((((a28 == 10 && (input == 1 || 4 == input)) && a17 == 8) && a19 == 1) && a21 == 1)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a21 == 1) && (3 == input || 6 == input))) || ((a28 == 10 && a25 == 1) && !(a19 == 1))) || ((a17 == 8 && a21 == 1) && a11 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((a28 == 9 && (a17 == 8 && a19 == 1) && a21 == 1) || (((a19 == 1 && a25 == 1) && !(a11 == 1)) && !(a28 == 10))) || ((!(a19 == 1) && a28 == 7) && !(a17 == 9))) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && input == 5) && a21 == 1)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || (((a28 == 8 && a25 <= 0) && !(a19 == 1)) && !(a17 == 9))) || ((a17 <= 7 && a25 == 1) && a28 == 7)) || (a11 == 1 && !(a19 == 1))) || ((((a28 == 10 && (input == 1 || 4 == input)) && a17 == 8) && a19 == 1) && a21 == 1)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a21 == 1) && (3 == input || 6 == input))) || ((a28 == 10 && a25 == 1) && !(a19 == 1))) || ((a17 == 8 && a21 == 1) && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 25.1s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 18.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1060 SDtfs, 3168 SDslu, 350 SDs, 0 SdLazy, 7425 SolverSat, 990 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1986occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1730 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 48 NumberOfFragments, 353 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1510 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 662 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3090 NumberOfCodeBlocks, 3090 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3078 ConstructedInterpolants, 0 QuantifiedInterpolants, 1873482 SizeOfPredicates, 6 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2622/2625 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...