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_label25_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:49:42,800 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:49:42,802 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:49:42,828 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:49:42,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:49:42,832 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:49:42,833 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:49:42,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:49:42,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:49:42,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:49:42,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:49:42,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:49:42,845 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:49:42,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:49:42,849 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:49:42,850 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:49:42,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:49:42,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:49:42,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:49:42,864 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:49:42,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:49:42,870 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:49:42,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:49:42,877 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:49:42,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:49:42,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:49:42,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:49:42,883 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:49:42,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:49:42,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:49:42,887 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:49:42,888 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:49:42,889 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:49:42,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:49:42,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:49:42,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:49:42,892 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:42,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:49:42,924 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:49:42,924 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:49:42,925 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:49:42,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:49:42,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:49:42,926 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:49:42,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:49:42,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:49:42,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:49:42,927 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:49:42,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:49:42,928 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:49:42,929 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:49:42,929 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:49:42,929 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:49:42,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:49:42,930 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:49:42,931 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:49:42,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:49:42,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:49:42,931 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:49:42,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:49:42,931 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:49:42,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:49:42,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:49:42,932 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:49:42,932 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:49:42,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:49:43,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:49:43,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:49:43,019 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:49:43,020 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:49:43,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c [2018-11-06 19:49:43,083 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763b75ec4/b8e2428a57f74198bc640888e3c3759c/FLAG9c1e03699 [2018-11-06 19:49:43,620 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:49:43,621 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c [2018-11-06 19:49:43,640 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763b75ec4/b8e2428a57f74198bc640888e3c3759c/FLAG9c1e03699 [2018-11-06 19:49:43,655 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763b75ec4/b8e2428a57f74198bc640888e3c3759c [2018-11-06 19:49:43,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:49:43,667 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:49:43,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:43,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:49:43,672 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:49:43,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:43" (1/1) ... [2018-11-06 19:49:43,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42126e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:43, skipping insertion in model container [2018-11-06 19:49:43,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:43" (1/1) ... [2018-11-06 19:49:43,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:49:43,746 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:49:44,204 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:44,210 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:49:44,350 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:44,376 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:49:44,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:44 WrapperNode [2018-11-06 19:49:44,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:44,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:44,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:49:44,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:49:44,390 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:44" (1/1) ... [2018-11-06 19:49:44,410 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:44" (1/1) ... [2018-11-06 19:49:44,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:44,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:49:44,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:49:44,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:49:44,579 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:44" (1/1) ... [2018-11-06 19:49:44,580 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:44" (1/1) ... [2018-11-06 19:49:44,584 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:44" (1/1) ... [2018-11-06 19:49:44,585 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:44" (1/1) ... [2018-11-06 19:49:44,615 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:44" (1/1) ... [2018-11-06 19:49:44,643 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:44" (1/1) ... [2018-11-06 19:49:44,655 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:44" (1/1) ... [2018-11-06 19:49:44,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:49:44,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:49:44,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:49:44,674 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:49:44,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:44" (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:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:49:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:49:44,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:49:48,258 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:49:48,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:48 BoogieIcfgContainer [2018-11-06 19:49:48,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:49:48,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:49:48,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:49:48,267 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:49:48,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:49:43" (1/3) ... [2018-11-06 19:49:48,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d127337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:48, skipping insertion in model container [2018-11-06 19:49:48,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:44" (2/3) ... [2018-11-06 19:49:48,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d127337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:48, skipping insertion in model container [2018-11-06 19:49:48,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:48" (3/3) ... [2018-11-06 19:49:48,273 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label25_true-unreach-call_false-termination.c [2018-11-06 19:49:48,284 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:49:48,297 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:49:48,317 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:49:48,365 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:49:48,366 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:49:48,366 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:49:48,366 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:49:48,366 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:49:48,367 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:49:48,367 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:49:48,367 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:49:48,368 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:49:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-11-06 19:49:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-06 19:49:48,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:48,422 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] [2018-11-06 19:49:48,425 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:48,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:48,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1311785071, now seen corresponding path program 1 times [2018-11-06 19:49:48,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:48,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:48,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:48,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:48,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:49,147 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:49,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:49,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:49,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:49,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:49,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:49,180 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-11-06 19:49:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:51,729 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-11-06 19:49:51,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:51,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-11-06 19:49:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:51,754 INFO L225 Difference]: With dead ends: 666 [2018-11-06 19:49:51,755 INFO L226 Difference]: Without dead ends: 460 [2018-11-06 19:49:51,760 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-11-06 19:49:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-11-06 19:49:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-11-06 19:49:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 743 transitions. [2018-11-06 19:49:51,856 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 743 transitions. Word has length 120 [2018-11-06 19:49:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:51,858 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 743 transitions. [2018-11-06 19:49:51,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 743 transitions. [2018-11-06 19:49:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-06 19:49:51,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:51,866 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:51,867 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:51,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:51,867 INFO L82 PathProgramCache]: Analyzing trace with hash -100190616, now seen corresponding path program 1 times [2018-11-06 19:49:51,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:51,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:51,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:51,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:51,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:52,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:52,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:52,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:52,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:52,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:52,073 INFO L87 Difference]: Start difference. First operand 460 states and 743 transitions. Second operand 4 states. [2018-11-06 19:49:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:53,274 INFO L93 Difference]: Finished difference Result 1314 states and 2164 transitions. [2018-11-06 19:49:53,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:53,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-11-06 19:49:53,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:53,282 INFO L225 Difference]: With dead ends: 1314 [2018-11-06 19:49:53,282 INFO L226 Difference]: Without dead ends: 856 [2018-11-06 19:49:53,286 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-06 19:49:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-06 19:49:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-06 19:49:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1279 transitions. [2018-11-06 19:49:53,331 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1279 transitions. Word has length 126 [2018-11-06 19:49:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:53,331 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1279 transitions. [2018-11-06 19:49:53,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1279 transitions. [2018-11-06 19:49:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-06 19:49:53,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:53,336 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,336 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:53,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1866141956, now seen corresponding path program 1 times [2018-11-06 19:49:53,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:53,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-06 19:49:53,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:53,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:53,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:53,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:53,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:53,469 INFO L87 Difference]: Start difference. First operand 856 states and 1279 transitions. Second operand 3 states. [2018-11-06 19:49:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:56,280 INFO L93 Difference]: Finished difference Result 2106 states and 3236 transitions. [2018-11-06 19:49:56,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:56,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-11-06 19:49:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:56,288 INFO L225 Difference]: With dead ends: 2106 [2018-11-06 19:49:56,288 INFO L226 Difference]: Without dead ends: 1252 [2018-11-06 19:49:56,289 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:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-11-06 19:49:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-11-06 19:49:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-11-06 19:49:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1911 transitions. [2018-11-06 19:49:56,323 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1911 transitions. Word has length 134 [2018-11-06 19:49:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:56,324 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 1911 transitions. [2018-11-06 19:49:56,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1911 transitions. [2018-11-06 19:49:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-06 19:49:56,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:56,328 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:56,328 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:56,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:56,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1788471697, now seen corresponding path program 1 times [2018-11-06 19:49:56,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:56,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:56,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:56,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:56,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:56,641 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-06 19:49:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:56,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:56,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:56,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:56,757 INFO L87 Difference]: Start difference. First operand 1252 states and 1911 transitions. Second operand 4 states. [2018-11-06 19:49:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:58,166 INFO L93 Difference]: Finished difference Result 2803 states and 4228 transitions. [2018-11-06 19:49:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:49:58,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-11-06 19:49:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:58,177 INFO L225 Difference]: With dead ends: 2803 [2018-11-06 19:49:58,177 INFO L226 Difference]: Without dead ends: 1553 [2018-11-06 19:49:58,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:49:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2018-11-06 19:49:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1523. [2018-11-06 19:49:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2018-11-06 19:49:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2210 transitions. [2018-11-06 19:49:58,214 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 2210 transitions. Word has length 136 [2018-11-06 19:49:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:58,214 INFO L480 AbstractCegarLoop]: Abstraction has 1523 states and 2210 transitions. [2018-11-06 19:49:58,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2210 transitions. [2018-11-06 19:49:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-06 19:49:58,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:58,218 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:58,219 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:58,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash -859482681, now seen corresponding path program 1 times [2018-11-06 19:49:58,219 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:58,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:58,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:58,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:58,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:58,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:58,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:58,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:58,449 INFO L87 Difference]: Start difference. First operand 1523 states and 2210 transitions. Second operand 4 states. [2018-11-06 19:50:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:00,065 INFO L93 Difference]: Finished difference Result 3968 states and 5819 transitions. [2018-11-06 19:50:00,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:50:00,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-11-06 19:50:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:00,079 INFO L225 Difference]: With dead ends: 3968 [2018-11-06 19:50:00,079 INFO L226 Difference]: Without dead ends: 2447 [2018-11-06 19:50:00,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2018-11-06 19:50:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2429. [2018-11-06 19:50:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2018-11-06 19:50:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 3359 transitions. [2018-11-06 19:50:00,134 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 3359 transitions. Word has length 141 [2018-11-06 19:50:00,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:00,134 INFO L480 AbstractCegarLoop]: Abstraction has 2429 states and 3359 transitions. [2018-11-06 19:50:00,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 3359 transitions. [2018-11-06 19:50:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-06 19:50:00,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:00,141 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:00,141 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:00,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:00,141 INFO L82 PathProgramCache]: Analyzing trace with hash 412427779, now seen corresponding path program 1 times [2018-11-06 19:50:00,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:00,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:00,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:00,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:00,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:00,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:00,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:00,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:00,258 INFO L87 Difference]: Start difference. First operand 2429 states and 3359 transitions. Second operand 3 states. [2018-11-06 19:50:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:01,213 INFO L93 Difference]: Finished difference Result 6427 states and 8768 transitions. [2018-11-06 19:50:01,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:01,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-11-06 19:50:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:01,232 INFO L225 Difference]: With dead ends: 6427 [2018-11-06 19:50:01,232 INFO L226 Difference]: Without dead ends: 3311 [2018-11-06 19:50:01,237 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:50:01,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2018-11-06 19:50:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 3266. [2018-11-06 19:50:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3266 states. [2018-11-06 19:50:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 3890 transitions. [2018-11-06 19:50:01,295 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 3890 transitions. Word has length 144 [2018-11-06 19:50:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:01,296 INFO L480 AbstractCegarLoop]: Abstraction has 3266 states and 3890 transitions. [2018-11-06 19:50:01,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 3890 transitions. [2018-11-06 19:50:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-06 19:50:01,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:01,302 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:01,302 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:01,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:01,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1856829865, now seen corresponding path program 1 times [2018-11-06 19:50:01,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:01,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:01,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:01,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:01,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:50:01,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:01,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:50:01,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:01,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:01,454 INFO L87 Difference]: Start difference. First operand 3266 states and 3890 transitions. Second operand 3 states. [2018-11-06 19:50:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:02,151 INFO L93 Difference]: Finished difference Result 6398 states and 7640 transitions. [2018-11-06 19:50:02,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:02,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2018-11-06 19:50:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:02,164 INFO L225 Difference]: With dead ends: 6398 [2018-11-06 19:50:02,164 INFO L226 Difference]: Without dead ends: 2971 [2018-11-06 19:50:02,169 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:50:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2018-11-06 19:50:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2959. [2018-11-06 19:50:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2018-11-06 19:50:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 3354 transitions. [2018-11-06 19:50:02,235 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 3354 transitions. Word has length 153 [2018-11-06 19:50:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:02,236 INFO L480 AbstractCegarLoop]: Abstraction has 2959 states and 3354 transitions. [2018-11-06 19:50:02,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 3354 transitions. [2018-11-06 19:50:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-06 19:50:02,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:02,241 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:02,242 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:02,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1315205144, now seen corresponding path program 1 times [2018-11-06 19:50:02,242 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:02,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:02,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:02,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:02,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:02,935 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-11-06 19:50:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:03,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:03,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-06 19:50:03,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 19:50:03,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 19:50:03,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:50:03,249 INFO L87 Difference]: Start difference. First operand 2959 states and 3354 transitions. Second operand 12 states. [2018-11-06 19:50:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:07,131 INFO L93 Difference]: Finished difference Result 6952 states and 7886 transitions. [2018-11-06 19:50:07,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 19:50:07,131 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 158 [2018-11-06 19:50:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:07,143 INFO L225 Difference]: With dead ends: 6952 [2018-11-06 19:50:07,143 INFO L226 Difference]: Without dead ends: 3960 [2018-11-06 19:50:07,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-11-06 19:50:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2018-11-06 19:50:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 3771. [2018-11-06 19:50:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3771 states. [2018-11-06 19:50:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 4174 transitions. [2018-11-06 19:50:07,210 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 4174 transitions. Word has length 158 [2018-11-06 19:50:07,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:07,210 INFO L480 AbstractCegarLoop]: Abstraction has 3771 states and 4174 transitions. [2018-11-06 19:50:07,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 19:50:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 4174 transitions. [2018-11-06 19:50:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-06 19:50:07,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:07,218 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:50:07,219 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:07,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1277929841, now seen corresponding path program 1 times [2018-11-06 19:50:07,219 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:07,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:07,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:07,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:07,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-06 19:50:07,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:07,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:07,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:07,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:07,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:07,442 INFO L87 Difference]: Start difference. First operand 3771 states and 4174 transitions. Second operand 3 states. [2018-11-06 19:50:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:08,839 INFO L93 Difference]: Finished difference Result 7008 states and 7794 transitions. [2018-11-06 19:50:08,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:08,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-11-06 19:50:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:08,850 INFO L225 Difference]: With dead ends: 7008 [2018-11-06 19:50:08,850 INFO L226 Difference]: Without dead ends: 3371 [2018-11-06 19:50:08,853 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:50:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2018-11-06 19:50:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3371. [2018-11-06 19:50:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3371 states. [2018-11-06 19:50:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 3371 states and 3738 transitions. [2018-11-06 19:50:08,905 INFO L78 Accepts]: Start accepts. Automaton has 3371 states and 3738 transitions. Word has length 228 [2018-11-06 19:50:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:08,906 INFO L480 AbstractCegarLoop]: Abstraction has 3371 states and 3738 transitions. [2018-11-06 19:50:08,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3371 states and 3738 transitions. [2018-11-06 19:50:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-06 19:50:08,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:08,914 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] [2018-11-06 19:50:08,915 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:08,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:08,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1000979228, now seen corresponding path program 1 times [2018-11-06 19:50:08,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:08,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:08,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:08,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:08,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:09,194 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:50:09,255 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:50:09,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:50:09,256 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:50:09,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:09,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:50:09,621 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:50:09,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:50:09,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-11-06 19:50:09,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 19:50:09,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 19:50:09,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:50:09,657 INFO L87 Difference]: Start difference. First operand 3371 states and 3738 transitions. Second operand 8 states. [2018-11-06 19:50:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:13,030 INFO L93 Difference]: Finished difference Result 6217 states and 6932 transitions. [2018-11-06 19:50:13,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 19:50:13,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 246 [2018-11-06 19:50:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:13,039 INFO L225 Difference]: With dead ends: 6217 [2018-11-06 19:50:13,039 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:50:13,044 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:50:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:50:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:50:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:50:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:50:13,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-11-06 19:50:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:13,045 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:50:13,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 19:50:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:50:13,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:50:13,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:50:13,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:13,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:13,700 WARN L179 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-11-06 19:50:14,047 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-11-06 19:50:14,051 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-06 19:50:14,051 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-06 19:50:14,051 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,051 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,051 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,051 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,051 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,051 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,051 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,052 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-06 19:50:14,053 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-06 19:50:14,054 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-06 19:50:14,054 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-06 19:50:14,054 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-06 19:50:14,054 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-06 19:50:14,054 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,054 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,054 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,054 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,054 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,055 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-06 19:50:14,055 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-06 19:50:14,055 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-06 19:50:14,055 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-06 19:50:14,055 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-06 19:50:14,055 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-06 19:50:14,055 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-06 19:50:14,055 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-06 19:50:14,055 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-06 19:50:14,056 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 533) no Hoare annotation was computed. [2018-11-06 19:50:14,056 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse7 (= ~a12~0 8)) (.cse8 (= ~a20~0 1)) (.cse3 (not .cse6)) (.cse0 (= ~a21~0 1)) (.cse5 (<= ~a21~0 0)) (.cse1 (not (= ~a16~0 6))) (.cse2 (= ~a17~0 1))) (or (and .cse0 (= ~a16~0 5)) (and .cse1 .cse2 .cse0) (and .cse3 .cse4 .cse0) (and .cse5 .cse6 .cse7 .cse8) (and .cse4 .cse1 .cse7 .cse0 .cse8) (and .cse3 .cse2 .cse0) (and (= ~a16~0 4) .cse0) (and .cse6 .cse5 .cse1 .cse2)))) [2018-11-06 19:50:14,056 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,056 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,057 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,057 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,057 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,057 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-06 19:50:14,057 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-06 19:50:14,057 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-06 19:50:14,057 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-06 19:50:14,057 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-06 19:50:14,058 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-06 19:50:14,058 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-06 19:50:14,058 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-06 19:50:14,058 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-06 19:50:14,058 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-06 19:50:14,058 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-06 19:50:14,058 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-06 19:50:14,058 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-06 19:50:14,058 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-11-06 19:50:14,058 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-06 19:50:14,059 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:50:14,060 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-06 19:50:14,061 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-06 19:50:14,061 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-06 19:50:14,061 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-06 19:50:14,061 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-06 19:50:14,061 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-06 19:50:14,061 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-06 19:50:14,061 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,061 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,061 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,061 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse7 (= ~a12~0 8)) (.cse8 (= ~a20~0 1)) (.cse3 (not .cse6)) (.cse0 (= ~a21~0 1)) (.cse5 (<= ~a21~0 0)) (.cse1 (not (= ~a16~0 6))) (.cse2 (= ~a17~0 1))) (or (and .cse0 (= ~a16~0 5)) (and .cse1 .cse2 .cse0) (and .cse3 .cse4 .cse0) (and .cse5 .cse6 .cse7 .cse8) (and .cse4 .cse1 .cse7 .cse0 .cse8) (and .cse3 .cse2 .cse0) (and (= ~a16~0 4) .cse0) (and .cse6 .cse5 .cse1 .cse2)))) [2018-11-06 19:50:14,062 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,062 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,062 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-06 19:50:14,062 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-06 19:50:14,062 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-06 19:50:14,062 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-06 19:50:14,062 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-06 19:50:14,062 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-06 19:50:14,062 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-06 19:50:14,062 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-06 19:50:14,063 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,063 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,063 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,063 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,063 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,063 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-06 19:50:14,063 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:50:14,063 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-06 19:50:14,063 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,064 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,065 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-06 19:50:14,065 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,065 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-06 19:50:14,065 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-06 19:50:14,065 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:50:14,065 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-06 19:50:14,065 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-06 19:50:14,065 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-06 19:50:14,065 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-06 19:50:14,065 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-06 19:50:14,066 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-06 19:50:14,066 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-06 19:50:14,066 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-06 19:50:14,066 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-06 19:50:14,066 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-06 19:50:14,066 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,066 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,066 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,066 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,066 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,067 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,067 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-06 19:50:14,067 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-06 19:50:14,067 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-06 19:50:14,067 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-06 19:50:14,067 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-06 19:50:14,067 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-06 19:50:14,067 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-06 19:50:14,067 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-06 19:50:14,067 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-06 19:50:14,068 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-06 19:50:14,068 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-06 19:50:14,068 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-06 19:50:14,068 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:50:14,068 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-06 19:50:14,068 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-06 19:50:14,068 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-06 19:50:14,068 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,068 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-06 19:50:14,069 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-06 19:50:14,070 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-06 19:50:14,070 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-06 19:50:14,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:50:14 BoogieIcfgContainer [2018-11-06 19:50:14,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:50:14,089 INFO L168 Benchmark]: Toolchain (without parser) took 30423.07 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 2.4 GB in the end (delta: -970.5 MB). Peak memory consumption was 135.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:50:14,091 INFO L168 Benchmark]: CDTParser took 0.22 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:50:14,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.85 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:50:14,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 187.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2018-11-06 19:50:14,093 INFO L168 Benchmark]: Boogie Preprocessor took 106.28 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:50:14,094 INFO L168 Benchmark]: RCFGBuilder took 3587.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:50:14,094 INFO L168 Benchmark]: TraceAbstraction took 25827.07 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 351.8 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -291.5 MB). Peak memory consumption was 60.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:50:14,100 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.22 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 709.85 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 187.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.28 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3587.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25827.07 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 351.8 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -291.5 MB). Peak memory consumption was 60.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: 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: (((((((a21 == 1 && a16 == 5) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((!(a7 == 1) && a8 == 15) && a21 == 1)) || (((a21 <= 0 && a7 == 1) && a12 == 8) && a20 == 1)) || ((((a8 == 15 && !(a16 == 6)) && a12 == 8) && a21 == 1) && a20 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || (a16 == 4 && a21 == 1)) || (((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a17 == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((a21 == 1 && a16 == 5) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((!(a7 == 1) && a8 == 15) && a21 == 1)) || (((a21 <= 0 && a7 == 1) && a12 == 8) && a20 == 1)) || ((((a8 == 15 && !(a16 == 6)) && a12 == 8) && a21 == 1) && a20 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || (a16 == 4 && a21 == 1)) || (((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a17 == 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, 25.7s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 20.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1362 SDtfs, 3226 SDslu, 638 SDs, 0 SdLazy, 6729 SolverSat, 1141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 257 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3771occurred 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.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 294 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 74 NumberOfFragments, 185 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2656 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 52 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1832 NumberOfCodeBlocks, 1832 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1821 ConstructedInterpolants, 0 QuantifiedInterpolants, 1102381 SizeOfPredicates, 1 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 933/960 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...