./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label28_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/Problem01_label28_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 19:41:50,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 19:41:50,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 19:41:50,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 19:41:50,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 19:41:50,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 19:41:50,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 19:41:50,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 19:41:50,601 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 19:41:50,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 19:41:50,604 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 19:41:50,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 19:41:50,607 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 19:41:50,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 19:41:50,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 19:41:50,615 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 19:41:50,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 19:41:50,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 19:41:50,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 19:41:50,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 19:41:50,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 19:41:50,631 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 19:41:50,633 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 19:41:50,633 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 19:41:50,633 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 19:41:50,634 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 19:41:50,635 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 19:41:50,635 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 19:41:50,636 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 19:41:50,637 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 19:41:50,637 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 19:41:50,638 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 19:41:50,638 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 19:41:50,638 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 19:41:50,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 19:41:50,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 19:41:50,640 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 19:41:50,654 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 19:41:50,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 19:41:50,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 19:41:50,655 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 19:41:50,656 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 19:41:50,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 19:41:50,656 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 19:41:50,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 19:41:50,656 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 19:41:50,657 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 19:41:50,657 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 19:41:50,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 19:41:50,657 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 19:41:50,657 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 19:41:50,657 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 19:41:50,658 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 19:41:50,658 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 19:41:50,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 19:41:50,658 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 19:41:50,658 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 19:41:50,658 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 19:41:50,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:41:50,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 19:41:50,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 19:41:50,659 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 19:41:50,659 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 19:41:50,659 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 19:41:50,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 19:41:50,660 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 -> 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b [2018-12-30 19:41:50,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 19:41:50,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 19:41:50,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 19:41:50,711 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 19:41:50,711 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 19:41:50,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label28_true-unreach-call_false-termination.c [2018-12-30 19:41:50,769 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/898caa19e/44bb77c5c1004db0baacf884b7bcdc8c/FLAGe8c048ba6 [2018-12-30 19:41:51,342 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 19:41:51,343 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label28_true-unreach-call_false-termination.c [2018-12-30 19:41:51,358 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/898caa19e/44bb77c5c1004db0baacf884b7bcdc8c/FLAGe8c048ba6 [2018-12-30 19:41:51,622 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/898caa19e/44bb77c5c1004db0baacf884b7bcdc8c [2018-12-30 19:41:51,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 19:41:51,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 19:41:51,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 19:41:51,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 19:41:51,633 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 19:41:51,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:41:51" (1/1) ... [2018-12-30 19:41:51,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540addd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:51, skipping insertion in model container [2018-12-30 19:41:51,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:41:51" (1/1) ... [2018-12-30 19:41:51,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 19:41:51,708 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 19:41:52,140 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:41:52,146 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 19:41:52,305 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:41:52,323 INFO L195 MainTranslator]: Completed translation [2018-12-30 19:41:52,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52 WrapperNode [2018-12-30 19:41:52,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 19:41:52,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 19:41:52,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 19:41:52,325 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 19:41:52,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52" (1/1) ... [2018-12-30 19:41:52,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52" (1/1) ... [2018-12-30 19:41:52,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 19:41:52,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 19:41:52,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 19:41:52,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 19:41:52,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52" (1/1) ... [2018-12-30 19:41:52,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52" (1/1) ... [2018-12-30 19:41:52,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52" (1/1) ... [2018-12-30 19:41:52,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52" (1/1) ... [2018-12-30 19:41:52,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52" (1/1) ... [2018-12-30 19:41:52,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52" (1/1) ... [2018-12-30 19:41:52,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52" (1/1) ... [2018-12-30 19:41:52,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 19:41:52,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 19:41:52,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 19:41:52,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 19:41:52,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52" (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 [2018-12-30 19:41:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 19:41:52,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 19:41:55,893 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 19:41:55,894 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 19:41:55,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:55 BoogieIcfgContainer [2018-12-30 19:41:55,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 19:41:55,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 19:41:55,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 19:41:55,899 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 19:41:55,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 07:41:51" (1/3) ... [2018-12-30 19:41:55,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f1b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:41:55, skipping insertion in model container [2018-12-30 19:41:55,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:52" (2/3) ... [2018-12-30 19:41:55,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f1b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:41:55, skipping insertion in model container [2018-12-30 19:41:55,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:55" (3/3) ... [2018-12-30 19:41:55,903 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label28_true-unreach-call_false-termination.c [2018-12-30 19:41:55,915 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 19:41:55,924 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 19:41:55,944 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 19:41:55,985 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 19:41:55,986 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 19:41:55,986 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 19:41:55,986 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 19:41:55,986 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 19:41:55,986 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 19:41:55,987 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 19:41:55,987 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 19:41:55,987 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 19:41:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 19:41:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-30 19:41:56,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:56,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:56,042 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:56,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1601987962, now seen corresponding path program 1 times [2018-12-30 19:41:56,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:56,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:56,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:41:56,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:56,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:56,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:56,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:56,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:56,572 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2018-12-30 19:41:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:58,124 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2018-12-30 19:41:58,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:58,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-12-30 19:41:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:58,143 INFO L225 Difference]: With dead ends: 528 [2018-12-30 19:41:58,143 INFO L226 Difference]: Without dead ends: 266 [2018-12-30 19:41:58,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-30 19:41:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2018-12-30 19:41:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-30 19:41:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2018-12-30 19:41:58,224 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 93 [2018-12-30 19:41:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:58,225 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2018-12-30 19:41:58,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2018-12-30 19:41:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-30 19:41:58,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:58,233 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:58,234 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:58,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:58,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1168423854, now seen corresponding path program 1 times [2018-12-30 19:41:58,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:58,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:58,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:58,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:58,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:41:58,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:58,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:58,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:58,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:58,376 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2018-12-30 19:41:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:59,427 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2018-12-30 19:41:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:59,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-30 19:41:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:59,433 INFO L225 Difference]: With dead ends: 792 [2018-12-30 19:41:59,433 INFO L226 Difference]: Without dead ends: 528 [2018-12-30 19:41:59,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-12-30 19:41:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-12-30 19:41:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-12-30 19:41:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2018-12-30 19:41:59,476 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 98 [2018-12-30 19:41:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:59,476 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2018-12-30 19:41:59,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2018-12-30 19:41:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-30 19:41:59,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:59,481 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:59,481 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:59,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:59,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1574089224, now seen corresponding path program 1 times [2018-12-30 19:41:59,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:59,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:59,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:41:59,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:59,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:59,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:59,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:59,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:59,595 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand 4 states. [2018-12-30 19:42:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:42:00,914 INFO L93 Difference]: Finished difference Result 2102 states and 2876 transitions. [2018-12-30 19:42:00,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:42:00,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-30 19:42:00,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:42:00,924 INFO L225 Difference]: With dead ends: 2102 [2018-12-30 19:42:00,925 INFO L226 Difference]: Without dead ends: 1576 [2018-12-30 19:42:00,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:42:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2018-12-30 19:42:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2018-12-30 19:42:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-12-30 19:42:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2045 transitions. [2018-12-30 19:42:00,983 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2045 transitions. Word has length 102 [2018-12-30 19:42:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:42:00,984 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 2045 transitions. [2018-12-30 19:42:00,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:42:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2045 transitions. [2018-12-30 19:42:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-30 19:42:00,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:42:00,999 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:42:01,000 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:42:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:42:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1573040001, now seen corresponding path program 1 times [2018-12-30 19:42:01,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:42:01,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:42:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:01,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:42:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-30 19:42:01,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:42:01,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:42:01,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:42:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:42:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:42:01,122 INFO L87 Difference]: Start difference. First operand 1576 states and 2045 transitions. Second operand 3 states. [2018-12-30 19:42:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:42:03,599 INFO L93 Difference]: Finished difference Result 3412 states and 4452 transitions. [2018-12-30 19:42:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:42:03,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-12-30 19:42:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:42:03,607 INFO L225 Difference]: With dead ends: 3412 [2018-12-30 19:42:03,607 INFO L226 Difference]: Without dead ends: 1838 [2018-12-30 19:42:03,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:42:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-30 19:42:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1314. [2018-12-30 19:42:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2018-12-30 19:42:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1699 transitions. [2018-12-30 19:42:03,644 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1699 transitions. Word has length 105 [2018-12-30 19:42:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:42:03,644 INFO L480 AbstractCegarLoop]: Abstraction has 1314 states and 1699 transitions. [2018-12-30 19:42:03,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:42:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1699 transitions. [2018-12-30 19:42:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-30 19:42:03,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:42:03,648 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:42:03,648 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:42:03,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:42:03,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1954141031, now seen corresponding path program 1 times [2018-12-30 19:42:03,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:42:03,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:42:03,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:03,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:42:03,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:03,882 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 19:42:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:42:03,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:42:03,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:42:03,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:42:03,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:42:03,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:42:03,937 INFO L87 Difference]: Start difference. First operand 1314 states and 1699 transitions. Second operand 4 states. [2018-12-30 19:42:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:42:04,825 INFO L93 Difference]: Finished difference Result 2762 states and 3550 transitions. [2018-12-30 19:42:04,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:42:04,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-30 19:42:04,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:42:04,833 INFO L225 Difference]: With dead ends: 2762 [2018-12-30 19:42:04,833 INFO L226 Difference]: Without dead ends: 1450 [2018-12-30 19:42:04,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:42:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-12-30 19:42:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2018-12-30 19:42:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-30 19:42:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1836 transitions. [2018-12-30 19:42:04,864 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1836 transitions. Word has length 108 [2018-12-30 19:42:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:42:04,865 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1836 transitions. [2018-12-30 19:42:04,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:42:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1836 transitions. [2018-12-30 19:42:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-30 19:42:04,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:42:04,869 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:42:04,870 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:42:04,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:42:04,870 INFO L82 PathProgramCache]: Analyzing trace with hash -376310369, now seen corresponding path program 1 times [2018-12-30 19:42:04,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:42:04,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:42:04,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:04,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:42:04,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:05,309 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:42:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:42:05,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:42:05,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:42:05,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:42:05,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:42:05,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:42:05,321 INFO L87 Difference]: Start difference. First operand 1445 states and 1836 transitions. Second operand 5 states. [2018-12-30 19:42:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:42:06,523 INFO L93 Difference]: Finished difference Result 2757 states and 3533 transitions. [2018-12-30 19:42:06,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:42:06,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2018-12-30 19:42:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:42:06,531 INFO L225 Difference]: With dead ends: 2757 [2018-12-30 19:42:06,531 INFO L226 Difference]: Without dead ends: 1445 [2018-12-30 19:42:06,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:42:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2018-12-30 19:42:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2018-12-30 19:42:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-30 19:42:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1806 transitions. [2018-12-30 19:42:06,559 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1806 transitions. Word has length 112 [2018-12-30 19:42:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:42:06,560 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1806 transitions. [2018-12-30 19:42:06,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:42:06,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1806 transitions. [2018-12-30 19:42:06,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-30 19:42:06,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:42:06,564 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:42:06,564 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:42:06,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:42:06,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1702667398, now seen corresponding path program 1 times [2018-12-30 19:42:06,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:42:06,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:42:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:06,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:42:06,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:42:06,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:42:06,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:42:06,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:42:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:42:06,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:42:06,661 INFO L87 Difference]: Start difference. First operand 1445 states and 1806 transitions. Second operand 3 states. [2018-12-30 19:42:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:42:07,227 INFO L93 Difference]: Finished difference Result 3150 states and 3956 transitions. [2018-12-30 19:42:07,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:42:07,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-30 19:42:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:42:07,234 INFO L225 Difference]: With dead ends: 3150 [2018-12-30 19:42:07,234 INFO L226 Difference]: Without dead ends: 1707 [2018-12-30 19:42:07,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:42:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2018-12-30 19:42:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2018-12-30 19:42:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-30 19:42:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1665 transitions. [2018-12-30 19:42:07,263 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1665 transitions. Word has length 115 [2018-12-30 19:42:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:42:07,263 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1665 transitions. [2018-12-30 19:42:07,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:42:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1665 transitions. [2018-12-30 19:42:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-30 19:42:07,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:42:07,266 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:42:07,268 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:42:07,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:42:07,269 INFO L82 PathProgramCache]: Analyzing trace with hash 970685544, now seen corresponding path program 1 times [2018-12-30 19:42:07,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:42:07,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:42:07,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:07,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:42:07,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-30 19:42:07,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:42:07,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:42:07,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:42:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:42:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:42:07,390 INFO L87 Difference]: Start difference. First operand 1445 states and 1665 transitions. Second operand 3 states. [2018-12-30 19:42:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:42:08,181 INFO L93 Difference]: Finished difference Result 2888 states and 3326 transitions. [2018-12-30 19:42:08,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:42:08,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-30 19:42:08,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:42:08,210 INFO L225 Difference]: With dead ends: 2888 [2018-12-30 19:42:08,210 INFO L226 Difference]: Without dead ends: 1445 [2018-12-30 19:42:08,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:42:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2018-12-30 19:42:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2018-12-30 19:42:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-30 19:42:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1593 transitions. [2018-12-30 19:42:08,236 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1593 transitions. Word has length 123 [2018-12-30 19:42:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:42:08,237 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1593 transitions. [2018-12-30 19:42:08,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:42:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1593 transitions. [2018-12-30 19:42:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-30 19:42:08,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:42:08,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:42:08,241 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:42:08,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:42:08,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2027458046, now seen corresponding path program 1 times [2018-12-30 19:42:08,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:42:08,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:42:08,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:08,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:42:08,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:08,715 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-30 19:42:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:42:09,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:42:09,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-30 19:42:09,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 19:42:09,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 19:42:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-12-30 19:42:09,120 INFO L87 Difference]: Start difference. First operand 1445 states and 1593 transitions. Second operand 12 states. [2018-12-30 19:42:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:42:11,147 INFO L93 Difference]: Finished difference Result 3260 states and 3653 transitions. [2018-12-30 19:42:11,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-30 19:42:11,148 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-12-30 19:42:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:42:11,157 INFO L225 Difference]: With dead ends: 3260 [2018-12-30 19:42:11,158 INFO L226 Difference]: Without dead ends: 1914 [2018-12-30 19:42:11,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-12-30 19:42:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2018-12-30 19:42:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1742. [2018-12-30 19:42:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2018-12-30 19:42:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1908 transitions. [2018-12-30 19:42:11,193 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1908 transitions. Word has length 130 [2018-12-30 19:42:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:42:11,193 INFO L480 AbstractCegarLoop]: Abstraction has 1742 states and 1908 transitions. [2018-12-30 19:42:11,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 19:42:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1908 transitions. [2018-12-30 19:42:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-30 19:42:11,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:42:11,200 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-12-30 19:42:11,200 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:42:11,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:42:11,200 INFO L82 PathProgramCache]: Analyzing trace with hash 591091391, now seen corresponding path program 1 times [2018-12-30 19:42:11,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:42:11,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:42:11,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:11,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:42:11,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:11,695 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-12-30 19:42:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-30 19:42:11,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:42:11,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:42:11,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:42:11,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:42:11,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:42:11,781 INFO L87 Difference]: Start difference. First operand 1742 states and 1908 transitions. Second operand 4 states. [2018-12-30 19:42:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:42:14,023 INFO L93 Difference]: Finished difference Result 3613 states and 3988 transitions. [2018-12-30 19:42:14,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:42:14,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-12-30 19:42:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:42:14,032 INFO L225 Difference]: With dead ends: 3613 [2018-12-30 19:42:14,032 INFO L226 Difference]: Without dead ends: 1873 [2018-12-30 19:42:14,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:42:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-12-30 19:42:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1742. [2018-12-30 19:42:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2018-12-30 19:42:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1878 transitions. [2018-12-30 19:42:14,065 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1878 transitions. Word has length 200 [2018-12-30 19:42:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:42:14,066 INFO L480 AbstractCegarLoop]: Abstraction has 1742 states and 1878 transitions. [2018-12-30 19:42:14,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:42:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1878 transitions. [2018-12-30 19:42:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-30 19:42:14,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:42:14,072 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:42:14,072 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:42:14,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:42:14,073 INFO L82 PathProgramCache]: Analyzing trace with hash 490719990, now seen corresponding path program 1 times [2018-12-30 19:42:14,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:42:14,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:42:14,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:14,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:42:14,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-30 19:42:14,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:42:14,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:42:14,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:42:14,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:42:14,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:42:14,266 INFO L87 Difference]: Start difference. First operand 1742 states and 1878 transitions. Second operand 3 states. [2018-12-30 19:42:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:42:14,676 INFO L93 Difference]: Finished difference Result 1744 states and 1879 transitions. [2018-12-30 19:42:14,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:42:14,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-12-30 19:42:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:42:14,684 INFO L225 Difference]: With dead ends: 1744 [2018-12-30 19:42:14,684 INFO L226 Difference]: Without dead ends: 1742 [2018-12-30 19:42:14,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:42:14,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2018-12-30 19:42:14,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2018-12-30 19:42:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2018-12-30 19:42:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1877 transitions. [2018-12-30 19:42:14,711 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1877 transitions. Word has length 208 [2018-12-30 19:42:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:42:14,712 INFO L480 AbstractCegarLoop]: Abstraction has 1742 states and 1877 transitions. [2018-12-30 19:42:14,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:42:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1877 transitions. [2018-12-30 19:42:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-30 19:42:14,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:42:14,720 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-12-30 19:42:14,721 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:42:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:42:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1524272564, now seen corresponding path program 1 times [2018-12-30 19:42:14,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:42:14,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:42:14,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:14,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:42:14,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:15,125 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-30 19:42:15,422 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-12-30 19:42:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-12-30 19:42:16,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 19:42:16,037 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 [2018-12-30 19:42:16,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:42:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:16,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 19:42:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-12-30 19:42:16,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 19:42:16,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-12-30 19:42:16,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 19:42:16,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 19:42:16,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-12-30 19:42:16,490 INFO L87 Difference]: Start difference. First operand 1742 states and 1877 transitions. Second operand 14 states. [2018-12-30 19:42:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:42:19,773 INFO L93 Difference]: Finished difference Result 3266 states and 3528 transitions. [2018-12-30 19:42:19,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 19:42:19,778 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 283 [2018-12-30 19:42:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:42:19,779 INFO L225 Difference]: With dead ends: 3266 [2018-12-30 19:42:19,779 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 19:42:19,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 283 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-12-30 19:42:19,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 19:42:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 19:42:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 19:42:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 19:42:19,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 283 [2018-12-30 19:42:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:42:19,785 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 19:42:19,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 19:42:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 19:42:19,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 19:42:19,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 19:42:19,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:42:19,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:42:21,976 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-12-30 19:42:22,272 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-12-30 19:42:22,275 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-30 19:42:22,276 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 455) no Hoare annotation was computed. [2018-12-30 19:42:22,276 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-30 19:42:22,276 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,276 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,276 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,276 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,276 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,276 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,276 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-30 19:42:22,276 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-30 19:42:22,277 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-30 19:42:22,277 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-30 19:42:22,278 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-30 19:42:22,278 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-30 19:42:22,278 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-30 19:42:22,278 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-30 19:42:22,279 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-30 19:42:22,279 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-30 19:42:22,279 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,279 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,279 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,279 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,279 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,279 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,279 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-30 19:42:22,279 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-30 19:42:22,279 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-30 19:42:22,280 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-30 19:42:22,281 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,281 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,281 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,281 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,281 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,281 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-30 19:42:22,281 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-30 19:42:22,281 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-30 19:42:22,281 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-30 19:42:22,281 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-30 19:42:22,281 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-30 19:42:22,282 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-30 19:42:22,282 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-30 19:42:22,282 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-30 19:42:22,282 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse5 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (let ((.cse4 (<= ~a21~0 0)) (.cse6 (= ~a8~0 13)) (.cse9 (<= ~a17~0 0)) (.cse8 (and .cse3 .cse5 .cse1)) (.cse7 (= ~a17~0 1)) (.cse2 (= ~a16~0 5)) (.cse10 (= ~a16~0 4)) (.cse11 (not .cse3)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse0) (and .cse7 .cse8) (and .cse4 .cse6 .cse3 .cse0 .cse9 (= ~a20~0 1) (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and .cse10 .cse9 .cse8) (and .cse11 .cse0 .cse7 .cse1) (and .cse3 .cse1 .cse2) (and .cse11 .cse10 .cse0 .cse1) (and .cse11 (= ~a8~0 15) .cse0 .cse1)))) [2018-12-30 19:42:22,282 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,283 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,285 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,285 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,285 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,285 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-30 19:42:22,286 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-30 19:42:22,286 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-30 19:42:22,286 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-30 19:42:22,286 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-30 19:42:22,286 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-30 19:42:22,286 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-30 19:42:22,286 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-30 19:42:22,286 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-30 19:42:22,286 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-30 19:42:22,286 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-30 19:42:22,286 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-30 19:42:22,287 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-30 19:42:22,288 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-30 19:42:22,288 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-30 19:42:22,288 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-30 19:42:22,289 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-30 19:42:22,290 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-30 19:42:22,290 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 19:42:22,290 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-30 19:42:22,290 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-30 19:42:22,290 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-30 19:42:22,290 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-30 19:42:22,290 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-30 19:42:22,290 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-30 19:42:22,290 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,291 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse5 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (let ((.cse4 (<= ~a21~0 0)) (.cse6 (= ~a8~0 13)) (.cse9 (<= ~a17~0 0)) (.cse8 (and .cse3 .cse5 .cse1)) (.cse7 (= ~a17~0 1)) (.cse2 (= ~a16~0 5)) (.cse10 (= ~a16~0 4)) (.cse11 (not .cse3)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse0) (and .cse7 .cse8) (and .cse4 .cse6 .cse3 .cse0 .cse9 (= ~a20~0 1) (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and .cse10 .cse9 .cse8) (and .cse11 .cse0 .cse7 .cse1) (and .cse3 .cse1 .cse2) (and .cse11 .cse10 .cse0 .cse1) (and .cse11 (= ~a8~0 15) .cse0 .cse1)))) [2018-12-30 19:42:22,291 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,291 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,291 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,291 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,291 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-30 19:42:22,291 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-30 19:42:22,291 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-30 19:42:22,291 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-30 19:42:22,291 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-30 19:42:22,291 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-30 19:42:22,292 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-30 19:42:22,293 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-30 19:42:22,297 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-30 19:42:22,297 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-30 19:42:22,297 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-30 19:42:22,297 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-30 19:42:22,297 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-30 19:42:22,297 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-30 19:42:22,297 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-30 19:42:22,297 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,297 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-30 19:42:22,298 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-30 19:42:22,299 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-30 19:42:22,300 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-30 19:42:22,301 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-30 19:42:22,302 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-30 19:42:22,302 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-30 19:42:22,302 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-30 19:42:22,302 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-30 19:42:22,302 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-30 19:42:22,302 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-30 19:42:22,302 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-30 19:42:22,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 07:42:22 BoogieIcfgContainer [2018-12-30 19:42:22,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 19:42:22,340 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 19:42:22,340 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 19:42:22,340 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 19:42:22,341 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:55" (3/4) ... [2018-12-30 19:42:22,347 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 19:42:22,384 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 19:42:22,385 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 19:42:22,607 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 19:42:22,612 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 19:42:22,613 INFO L168 Benchmark]: Toolchain (without parser) took 30985.87 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 468.7 MB). Free memory was 947.3 MB in the beginning and 1.4 GB in the end (delta: -494.3 MB). Peak memory consumption was 522.7 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:22,613 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 19:42:22,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.22 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.0 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:22,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 192.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 915.0 MB in the beginning and 1.1 GB in the end (delta: -214.7 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:22,615 INFO L168 Benchmark]: Boogie Preprocessor took 87.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:22,616 INFO L168 Benchmark]: RCFGBuilder took 3289.82 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: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:22,616 INFO L168 Benchmark]: TraceAbstraction took 26444.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.0 GB in the beginning and 808.4 MB in the end (delta: 208.5 MB). Peak memory consumption was 449.1 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:22,618 INFO L168 Benchmark]: Witness Printer took 271.80 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 84.9 MB). Free memory was 808.4 MB in the beginning and 1.4 GB in the end (delta: -633.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 19:42:22,622 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 695.22 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.0 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 192.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 915.0 MB in the beginning and 1.1 GB in the end (delta: -214.7 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3289.82 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: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26444.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.0 GB in the beginning and 808.4 MB in the end (delta: 208.5 MB). Peak memory consumption was 449.1 MB. Max. memory is 11.5 GB. * Witness Printer took 271.80 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 84.9 MB). Free memory was 808.4 MB in the beginning and 1.4 GB in the end (delta: -633.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 455]: 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: 30]: Loop Invariant Derived loop invariant: (((((((((a12 == 8 && a21 == 1) && a16 == 5) || ((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a12 == 8)) || (a17 == 1 && (a7 == 1 && !(a16 == 6)) && a21 == 1)) || ((((((a21 <= 0 && a8 == 13) && a7 == 1) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || ((a16 == 4 && a17 <= 0) && (a7 == 1 && !(a16 == 6)) && a21 == 1)) || (((!(a7 == 1) && a12 == 8) && a17 == 1) && a21 == 1)) || ((a7 == 1 && a21 == 1) && a16 == 5)) || (((!(a7 == 1) && a16 == 4) && a12 == 8) && a21 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((a12 == 8 && a21 == 1) && a16 == 5) || ((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a12 == 8)) || (a17 == 1 && (a7 == 1 && !(a16 == 6)) && a21 == 1)) || ((((((a21 <= 0 && a8 == 13) && a7 == 1) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || ((a16 == 4 && a17 <= 0) && (a7 == 1 && !(a16 == 6)) && a21 == 1)) || (((!(a7 == 1) && a12 == 8) && a17 == 1) && a21 == 1)) || ((a7 == 1 && a21 == 1) && a16 == 5)) || (((!(a7 == 1) && a16 == 4) && a12 == 8) && a21 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 26.3s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 17.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 737 SDtfs, 2930 SDslu, 156 SDs, 0 SdLazy, 7088 SolverSat, 801 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 297 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1742occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1094 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 39 NumberOfFragments, 297 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1521 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 194 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1960 NumberOfCodeBlocks, 1960 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1947 ConstructedInterpolants, 0 QuantifiedInterpolants, 1696138 SizeOfPredicates, 1 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1511/1519 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...