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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:53:29,775 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:53:29,777 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:53:29,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:53:29,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:53:29,796 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:53:29,797 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:53:29,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:53:29,801 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:53:29,802 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:53:29,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:53:29,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:53:29,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:53:29,805 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:53:29,806 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:53:29,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:53:29,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:53:29,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:53:29,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:53:29,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:53:29,814 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:53:29,816 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:53:29,818 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:53:29,818 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:53:29,818 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:53:29,819 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:53:29,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:53:29,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:53:29,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:53:29,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:53:29,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:53:29,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:53:29,824 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:53:29,824 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:53:29,825 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:53:29,826 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:53:29,826 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:53:29,842 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:53:29,842 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:53:29,843 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:53:29,843 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:53:29,843 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:53:29,844 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:53:29,844 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:53:29,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:53:29,844 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:53:29,844 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:53:29,845 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:53:29,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:53:29,845 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:53:29,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:53:29,845 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:53:29,846 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:53:29,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:53:29,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:53:29,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:53:29,846 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:53:29,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:53:29,847 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:53:29,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:53:29,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:53:29,847 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:53:29,847 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:53:29,848 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:53:29,848 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:53:29,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:53:29,848 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:53:29,850 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:53:29,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:53:29,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:53:29,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:53:29,935 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:53:29,936 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:53:29,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl [2018-09-26 21:53:29,937 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl' [2018-09-26 21:53:30,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:53:30,031 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:53:30,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:30,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:53:30,032 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:53:30,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:30" (1/1) ... [2018-09-26 21:53:30,068 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:30" (1/1) ... [2018-09-26 21:53:30,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:30,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:53:30,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:53:30,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:53:30,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:30" (1/1) ... [2018-09-26 21:53:30,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:30" (1/1) ... [2018-09-26 21:53:30,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:30" (1/1) ... [2018-09-26 21:53:30,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:30" (1/1) ... [2018-09-26 21:53:30,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:30" (1/1) ... [2018-09-26 21:53:30,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:30" (1/1) ... [2018-09-26 21:53:30,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:30" (1/1) ... [2018-09-26 21:53:30,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:53:30,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:53:30,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:53:30,112 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:53:30,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:30" (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-09-26 21:53:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:53:30,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:53:30,859 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:53:30,859 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:53:30 BoogieIcfgContainer [2018-09-26 21:53:30,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:53:30,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:53:30,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:53:30,864 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:53:30,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:30" (1/2) ... [2018-09-26 21:53:30,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4361dc4e and model type s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:53:30, skipping insertion in model container [2018-09-26 21:53:30,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:53:30" (2/2) ... [2018-09-26 21:53:30,868 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil.c_16.bpl [2018-09-26 21:53:30,877 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:53:30,885 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:53:30,929 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:53:30,929 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:53:30,930 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:53:30,930 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:53:30,930 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:53:30,930 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:53:30,930 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:53:30,930 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:53:30,931 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:53:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-09-26 21:53:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:53:30,953 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:30,954 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:30,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:30,963 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:30,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1912595551, now seen corresponding path program 1 times [2018-09-26 21:53:30,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:30,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:31,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:31,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:31,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:31,191 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:31,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:31,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:31,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:31,212 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:31,214 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-09-26 21:53:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:31,718 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. [2018-09-26 21:53:31,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:31,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-26 21:53:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:31,742 INFO L225 Difference]: With dead ends: 33 [2018-09-26 21:53:31,742 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 21:53:31,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 21:53:31,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 21:53:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 21:53:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-09-26 21:53:31,783 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 10 [2018-09-26 21:53:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:31,783 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-09-26 21:53:31,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2018-09-26 21:53:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:53:31,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:31,785 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:31,785 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:31,785 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:31,785 INFO L82 PathProgramCache]: Analyzing trace with hash -694754889, now seen corresponding path program 1 times [2018-09-26 21:53:31,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:31,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:31,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:31,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:31,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:31,916 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:31,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:31,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:31,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:31,918 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:31,918 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 3 states. [2018-09-26 21:53:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:32,257 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2018-09-26 21:53:32,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:32,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-09-26 21:53:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:32,259 INFO L225 Difference]: With dead ends: 37 [2018-09-26 21:53:32,259 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 21:53:32,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:32,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 21:53:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 21:53:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 21:53:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-09-26 21:53:32,273 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 13 [2018-09-26 21:53:32,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:32,273 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-09-26 21:53:32,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-09-26 21:53:32,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:53:32,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:32,276 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:32,277 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:32,277 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:32,277 INFO L82 PathProgramCache]: Analyzing trace with hash 479368949, now seen corresponding path program 1 times [2018-09-26 21:53:32,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:32,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:32,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:32,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:32,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:53:32,398 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:32,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:32,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:32,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:32,402 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:32,403 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-09-26 21:53:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:32,970 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2018-09-26 21:53:32,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:32,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-26 21:53:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:32,972 INFO L225 Difference]: With dead ends: 46 [2018-09-26 21:53:32,972 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 21:53:32,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 21:53:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 21:53:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 21:53:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-09-26 21:53:32,979 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2018-09-26 21:53:32,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:32,979 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-09-26 21:53:32,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-09-26 21:53:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 21:53:32,981 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:32,981 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:32,981 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:32,981 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:32,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2107312679, now seen corresponding path program 1 times [2018-09-26 21:53:32,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:32,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:32,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 21:53:33,050 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:33,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:33,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:33,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:33,051 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:33,052 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-09-26 21:53:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:33,388 INFO L93 Difference]: Finished difference Result 57 states and 81 transitions. [2018-09-26 21:53:33,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:33,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-26 21:53:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:33,390 INFO L225 Difference]: With dead ends: 57 [2018-09-26 21:53:33,390 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 21:53:33,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 21:53:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 21:53:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 21:53:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-09-26 21:53:33,398 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 22 [2018-09-26 21:53:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:33,398 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-09-26 21:53:33,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:33,398 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2018-09-26 21:53:33,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 21:53:33,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:33,400 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:33,400 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:33,400 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:33,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1908478443, now seen corresponding path program 1 times [2018-09-26 21:53:33,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:33,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:33,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:33,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:33,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-26 21:53:33,570 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:33,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:33,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:33,571 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:33,571 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2018-09-26 21:53:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:33,897 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2018-09-26 21:53:33,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:33,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-26 21:53:33,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:33,900 INFO L225 Difference]: With dead ends: 70 [2018-09-26 21:53:33,900 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 21:53:33,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 21:53:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 21:53:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 21:53:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2018-09-26 21:53:33,910 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 28 [2018-09-26 21:53:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:33,910 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-09-26 21:53:33,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2018-09-26 21:53:33,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 21:53:33,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:33,912 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:33,912 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:33,913 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:33,913 INFO L82 PathProgramCache]: Analyzing trace with hash 685039927, now seen corresponding path program 1 times [2018-09-26 21:53:33,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:33,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:33,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:33,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:33,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:53:34,035 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:34,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:34,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:34,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:34,036 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:34,036 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 3 states. [2018-09-26 21:53:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:34,141 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2018-09-26 21:53:34,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:34,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-09-26 21:53:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:34,145 INFO L225 Difference]: With dead ends: 59 [2018-09-26 21:53:34,145 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 21:53:34,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 21:53:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-09-26 21:53:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 21:53:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2018-09-26 21:53:34,155 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 35 [2018-09-26 21:53:34,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:34,155 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2018-09-26 21:53:34,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2018-09-26 21:53:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 21:53:34,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:34,157 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:34,158 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:34,158 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:34,158 INFO L82 PathProgramCache]: Analyzing trace with hash -82130889, now seen corresponding path program 1 times [2018-09-26 21:53:34,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:34,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:34,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:34,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:34,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:53:34,260 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:34,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:34,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:34,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:34,262 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:34,263 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand 3 states. [2018-09-26 21:53:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:34,470 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2018-09-26 21:53:34,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:34,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-26 21:53:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:34,473 INFO L225 Difference]: With dead ends: 111 [2018-09-26 21:53:34,474 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 21:53:34,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 21:53:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 21:53:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 21:53:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2018-09-26 21:53:34,485 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 44 [2018-09-26 21:53:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:34,486 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2018-09-26 21:53:34,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2018-09-26 21:53:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 21:53:34,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:34,488 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:34,488 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:34,488 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:34,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1942977721, now seen corresponding path program 1 times [2018-09-26 21:53:34,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:34,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:34,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-26 21:53:34,602 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:34,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:34,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:34,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:34,603 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:34,604 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand 3 states. [2018-09-26 21:53:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:34,857 INFO L93 Difference]: Finished difference Result 143 states and 203 transitions. [2018-09-26 21:53:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:34,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-09-26 21:53:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:34,860 INFO L225 Difference]: With dead ends: 143 [2018-09-26 21:53:34,860 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 21:53:34,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 21:53:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 21:53:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 21:53:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-09-26 21:53:34,875 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 53 [2018-09-26 21:53:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:34,875 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-09-26 21:53:34,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-09-26 21:53:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 21:53:34,878 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:34,878 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:34,878 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:34,879 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:34,879 INFO L82 PathProgramCache]: Analyzing trace with hash 138737266, now seen corresponding path program 1 times [2018-09-26 21:53:34,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:34,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:34,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:34,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:34,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-26 21:53:35,004 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:35,004 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:35,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:35,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:35,005 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:35,005 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-09-26 21:53:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:35,292 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2018-09-26 21:53:35,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:35,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-26 21:53:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:35,295 INFO L225 Difference]: With dead ends: 177 [2018-09-26 21:53:35,295 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 21:53:35,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 21:53:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 21:53:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 21:53:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2018-09-26 21:53:35,322 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 65 [2018-09-26 21:53:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:35,322 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2018-09-26 21:53:35,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2018-09-26 21:53:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 21:53:35,326 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:35,326 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:35,328 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:35,329 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:35,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1273491131, now seen corresponding path program 1 times [2018-09-26 21:53:35,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:35,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:35,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:35,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:35,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-09-26 21:53:35,449 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:35,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:35,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:35,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:35,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:35,451 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 3 states. [2018-09-26 21:53:36,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:36,181 INFO L93 Difference]: Finished difference Result 209 states and 267 transitions. [2018-09-26 21:53:36,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:36,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-09-26 21:53:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:36,185 INFO L225 Difference]: With dead ends: 209 [2018-09-26 21:53:36,185 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 21:53:36,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 21:53:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 21:53:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 21:53:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2018-09-26 21:53:36,202 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 75 [2018-09-26 21:53:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:36,203 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2018-09-26 21:53:36,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2018-09-26 21:53:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 21:53:36,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:36,205 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:36,205 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:36,206 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:36,206 INFO L82 PathProgramCache]: Analyzing trace with hash 739368033, now seen corresponding path program 1 times [2018-09-26 21:53:36,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:36,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:36,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:36,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:36,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-09-26 21:53:36,329 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:36,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:36,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:36,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:36,330 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:36,330 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 3 states. [2018-09-26 21:53:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:36,912 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2018-09-26 21:53:36,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:36,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-09-26 21:53:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:36,915 INFO L225 Difference]: With dead ends: 255 [2018-09-26 21:53:36,915 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 21:53:36,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 21:53:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 21:53:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 21:53:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2018-09-26 21:53:36,934 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 86 [2018-09-26 21:53:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:36,938 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2018-09-26 21:53:36,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2018-09-26 21:53:36,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 21:53:36,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:36,940 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:36,940 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:36,941 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1128890468, now seen corresponding path program 1 times [2018-09-26 21:53:36,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:36,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:36,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:36,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:36,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-09-26 21:53:37,190 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:53:37,190 INFO L227 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-09-26 21:53:37,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:37,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:53:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-09-26 21:53:38,162 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:53:38,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-26 21:53:38,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:53:38,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:53:38,164 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:38,164 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand 4 states. [2018-09-26 21:53:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:39,590 INFO L93 Difference]: Finished difference Result 387 states and 465 transitions. [2018-09-26 21:53:39,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:53:39,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-09-26 21:53:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:39,591 INFO L225 Difference]: With dead ends: 387 [2018-09-26 21:53:39,592 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:53:39,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:53:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:53:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:53:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:53:39,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2018-09-26 21:53:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:39,596 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:53:39,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:53:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:53:39,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:53:39,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:53:39,946 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-09-26 21:53:40,265 WARN L178 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-09-26 21:53:40,584 WARN L178 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-09-26 21:53:40,871 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-09-26 21:53:41,012 INFO L422 ceAbstractionStarter]: At program point L353(lines 353 368) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,012 INFO L422 ceAbstractionStarter]: At program point L420(lines 417 434) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,013 INFO L422 ceAbstractionStarter]: At program point L383(lines 383 410) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,013 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 486) no Hoare annotation was computed. [2018-09-26 21:53:41,013 INFO L422 ceAbstractionStarter]: At program point L317(lines 317 332) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,013 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 486) no Hoare annotation was computed. [2018-09-26 21:53:41,013 INFO L422 ceAbstractionStarter]: At program point L379(lines 379 390) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-09-26 21:53:41,013 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 419) no Hoare annotation was computed. [2018-09-26 21:53:41,013 INFO L422 ceAbstractionStarter]: At program point L371(lines 371 380) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,014 INFO L422 ceAbstractionStarter]: At program point L264(lines 264 288) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,014 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 486) no Hoare annotation was computed. [2018-09-26 21:53:41,014 INFO L422 ceAbstractionStarter]: At program point L335(lines 335 350) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,014 INFO L422 ceAbstractionStarter]: At program point L459(lines 459 476) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,014 INFO L422 ceAbstractionStarter]: At program point L298(lines 259 298) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,014 INFO L422 ceAbstractionStarter]: At program point L294(lines 294 314) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,014 INFO L422 ceAbstractionStarter]: At program point L389(lines 389 418) the Hoare annotation is: false [2018-09-26 21:53:41,015 INFO L422 ceAbstractionStarter]: At program point L439(lines 439 456) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,015 INFO L422 ceAbstractionStarter]: At program point L485(lines 287 485) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:41,027 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:53:41 BoogieIcfgContainer [2018-09-26 21:53:41,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:53:41,028 INFO L168 Benchmark]: Toolchain (without parser) took 10999.71 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 24.1 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 9.4 MB). Peak memory consumption was 33.5 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:41,030 INFO L168 Benchmark]: Boogie PL CUP Parser 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-09-26 21:53:41,030 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.98 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-09-26 21:53:41,031 INFO L168 Benchmark]: Boogie Preprocessor took 35.44 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-09-26 21:53:41,032 INFO L168 Benchmark]: RCFGBuilder took 747.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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-09-26 21:53:41,033 INFO L168 Benchmark]: TraceAbstraction took 10166.29 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 24.1 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -22.3 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:41,039 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser 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. * Boogie Procedure Inliner took 43.98 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. * Boogie Preprocessor took 35.44 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. * RCFGBuilder took 747.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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. * TraceAbstraction took 10166.29 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 24.1 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -22.3 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 419]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 10.0s OverallTime, 12 OverallIterations, 12 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 318 SDtfs, 36 SDslu, 67 SDs, 0 SdLazy, 361 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=11, 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 262 NumberOfFragments, 188 HoareAnnotationTreeSize, 14 FomulaSimplifications, 1789 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 84 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 58057 SizeOfPredicates, 2 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1854/1870 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.c_16.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-53-41-054.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.c_16.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-53-41-054.csv Received shutdown request...