./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem10_label18_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem10_label18_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed29b44a6f9564cbed38c70bbb18181a8a1a6c41 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 03:30:16,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:30:16,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:30:16,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:30:16,517 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:30:16,518 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:30:16,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:30:16,522 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:30:16,523 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:30:16,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:30:16,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:30:16,526 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:30:16,527 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:30:16,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:30:16,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:30:16,529 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:30:16,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:30:16,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:30:16,535 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:30:16,537 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:30:16,538 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:30:16,539 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:30:16,541 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:30:16,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:30:16,542 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:30:16,543 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:30:16,544 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:30:16,544 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:30:16,545 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:30:16,546 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:30:16,547 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:30:16,547 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:30:16,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:30:16,548 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:30:16,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:30:16,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:30:16,550 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:30:16,565 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:30:16,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:30:16,566 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:30:16,566 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:30:16,567 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:30:16,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:30:16,568 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:30:16,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:30:16,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:30:16,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:30:16,568 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:30:16,568 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:30:16,569 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:30:16,569 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:30:16,569 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:30:16,569 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:30:16,569 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:30:16,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:30:16,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:30:16,571 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:30:16,571 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:30:16,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:30:16,572 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:30:16,572 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:30:16,572 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:30:16,572 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:30:16,572 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:30:16,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:30:16,574 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 -> ed29b44a6f9564cbed38c70bbb18181a8a1a6c41 [2019-01-12 03:30:16,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:30:16,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:30:16,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:30:16,627 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:30:16,628 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:30:16,629 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem10_label18_true-unreach-call.c [2019-01-12 03:30:16,699 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62cca777/cf56f545e3bf4447847cb3e5cf010301/FLAG85661a34b [2019-01-12 03:30:17,207 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:30:17,208 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem10_label18_true-unreach-call.c [2019-01-12 03:30:17,222 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62cca777/cf56f545e3bf4447847cb3e5cf010301/FLAG85661a34b [2019-01-12 03:30:17,507 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62cca777/cf56f545e3bf4447847cb3e5cf010301 [2019-01-12 03:30:17,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:30:17,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:30:17,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:30:17,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:30:17,518 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:30:17,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:30:17" (1/1) ... [2019-01-12 03:30:17,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e708f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:17, skipping insertion in model container [2019-01-12 03:30:17,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:30:17" (1/1) ... [2019-01-12 03:30:17,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:30:17,590 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:30:18,027 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:30:18,034 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:30:18,177 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:30:18,198 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:30:18,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18 WrapperNode [2019-01-12 03:30:18,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:30:18,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:30:18,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:30:18,200 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:30:18,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18" (1/1) ... [2019-01-12 03:30:18,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18" (1/1) ... [2019-01-12 03:30:18,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:30:18,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:30:18,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:30:18,376 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:30:18,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18" (1/1) ... [2019-01-12 03:30:18,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18" (1/1) ... [2019-01-12 03:30:18,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18" (1/1) ... [2019-01-12 03:30:18,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18" (1/1) ... [2019-01-12 03:30:18,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18" (1/1) ... [2019-01-12 03:30:18,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18" (1/1) ... [2019-01-12 03:30:18,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18" (1/1) ... [2019-01-12 03:30:18,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:30:18,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:30:18,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:30:18,457 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:30:18,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:30:18,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:30:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:30:21,493 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:30:21,493 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:30:21,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:30:21 BoogieIcfgContainer [2019-01-12 03:30:21,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:30:21,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:30:21,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:30:21,499 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:30:21,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:30:17" (1/3) ... [2019-01-12 03:30:21,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d44a36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:30:21, skipping insertion in model container [2019-01-12 03:30:21,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:18" (2/3) ... [2019-01-12 03:30:21,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d44a36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:30:21, skipping insertion in model container [2019-01-12 03:30:21,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:30:21" (3/3) ... [2019-01-12 03:30:21,504 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label18_true-unreach-call.c [2019-01-12 03:30:21,514 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:30:21,522 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:30:21,539 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:30:21,572 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:30:21,573 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:30:21,573 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:30:21,573 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:30:21,573 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:30:21,573 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:30:21,574 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:30:21,574 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:30:21,574 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:30:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-01-12 03:30:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 03:30:21,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:21,607 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] [2019-01-12 03:30:21,610 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:21,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:21,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2019-01-12 03:30:21,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:21,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:21,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:21,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:21,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:30:22,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:22,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:30:22,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:30:22,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:30:22,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:30:22,175 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-01-12 03:30:24,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:24,604 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-01-12 03:30:24,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:30:24,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-12 03:30:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:24,624 INFO L225 Difference]: With dead ends: 694 [2019-01-12 03:30:24,624 INFO L226 Difference]: Without dead ends: 421 [2019-01-12 03:30:24,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:30:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-12 03:30:24,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-01-12 03:30:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-12 03:30:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-01-12 03:30:24,689 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 58 [2019-01-12 03:30:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:24,690 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-01-12 03:30:24,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:30:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-01-12 03:30:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-01-12 03:30:24,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:24,701 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:30:24,701 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:24,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:24,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1489536592, now seen corresponding path program 1 times [2019-01-12 03:30:24,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:24,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:24,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:24,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:24,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:25,347 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-01-12 03:30:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:30:25,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:25,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 03:30:25,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:30:25,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:30:25,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:30:25,519 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 8 states. [2019-01-12 03:30:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:27,515 INFO L93 Difference]: Finished difference Result 715 states and 1090 transitions. [2019-01-12 03:30:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 03:30:27,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2019-01-12 03:30:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:27,526 INFO L225 Difference]: With dead ends: 715 [2019-01-12 03:30:27,527 INFO L226 Difference]: Without dead ends: 435 [2019-01-12 03:30:27,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:30:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-12 03:30:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 421. [2019-01-12 03:30:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-12 03:30:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 576 transitions. [2019-01-12 03:30:27,558 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 576 transitions. Word has length 173 [2019-01-12 03:30:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:27,558 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 576 transitions. [2019-01-12 03:30:27,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:30:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 576 transitions. [2019-01-12 03:30:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-01-12 03:30:27,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:27,565 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 03:30:27,565 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:27,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1006637764, now seen corresponding path program 1 times [2019-01-12 03:30:27,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:27,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:27,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-12 03:30:27,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:27,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:30:27,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:30:27,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:30:27,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:30:27,874 INFO L87 Difference]: Start difference. First operand 421 states and 576 transitions. Second operand 4 states. [2019-01-12 03:30:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:29,422 INFO L93 Difference]: Finished difference Result 1257 states and 1864 transitions. [2019-01-12 03:30:29,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:30:29,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-01-12 03:30:29,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:29,429 INFO L225 Difference]: With dead ends: 1257 [2019-01-12 03:30:29,430 INFO L226 Difference]: Without dead ends: 977 [2019-01-12 03:30:29,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:30:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-01-12 03:30:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2019-01-12 03:30:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-01-12 03:30:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 934 transitions. [2019-01-12 03:30:29,465 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 934 transitions. Word has length 239 [2019-01-12 03:30:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:29,466 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 934 transitions. [2019-01-12 03:30:29,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:30:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 934 transitions. [2019-01-12 03:30:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-12 03:30:29,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:29,473 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 03:30:29,473 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:29,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:29,474 INFO L82 PathProgramCache]: Analyzing trace with hash 6793205, now seen corresponding path program 1 times [2019-01-12 03:30:29,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:29,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:29,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:29,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:29,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-12 03:30:29,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:29,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:30:29,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:30:29,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:30:29,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:30:29,892 INFO L87 Difference]: Start difference. First operand 699 states and 934 transitions. Second operand 4 states. [2019-01-12 03:30:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:32,104 INFO L93 Difference]: Finished difference Result 1813 states and 2498 transitions. [2019-01-12 03:30:32,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:30:32,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-01-12 03:30:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:32,113 INFO L225 Difference]: With dead ends: 1813 [2019-01-12 03:30:32,113 INFO L226 Difference]: Without dead ends: 1255 [2019-01-12 03:30:32,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 03:30:32,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-01-12 03:30:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 838. [2019-01-12 03:30:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-01-12 03:30:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1063 transitions. [2019-01-12 03:30:32,146 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1063 transitions. Word has length 245 [2019-01-12 03:30:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:32,146 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1063 transitions. [2019-01-12 03:30:32,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:30:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1063 transitions. [2019-01-12 03:30:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-01-12 03:30:32,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:32,154 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:30:32,154 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:32,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:32,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1710958450, now seen corresponding path program 1 times [2019-01-12 03:30:32,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:32,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:32,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-12 03:30:32,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:32,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:30:32,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:30:32,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:30:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:30:32,405 INFO L87 Difference]: Start difference. First operand 838 states and 1063 transitions. Second operand 3 states. [2019-01-12 03:30:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:33,256 INFO L93 Difference]: Finished difference Result 1674 states and 2159 transitions. [2019-01-12 03:30:33,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:30:33,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-01-12 03:30:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:33,263 INFO L225 Difference]: With dead ends: 1674 [2019-01-12 03:30:33,263 INFO L226 Difference]: Without dead ends: 977 [2019-01-12 03:30:33,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:30:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-01-12 03:30:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-01-12 03:30:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-12 03:30:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1212 transitions. [2019-01-12 03:30:33,288 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1212 transitions. Word has length 313 [2019-01-12 03:30:33,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:33,289 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1212 transitions. [2019-01-12 03:30:33,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:30:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1212 transitions. [2019-01-12 03:30:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-01-12 03:30:33,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:33,293 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:30:33,293 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:33,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1321369600, now seen corresponding path program 1 times [2019-01-12 03:30:33,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:33,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:33,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:33,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:33,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-12 03:30:33,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:33,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:30:33,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:30:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:30:33,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:30:33,703 INFO L87 Difference]: Start difference. First operand 977 states and 1212 transitions. Second operand 5 states. [2019-01-12 03:30:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:37,553 INFO L93 Difference]: Finished difference Result 2647 states and 3277 transitions. [2019-01-12 03:30:37,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:30:37,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 322 [2019-01-12 03:30:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:37,561 INFO L225 Difference]: With dead ends: 2647 [2019-01-12 03:30:37,561 INFO L226 Difference]: Without dead ends: 977 [2019-01-12 03:30:37,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:30:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-01-12 03:30:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-01-12 03:30:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-12 03:30:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1096 transitions. [2019-01-12 03:30:37,599 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1096 transitions. Word has length 322 [2019-01-12 03:30:37,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:37,600 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1096 transitions. [2019-01-12 03:30:37,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:30:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1096 transitions. [2019-01-12 03:30:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-01-12 03:30:37,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:37,607 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:30:37,607 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:37,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:37,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2054357862, now seen corresponding path program 1 times [2019-01-12 03:30:37,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:37,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:37,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:37,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 367 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:30:38,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:30:38,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:30:38,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:38,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:30:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 03:30:38,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:30:38,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 03:30:38,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:30:38,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:30:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:30:38,493 INFO L87 Difference]: Start difference. First operand 977 states and 1096 transitions. Second operand 7 states. [2019-01-12 03:30:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:41,602 INFO L93 Difference]: Finished difference Result 2961 states and 3396 transitions. [2019-01-12 03:30:41,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 03:30:41,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 358 [2019-01-12 03:30:41,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:41,621 INFO L225 Difference]: With dead ends: 2961 [2019-01-12 03:30:41,621 INFO L226 Difference]: Without dead ends: 2125 [2019-01-12 03:30:41,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-12 03:30:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2019-01-12 03:30:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2089. [2019-01-12 03:30:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2019-01-12 03:30:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2295 transitions. [2019-01-12 03:30:41,677 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2295 transitions. Word has length 358 [2019-01-12 03:30:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:41,677 INFO L480 AbstractCegarLoop]: Abstraction has 2089 states and 2295 transitions. [2019-01-12 03:30:41,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:30:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2295 transitions. [2019-01-12 03:30:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-01-12 03:30:41,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:41,684 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:30:41,685 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:41,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:41,685 INFO L82 PathProgramCache]: Analyzing trace with hash 396556598, now seen corresponding path program 1 times [2019-01-12 03:30:41,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:41,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:41,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:41,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:41,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:42,139 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2019-01-12 03:30:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-01-12 03:30:42,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:42,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:30:42,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:30:42,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:30:42,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:30:42,212 INFO L87 Difference]: Start difference. First operand 2089 states and 2295 transitions. Second operand 4 states. [2019-01-12 03:30:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:44,088 INFO L93 Difference]: Finished difference Result 4730 states and 5243 transitions. [2019-01-12 03:30:44,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:30:44,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2019-01-12 03:30:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:44,091 INFO L225 Difference]: With dead ends: 4730 [2019-01-12 03:30:44,091 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:30:44,098 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 03:30:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:30:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:30:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:30:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:30:44,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 371 [2019-01-12 03:30:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:44,099 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:30:44,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:30:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:30:44,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:30:44,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:30:45,063 WARN L181 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 35 [2019-01-12 03:30:45,448 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 35 [2019-01-12 03:30:45,451 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-01-12 03:30:45,451 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,451 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,451 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,451 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,452 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,452 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,452 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-01-12 03:30:45,452 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-01-12 03:30:45,452 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 03:30:45,452 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 03:30:45,452 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 03:30:45,452 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 03:30:45,452 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 03:30:45,453 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 03:30:45,455 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-01-12 03:30:45,455 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-01-12 03:30:45,455 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 178) no Hoare annotation was computed. [2019-01-12 03:30:45,456 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-01-12 03:30:45,456 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,457 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,457 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,457 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,457 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,457 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-01-12 03:30:45,457 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-01-12 03:30:45,457 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-01-12 03:30:45,457 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-01-12 03:30:45,457 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 03:30:45,457 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 03:30:45,457 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 03:30:45,458 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 03:30:45,460 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 03:30:45,460 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-01-12 03:30:45,460 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-01-12 03:30:45,460 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-01-12 03:30:45,460 INFO L448 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-01-12 03:30:45,460 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-01-12 03:30:45,460 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,461 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,461 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,461 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,461 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,461 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-01-12 03:30:45,461 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 03:30:45,461 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 03:30:45,461 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 03:30:45,461 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 03:30:45,462 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 03:30:45,462 INFO L444 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse0 (= ~a12~0 0)) (.cse1 (= ~a4~0 14)) (.cse2 (not (= 4 ~a10~0))) (.cse3 (<= ~a19~0 8))) (or (and (and (not (= ~a19~0 10)) (not (= ~a19~0 6))) .cse0 .cse1) (and (<= ~a1~0 218) .cse2 .cse0 .cse1) (and (= ~a10~0 1) .cse0 .cse1) (and (<= (+ ~a1~0 333899) 0) .cse3 .cse0 .cse1) (= ~a19~0 8) (and .cse2 .cse3))) [2019-01-12 03:30:45,462 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-01-12 03:30:45,462 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-01-12 03:30:45,462 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-01-12 03:30:45,462 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-01-12 03:30:45,463 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,466 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,466 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,466 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,466 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,466 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-01-12 03:30:45,466 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-01-12 03:30:45,467 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-01-12 03:30:45,467 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 03:30:45,467 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 03:30:45,467 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 03:30:45,467 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 03:30:45,467 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 03:30:45,467 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-01-12 03:30:45,467 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-01-12 03:30:45,467 INFO L451 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-01-12 03:30:45,467 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-01-12 03:30:45,468 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-01-12 03:30:45,468 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-01-12 03:30:45,468 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,468 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,468 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,468 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,468 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,468 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 03:30:45,469 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 03:30:45,472 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 03:30:45,472 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 03:30:45,472 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 03:30:45,472 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-01-12 03:30:45,472 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-01-12 03:30:45,472 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-01-12 03:30:45,472 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-01-12 03:30:45,472 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,473 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,473 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,473 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,473 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,473 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-01-12 03:30:45,473 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-01-12 03:30:45,473 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-01-12 03:30:45,473 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-01-12 03:30:45,473 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 03:30:45,473 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 03:30:45,473 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 03:30:45,474 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 03:30:45,474 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 03:30:45,474 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-01-12 03:30:45,474 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-01-12 03:30:45,474 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:30:45,474 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-01-12 03:30:45,474 INFO L444 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse0 (= ~a12~0 0)) (.cse1 (= ~a4~0 14)) (.cse2 (not (= 4 ~a10~0))) (.cse3 (<= ~a19~0 8))) (or (and (and (not (= ~a19~0 10)) (not (= ~a19~0 6))) .cse0 .cse1) (and (<= ~a1~0 218) .cse2 .cse0 .cse1) (and (= ~a10~0 1) .cse0 .cse1) (and (<= (+ ~a1~0 333899) 0) .cse3 .cse0 .cse1) (= ~a19~0 8) (and .cse2 .cse3))) [2019-01-12 03:30:45,474 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-01-12 03:30:45,475 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,475 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,478 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,478 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,478 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 03:30:45,478 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,478 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,478 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-01-12 03:30:45,478 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-01-12 03:30:45,478 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-01-12 03:30:45,479 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 03:30:45,479 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 03:30:45,479 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 03:30:45,479 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 03:30:45,479 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 03:30:45,479 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 03:30:45,479 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-01-12 03:30:45,479 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-01-12 03:30:45,479 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-01-12 03:30:45,479 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 03:30:45,480 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 03:30:45,481 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 03:30:45,485 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 03:30:45,485 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 03:30:45,485 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 03:30:45,485 INFO L448 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-01-12 03:30:45,485 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-01-12 03:30:45,485 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-01-12 03:30:45,485 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-01-12 03:30:45,485 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-01-12 03:30:45,485 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-01-12 03:30:45,486 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,486 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,486 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,486 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,486 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,486 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,486 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-01-12 03:30:45,486 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 03:30:45,486 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 03:30:45,486 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 03:30:45,486 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 03:30:45,487 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 03:30:45,490 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:30:45,490 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 03:30:45,490 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-01-12 03:30:45,490 INFO L448 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-01-12 03:30:45,490 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-01-12 03:30:45,490 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-01-12 03:30:45,490 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-01-12 03:30:45,490 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-01-12 03:30:45,490 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,491 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,491 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,491 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,491 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,491 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,491 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-01-12 03:30:45,491 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-01-12 03:30:45,491 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-01-12 03:30:45,491 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 03:30:45,491 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 03:30:45,491 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 03:30:45,492 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 03:30:45,492 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 03:30:45,492 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 03:30:45,492 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-01-12 03:30:45,492 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-01-12 03:30:45,492 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:30:45,492 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-01-12 03:30:45,492 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,492 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,492 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,493 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,493 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,493 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:45,493 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-01-12 03:30:45,493 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-01-12 03:30:45,493 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-01-12 03:30:45,493 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 03:30:45,493 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 03:30:45,493 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 03:30:45,493 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 03:30:45,494 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 03:30:45,494 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 03:30:45,494 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-01-12 03:30:45,494 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-01-12 03:30:45,494 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-01-12 03:30:45,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:30:45 BoogieIcfgContainer [2019-01-12 03:30:45,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:30:45,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:30:45,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:30:45,534 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:30:45,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:30:21" (3/4) ... [2019-01-12 03:30:45,542 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:30:45,580 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:30:45,581 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:30:45,794 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:30:45,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:30:45,795 INFO L168 Benchmark]: Toolchain (without parser) took 28283.04 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 495.5 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -266.0 MB). Peak memory consumption was 229.4 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:45,796 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:30:45,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 684.86 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 913.8 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:45,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 176.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -211.9 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:45,797 INFO L168 Benchmark]: Boogie Preprocessor took 80.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:30:45,799 INFO L168 Benchmark]: RCFGBuilder took 3038.38 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: 111.0 MB). Peak memory consumption was 111.0 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:45,799 INFO L168 Benchmark]: TraceAbstraction took 24037.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -217.5 MB). Peak memory consumption was 132.7 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:45,800 INFO L168 Benchmark]: Witness Printer took 260.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:45,803 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.17 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 684.86 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 913.8 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 176.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -211.9 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3038.38 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: 111.0 MB). Peak memory consumption was 111.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24037.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -217.5 MB). Peak memory consumption was 132.7 MB. Max. memory is 11.5 GB. * Witness Printer took 260.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 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: 178]: 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: 582]: Loop Invariant Derived loop invariant: (((((((!(a19 == 10) && !(a19 == 6)) && a12 == 0) && a4 == 14) || (((a1 <= 218 && !(4 == a10)) && a12 == 0) && a4 == 14)) || ((a10 == 1 && a12 == 0) && a4 == 14)) || (((a1 + 333899 <= 0 && a19 <= 8) && a12 == 0) && a4 == 14)) || a19 == 8) || (!(4 == a10) && a19 <= 8) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((!(a19 == 10) && !(a19 == 6)) && a12 == 0) && a4 == 14) || (((a1 <= 218 && !(4 == a10)) && a12 == 0) && a4 == 14)) || ((a10 == 1 && a12 == 0) && a4 == 14)) || (((a1 + 333899 <= 0 && a19 <= 8) && a12 == 0) && a4 == 14)) || a19 == 8) || (!(4 == a10) && a19 <= 8) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. SAFE Result, 23.9s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 18.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 615 SDtfs, 2168 SDslu, 136 SDs, 0 SdLazy, 7018 SolverSat, 1257 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 376 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2089occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 884 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 58 NumberOfFragments, 135 HoareAnnotationTreeSize, 3 FomulaSimplifications, 11426 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1856 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2428 ConstructedInterpolants, 0 QuantifiedInterpolants, 2338396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 2365/2410 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...