java -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label22_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:49:21,743 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:49:21,745 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:49:21,757 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:49:21,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:49:21,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:49:21,760 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:49:21,762 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:49:21,764 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:49:21,767 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:49:21,767 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:49:21,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:49:21,770 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:49:21,771 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:49:21,774 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:49:21,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:49:21,779 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:49:21,784 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:49:21,790 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:49:21,792 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:49:21,793 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:49:21,795 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:49:21,799 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:49:21,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:49:21,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:49:21,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:49:21,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:49:21,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:49:21,807 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:49:21,808 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:49:21,808 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:49:21,809 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:49:21,809 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:49:21,809 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:49:21,812 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:49:21,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:49:21,813 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:49:21,839 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:49:21,839 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:49:21,840 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:49:21,840 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:49:21,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:49:21,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:49:21,842 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:49:21,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:49:21,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:49:21,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:49:21,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:49:21,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:49:21,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:49:21,845 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:49:21,845 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:49:21,845 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:49:21,845 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:49:21,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:49:21,847 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:49:21,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:49:21,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:49:21,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:49:21,848 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:49:21,848 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:49:21,848 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:49:21,849 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:49:21,849 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:49:21,849 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:49:21,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:49:21,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:49:21,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:49:21,919 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:49:21,920 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:49:21,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label22_true-unreach-call_false-termination.c [2018-11-06 19:49:21,980 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dacc2ccca/ad2d24ea0ec941b8a5d530cc4fdb79b8/FLAGbb9d59ac5 [2018-11-06 19:49:22,584 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:49:22,587 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label22_true-unreach-call_false-termination.c [2018-11-06 19:49:22,604 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dacc2ccca/ad2d24ea0ec941b8a5d530cc4fdb79b8/FLAGbb9d59ac5 [2018-11-06 19:49:22,621 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dacc2ccca/ad2d24ea0ec941b8a5d530cc4fdb79b8 [2018-11-06 19:49:22,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:49:22,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:49:22,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:22,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:49:22,641 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:49:22,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:22" (1/1) ... [2018-11-06 19:49:22,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673adebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:22, skipping insertion in model container [2018-11-06 19:49:22,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:22" (1/1) ... [2018-11-06 19:49:22,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:49:22,725 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:49:23,199 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:23,204 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:49:23,328 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:23,346 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:49:23,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23 WrapperNode [2018-11-06 19:49:23,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:23,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:23,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:49:23,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:49:23,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (1/1) ... [2018-11-06 19:49:23,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (1/1) ... [2018-11-06 19:49:23,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:23,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:49:23,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:49:23,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:49:23,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (1/1) ... [2018-11-06 19:49:23,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (1/1) ... [2018-11-06 19:49:23,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (1/1) ... [2018-11-06 19:49:23,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (1/1) ... [2018-11-06 19:49:23,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (1/1) ... [2018-11-06 19:49:23,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (1/1) ... [2018-11-06 19:49:23,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (1/1) ... [2018-11-06 19:49:23,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:49:23,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:49:23,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:49:23,598 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:49:23,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (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-11-06 19:49:23,686 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:49:23,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:49:23,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:49:27,001 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:49:27,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:27 BoogieIcfgContainer [2018-11-06 19:49:27,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:49:27,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:49:27,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:49:27,010 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:49:27,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:49:22" (1/3) ... [2018-11-06 19:49:27,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acb323a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:27, skipping insertion in model container [2018-11-06 19:49:27,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (2/3) ... [2018-11-06 19:49:27,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acb323a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:27, skipping insertion in model container [2018-11-06 19:49:27,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:27" (3/3) ... [2018-11-06 19:49:27,018 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label22_true-unreach-call_false-termination.c [2018-11-06 19:49:27,030 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:49:27,044 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:49:27,064 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:49:27,123 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:49:27,124 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:49:27,125 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:49:27,125 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:49:27,125 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:49:27,125 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:49:27,126 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:49:27,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:49:27,126 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:49:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-11-06 19:49:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-06 19:49:27,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:27,176 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:27,179 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:27,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash -472723313, now seen corresponding path program 1 times [2018-11-06 19:49:27,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:27,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:27,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:27,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:27,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:28,007 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-06 19:49:28,846 WARN L179 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-11-06 19:49:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:29,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:29,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-06 19:49:29,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:49:29,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:49:29,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:49:29,204 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 10 states. [2018-11-06 19:49:29,521 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-06 19:49:31,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:31,713 INFO L93 Difference]: Finished difference Result 636 states and 1117 transitions. [2018-11-06 19:49:31,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:49:31,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 128 [2018-11-06 19:49:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:31,732 INFO L225 Difference]: With dead ends: 636 [2018-11-06 19:49:31,733 INFO L226 Difference]: Without dead ends: 254 [2018-11-06 19:49:31,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-11-06 19:49:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-06 19:49:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-11-06 19:49:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-06 19:49:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2018-11-06 19:49:31,797 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 128 [2018-11-06 19:49:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:31,797 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2018-11-06 19:49:31,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 19:49:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2018-11-06 19:49:31,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-06 19:49:31,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:31,801 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:31,802 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:31,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:31,802 INFO L82 PathProgramCache]: Analyzing trace with hash -575477785, now seen corresponding path program 1 times [2018-11-06 19:49:31,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:31,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:31,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:31,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:31,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:32,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:32,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:32,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:32,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:32,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:32,164 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2018-11-06 19:49:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:34,024 INFO L93 Difference]: Finished difference Result 711 states and 1218 transitions. [2018-11-06 19:49:34,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:34,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2018-11-06 19:49:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:34,031 INFO L225 Difference]: With dead ends: 711 [2018-11-06 19:49:34,032 INFO L226 Difference]: Without dead ends: 518 [2018-11-06 19:49:34,034 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:34,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-06 19:49:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2018-11-06 19:49:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-06 19:49:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 803 transitions. [2018-11-06 19:49:34,070 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 803 transitions. Word has length 133 [2018-11-06 19:49:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:34,071 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 803 transitions. [2018-11-06 19:49:34,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 803 transitions. [2018-11-06 19:49:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-06 19:49:34,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:34,076 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:49:34,076 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:34,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash -20188448, now seen corresponding path program 1 times [2018-11-06 19:49:34,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:34,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:34,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:34,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:34,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 19:49:34,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:34,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:34,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:34,209 INFO L87 Difference]: Start difference. First operand 518 states and 803 transitions. Second operand 4 states. [2018-11-06 19:49:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:35,456 INFO L93 Difference]: Finished difference Result 1371 states and 2217 transitions. [2018-11-06 19:49:35,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:35,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-11-06 19:49:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:35,469 INFO L225 Difference]: With dead ends: 1371 [2018-11-06 19:49:35,470 INFO L226 Difference]: Without dead ends: 914 [2018-11-06 19:49:35,471 INFO L604 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-11-06 19:49:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-11-06 19:49:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2018-11-06 19:49:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-11-06 19:49:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1336 transitions. [2018-11-06 19:49:35,506 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1336 transitions. Word has length 139 [2018-11-06 19:49:35,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:35,506 INFO L480 AbstractCegarLoop]: Abstraction has 914 states and 1336 transitions. [2018-11-06 19:49:35,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1336 transitions. [2018-11-06 19:49:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-06 19:49:35,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:35,510 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:35,510 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:35,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:35,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1310955865, now seen corresponding path program 1 times [2018-11-06 19:49:35,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:35,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:35,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:35,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:35,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:49:35,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:35,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:35,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:35,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:35,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:35,632 INFO L87 Difference]: Start difference. First operand 914 states and 1336 transitions. Second operand 3 states. [2018-11-06 19:49:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:38,583 INFO L93 Difference]: Finished difference Result 2163 states and 3283 transitions. [2018-11-06 19:49:38,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:38,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-11-06 19:49:38,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:38,592 INFO L225 Difference]: With dead ends: 2163 [2018-11-06 19:49:38,592 INFO L226 Difference]: Without dead ends: 1310 [2018-11-06 19:49:38,594 INFO L604 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-11-06 19:49:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2018-11-06 19:49:38,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1310. [2018-11-06 19:49:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2018-11-06 19:49:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1965 transitions. [2018-11-06 19:49:38,621 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1965 transitions. Word has length 156 [2018-11-06 19:49:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:38,621 INFO L480 AbstractCegarLoop]: Abstraction has 1310 states and 1965 transitions. [2018-11-06 19:49:38,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1965 transitions. [2018-11-06 19:49:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-06 19:49:38,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:38,626 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:49:38,626 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:38,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash 796249898, now seen corresponding path program 1 times [2018-11-06 19:49:38,626 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:38,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:38,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:38,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-06 19:49:38,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:38,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:38,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:38,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:38,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:38,801 INFO L87 Difference]: Start difference. First operand 1310 states and 1965 transitions. Second operand 3 states. [2018-11-06 19:49:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:39,567 INFO L93 Difference]: Finished difference Result 3351 states and 5026 transitions. [2018-11-06 19:49:39,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:39,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2018-11-06 19:49:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:39,578 INFO L225 Difference]: With dead ends: 3351 [2018-11-06 19:49:39,579 INFO L226 Difference]: Without dead ends: 2102 [2018-11-06 19:49:39,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2018-11-06 19:49:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2102. [2018-11-06 19:49:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2018-11-06 19:49:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 2947 transitions. [2018-11-06 19:49:39,621 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 2947 transitions. Word has length 194 [2018-11-06 19:49:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:39,622 INFO L480 AbstractCegarLoop]: Abstraction has 2102 states and 2947 transitions. [2018-11-06 19:49:39,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2947 transitions. [2018-11-06 19:49:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-06 19:49:39,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:39,628 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:49:39,629 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:39,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:39,629 INFO L82 PathProgramCache]: Analyzing trace with hash 836348910, now seen corresponding path program 1 times [2018-11-06 19:49:39,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:39,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:39,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:39,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:39,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 19:49:39,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:39,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:39,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:39,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:39,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:39,762 INFO L87 Difference]: Start difference. First operand 2102 states and 2947 transitions. Second operand 4 states. [2018-11-06 19:49:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:40,796 INFO L93 Difference]: Finished difference Result 4275 states and 6060 transitions. [2018-11-06 19:49:40,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:40,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-11-06 19:49:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:40,807 INFO L225 Difference]: With dead ends: 4275 [2018-11-06 19:49:40,807 INFO L226 Difference]: Without dead ends: 2234 [2018-11-06 19:49:40,811 INFO L604 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-11-06 19:49:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2018-11-06 19:49:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2234. [2018-11-06 19:49:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2018-11-06 19:49:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3101 transitions. [2018-11-06 19:49:40,885 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3101 transitions. Word has length 207 [2018-11-06 19:49:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:40,886 INFO L480 AbstractCegarLoop]: Abstraction has 2234 states and 3101 transitions. [2018-11-06 19:49:40,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3101 transitions. [2018-11-06 19:49:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-06 19:49:40,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:40,892 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:49:40,892 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:40,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2083619542, now seen corresponding path program 1 times [2018-11-06 19:49:40,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:40,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:40,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 19:49:41,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:41,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:41,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:41,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:41,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:41,003 INFO L87 Difference]: Start difference. First operand 2234 states and 3101 transitions. Second operand 3 states. [2018-11-06 19:49:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:41,773 INFO L93 Difference]: Finished difference Result 5855 states and 8024 transitions. [2018-11-06 19:49:41,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:41,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-11-06 19:49:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:41,784 INFO L225 Difference]: With dead ends: 5855 [2018-11-06 19:49:41,785 INFO L226 Difference]: Without dead ends: 2603 [2018-11-06 19:49:41,789 INFO L604 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-11-06 19:49:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2018-11-06 19:49:41,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2603. [2018-11-06 19:49:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2603 states. [2018-11-06 19:49:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 2965 transitions. [2018-11-06 19:49:41,834 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 2965 transitions. Word has length 210 [2018-11-06 19:49:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:41,834 INFO L480 AbstractCegarLoop]: Abstraction has 2603 states and 2965 transitions. [2018-11-06 19:49:41,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 2965 transitions. [2018-11-06 19:49:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-06 19:49:41,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:41,842 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:41,842 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:41,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2122477055, now seen corresponding path program 1 times [2018-11-06 19:49:41,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:41,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:41,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:41,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:41,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-06 19:49:42,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:42,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:42,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:42,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:42,052 INFO L87 Difference]: Start difference. First operand 2603 states and 2965 transitions. Second operand 3 states. [2018-11-06 19:49:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:42,996 INFO L93 Difference]: Finished difference Result 6727 states and 7679 transitions. [2018-11-06 19:49:42,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:42,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2018-11-06 19:49:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:43,008 INFO L225 Difference]: With dead ends: 6727 [2018-11-06 19:49:43,008 INFO L226 Difference]: Without dead ends: 3651 [2018-11-06 19:49:43,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2018-11-06 19:49:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 3519. [2018-11-06 19:49:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3519 states. [2018-11-06 19:49:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 3519 states and 3912 transitions. [2018-11-06 19:49:43,063 INFO L78 Accepts]: Start accepts. Automaton has 3519 states and 3912 transitions. Word has length 224 [2018-11-06 19:49:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:43,063 INFO L480 AbstractCegarLoop]: Abstraction has 3519 states and 3912 transitions. [2018-11-06 19:49:43,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3519 states and 3912 transitions. [2018-11-06 19:49:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-06 19:49:43,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:43,072 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:49:43,072 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:43,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:43,072 INFO L82 PathProgramCache]: Analyzing trace with hash 393301564, now seen corresponding path program 1 times [2018-11-06 19:49:43,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:43,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:43,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:43,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:43,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 216 proven. 27 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-06 19:49:43,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:49:43,304 INFO L225 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-11-06 19:49:43,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:43,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:49:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-06 19:49:43,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:49:43,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-11-06 19:49:43,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 19:49:43,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 19:49:43,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:49:43,675 INFO L87 Difference]: Start difference. First operand 3519 states and 3912 transitions. Second operand 8 states. [2018-11-06 19:49:49,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:49,198 INFO L93 Difference]: Finished difference Result 6986 states and 7770 transitions. [2018-11-06 19:49:49,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 19:49:49,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 254 [2018-11-06 19:49:49,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:49,200 INFO L225 Difference]: With dead ends: 6986 [2018-11-06 19:49:49,200 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:49:49,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:49:49,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:49:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:49:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:49:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:49:49,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2018-11-06 19:49:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:49,207 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:49:49,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 19:49:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:49:49,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:49:49,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:49:50,134 WARN L179 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-11-06 19:49:50,225 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-06 19:49:50,225 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-06 19:49:50,225 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,225 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,225 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,225 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,226 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,226 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,226 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-06 19:49:50,226 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-06 19:49:50,226 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-06 19:49:50,226 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-06 19:49:50,226 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-06 19:49:50,226 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-06 19:49:50,226 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-06 19:49:50,227 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-06 19:49:50,227 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-06 19:49:50,227 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-06 19:49:50,227 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,227 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,227 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,227 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,228 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,228 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,228 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-06 19:49:50,228 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-06 19:49:50,228 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-06 19:49:50,228 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-06 19:49:50,228 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-06 19:49:50,229 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-06 19:49:50,229 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-06 19:49:50,229 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-06 19:49:50,229 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-06 19:49:50,229 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-06 19:49:50,229 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-06 19:49:50,229 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-06 19:49:50,230 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-06 19:49:50,230 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-06 19:49:50,230 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-06 19:49:50,230 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,230 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,230 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,231 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,231 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,231 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-06 19:49:50,231 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-06 19:49:50,231 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-06 19:49:50,231 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-06 19:49:50,231 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-06 19:49:50,231 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-06 19:49:50,232 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-06 19:49:50,232 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-06 19:49:50,232 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-06 19:49:50,232 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a7~0 1)) (.cse3 (= ~a17~0 1)) (.cse2 (= ~a20~0 1)) (.cse0 (= ~a21~0 1))) (or (and (= ~a8~0 15) .cse0) (and .cse1 .cse0 .cse2) (and .cse1 .cse3 .cse0) (and .cse0 (= ~a16~0 5)) (and .cse1 (<= ~a21~0 0)) (and .cse3 .cse0 .cse2) (and (= ~a16~0 4) .cse0))) [2018-11-06 19:49:50,233 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,233 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,233 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,233 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,233 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,233 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-06 19:49:50,234 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-06 19:49:50,234 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-06 19:49:50,234 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-06 19:49:50,234 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-06 19:49:50,234 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-06 19:49:50,234 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-06 19:49:50,234 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-06 19:49:50,235 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-06 19:49:50,235 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-06 19:49:50,235 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-06 19:49:50,235 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-06 19:49:50,235 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-06 19:49:50,235 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-11-06 19:49:50,235 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,235 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,236 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,236 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,236 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,236 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-06 19:49:50,236 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-06 19:49:50,236 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-06 19:49:50,236 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-06 19:49:50,236 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-06 19:49:50,237 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-06 19:49:50,237 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-06 19:49:50,237 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-06 19:49:50,237 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-06 19:49:50,237 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,237 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,237 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,237 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,238 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,238 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-06 19:49:50,238 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-06 19:49:50,238 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-06 19:49:50,238 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-06 19:49:50,238 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-06 19:49:50,238 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-06 19:49:50,239 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-06 19:49:50,239 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-06 19:49:50,239 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:49:50,239 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-06 19:49:50,239 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-06 19:49:50,239 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-06 19:49:50,239 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-06 19:49:50,240 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-06 19:49:50,240 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-06 19:49:50,240 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-06 19:49:50,240 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,240 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,240 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,240 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a7~0 1)) (.cse3 (= ~a17~0 1)) (.cse2 (= ~a20~0 1)) (.cse0 (= ~a21~0 1))) (or (and (= ~a8~0 15) .cse0) (and .cse1 .cse0 .cse2) (and .cse1 .cse3 .cse0) (and .cse0 (= ~a16~0 5)) (and .cse1 (<= ~a21~0 0)) (and .cse3 .cse0 .cse2) (and (= ~a16~0 4) .cse0))) [2018-11-06 19:49:50,240 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,241 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,241 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-06 19:49:50,241 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-06 19:49:50,241 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-06 19:49:50,241 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-06 19:49:50,241 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-06 19:49:50,241 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-06 19:49:50,242 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-06 19:49:50,242 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-06 19:49:50,242 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,242 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,242 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,242 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,242 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,242 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-06 19:49:50,243 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:49:50,243 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-06 19:49:50,243 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-06 19:49:50,243 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-06 19:49:50,243 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-06 19:49:50,243 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-06 19:49:50,243 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-06 19:49:50,243 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-06 19:49:50,243 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-06 19:49:50,243 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-06 19:49:50,243 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-06 19:49:50,244 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-06 19:49:50,244 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,244 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,244 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,244 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,244 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,244 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-06 19:49:50,244 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,244 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-06 19:49:50,244 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-06 19:49:50,244 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:49:50,245 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-06 19:49:50,245 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-06 19:49:50,245 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-06 19:49:50,245 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-06 19:49:50,245 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-06 19:49:50,245 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-06 19:49:50,245 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-06 19:49:50,245 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-06 19:49:50,245 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-06 19:49:50,245 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-06 19:49:50,246 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 557) no Hoare annotation was computed. [2018-11-06 19:49:50,246 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,246 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,246 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,246 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,246 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,246 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,246 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-06 19:49:50,247 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-06 19:49:50,247 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-06 19:49:50,247 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-06 19:49:50,247 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-06 19:49:50,247 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-06 19:49:50,247 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-06 19:49:50,247 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-06 19:49:50,248 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-06 19:49:50,248 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-06 19:49:50,248 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-06 19:49:50,248 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-06 19:49:50,248 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:49:50,248 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-06 19:49:50,248 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-06 19:49:50,248 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-06 19:49:50,249 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,249 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,249 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,249 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,249 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,249 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:50,249 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-06 19:49:50,249 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-06 19:49:50,249 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-06 19:49:50,250 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-06 19:49:50,250 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-06 19:49:50,250 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-06 19:49:50,250 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-06 19:49:50,250 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-06 19:49:50,250 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-06 19:49:50,250 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-06 19:49:50,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:49:50 BoogieIcfgContainer [2018-11-06 19:49:50,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:49:50,270 INFO L168 Benchmark]: Toolchain (without parser) took 27636.56 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -238.7 MB). Peak memory consumption was 834.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:50,271 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:49:50,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:50,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 184.07 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:50,274 INFO L168 Benchmark]: Boogie Preprocessor took 63.12 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:50,275 INFO L168 Benchmark]: RCFGBuilder took 3407.96 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 114.9 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:50,275 INFO L168 Benchmark]: TraceAbstraction took 23262.28 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 369.1 MB). Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 381.9 MB). Peak memory consumption was 751.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:50,281 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 714.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 184.07 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.12 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3407.96 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 114.9 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23262.28 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 369.1 MB). Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 381.9 MB). Peak memory consumption was 751.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 557]: 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: 583]: Loop Invariant Derived loop invariant: ((((((a8 == 15 && a21 == 1) || ((a7 == 1 && a21 == 1) && a20 == 1)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || (a21 == 1 && a16 == 5)) || (a7 == 1 && a21 <= 0)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (a16 == 4 && a21 == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((a8 == 15 && a21 == 1) || ((a7 == 1 && a21 == 1) && a20 == 1)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || (a21 == 1 && a16 == 5)) || (a7 == 1 && a21 <= 0)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (a16 == 4 && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 23.1s OverallTime, 9 OverallIterations, 6 TraceHistogramMax, 17.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1337 SDtfs, 3143 SDslu, 551 SDs, 0 SdLazy, 5566 SolverSat, 1267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3519occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 132 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 94 NumberOfFragments, 119 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1179 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1899 NumberOfCodeBlocks, 1899 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1889 ConstructedInterpolants, 0 QuantifiedInterpolants, 1055052 SizeOfPredicates, 1 NumberOfNonLiveVariables, 453 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1350/1377 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...