java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:00:10,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:00:10,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:00:11,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:00:11,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:00:11,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:00:11,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:00:11,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:00:11,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:00:11,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:00:11,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:00:11,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:00:11,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:00:11,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:00:11,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:00:11,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:00:11,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:00:11,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:00:11,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:00:11,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:00:11,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:00:11,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:00:11,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:00:11,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:00:11,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:00:11,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:00:11,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:00:11,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:00:11,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:00:11,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:00:11,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:00:11,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:00:11,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:00:11,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:00:11,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:00:11,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:00:11,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:00:11,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:00:11,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:00:11,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:00:11,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:00:11,046 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 12:00:11,065 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:00:11,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:00:11,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 12:00:11,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 12:00:11,067 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 12:00:11,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:00:11,067 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:00:11,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 12:00:11,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:00:11,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:00:11,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:00:11,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:00:11,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:00:11,068 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:00:11,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:00:11,069 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 12:00:11,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:00:11,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:00:11,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:00:11,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 12:00:11,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 12:00:11,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:00:11,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:00:11,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:00:11,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 12:00:11,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 12:00:11,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:00:11,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:00:11,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 12:00:11,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:00:11,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:00:11,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:00:11,115 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:00:11,116 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:00:11,116 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-09-05 12:00:11,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd313406/cfdcde514dca497aa6634ffdc482fb7b/FLAG666bdf022 [2019-09-05 12:00:11,589 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:00:11,591 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-09-05 12:00:11,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd313406/cfdcde514dca497aa6634ffdc482fb7b/FLAG666bdf022 [2019-09-05 12:00:11,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd313406/cfdcde514dca497aa6634ffdc482fb7b [2019-09-05 12:00:12,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:00:12,005 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:00:12,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:00:12,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:00:12,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:00:12,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:00:11" (1/1) ... [2019-09-05 12:00:12,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3959b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:12, skipping insertion in model container [2019-09-05 12:00:12,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:00:11" (1/1) ... [2019-09-05 12:00:12,020 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:00:12,038 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:00:12,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:00:12,212 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:00:12,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:00:12,240 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:00:12,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:12 WrapperNode [2019-09-05 12:00:12,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:00:12,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:00:12,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:00:12,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:00:12,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:12" (1/1) ... [2019-09-05 12:00:12,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:12" (1/1) ... [2019-09-05 12:00:12,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:12" (1/1) ... [2019-09-05 12:00:12,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:12" (1/1) ... [2019-09-05 12:00:12,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:12" (1/1) ... [2019-09-05 12:00:12,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:12" (1/1) ... [2019-09-05 12:00:12,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:12" (1/1) ... [2019-09-05 12:00:12,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:00:12,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:00:12,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:00:12,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:00:12,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:00:12,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:00:12,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:00:12,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:00:12,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:00:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:00:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 12:00:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:00:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 12:00:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:00:12,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:00:12,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:00:12,653 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:00:12,654 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 12:00:12,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:00:12 BoogieIcfgContainer [2019-09-05 12:00:12,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:00:12,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:00:12,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:00:12,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:00:12,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:00:11" (1/3) ... [2019-09-05 12:00:12,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777bc1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:00:12, skipping insertion in model container [2019-09-05 12:00:12,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:12" (2/3) ... [2019-09-05 12:00:12,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777bc1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:00:12, skipping insertion in model container [2019-09-05 12:00:12,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:00:12" (3/3) ... [2019-09-05 12:00:12,669 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-09-05 12:00:12,679 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:00:12,687 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:00:12,718 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:00:12,745 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 12:00:12,746 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:00:12,746 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 12:00:12,746 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:00:12,746 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:00:12,746 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:00:12,746 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:00:12,747 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:00:12,747 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:00:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-05 12:00:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:00:12,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:12,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:12,772 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:12,776 INFO L82 PathProgramCache]: Analyzing trace with hash -584482135, now seen corresponding path program 1 times [2019-09-05 12:00:12,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:12,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:12,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:12,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:12,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:12,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:00:12,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 12:00:12,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:00:12,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:00:12,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:00:12,903 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-09-05 12:00:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:12,927 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2019-09-05 12:00:12,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:00:12,929 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-05 12:00:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:12,939 INFO L225 Difference]: With dead ends: 61 [2019-09-05 12:00:12,939 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 12:00:12,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:00:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 12:00:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-05 12:00:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 12:00:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-09-05 12:00:12,988 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2019-09-05 12:00:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:12,989 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-09-05 12:00:12,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:00:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-09-05 12:00:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 12:00:12,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:12,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:12,992 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:12,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:12,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1528524609, now seen corresponding path program 1 times [2019-09-05 12:00:12,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:12,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:12,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:12,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:12,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:13,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:00:13,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:00:13,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:00:13,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:00:13,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:00:13,107 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2019-09-05 12:00:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:13,221 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-09-05 12:00:13,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:00:13,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 12:00:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:13,223 INFO L225 Difference]: With dead ends: 35 [2019-09-05 12:00:13,223 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 12:00:13,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:00:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 12:00:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 12:00:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 12:00:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-09-05 12:00:13,237 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 15 [2019-09-05 12:00:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:13,237 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-09-05 12:00:13,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:00:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-09-05 12:00:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 12:00:13,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:13,239 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:13,240 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:13,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:13,241 INFO L82 PathProgramCache]: Analyzing trace with hash -552299140, now seen corresponding path program 1 times [2019-09-05 12:00:13,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:13,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:13,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:13,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:13,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:13,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:00:13,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 12:00:13,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 12:00:13,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 12:00:13,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:00:13,359 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2019-09-05 12:00:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:13,513 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-09-05 12:00:13,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:00:13,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-05 12:00:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:13,515 INFO L225 Difference]: With dead ends: 48 [2019-09-05 12:00:13,515 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 12:00:13,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:00:13,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 12:00:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-05 12:00:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:00:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-09-05 12:00:13,529 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2019-09-05 12:00:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:13,529 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-09-05 12:00:13,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 12:00:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-09-05 12:00:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 12:00:13,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:13,531 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:13,531 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:13,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:13,532 INFO L82 PathProgramCache]: Analyzing trace with hash -641752059, now seen corresponding path program 1 times [2019-09-05 12:00:13,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:13,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:13,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:13,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:13,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:00:13,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:00:13,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 12:00:13,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 12:00:13,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 12:00:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:00:13,606 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 6 states. [2019-09-05 12:00:13,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:13,706 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-09-05 12:00:13,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:00:13,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-05 12:00:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:13,708 INFO L225 Difference]: With dead ends: 55 [2019-09-05 12:00:13,708 INFO L226 Difference]: Without dead ends: 53 [2019-09-05 12:00:13,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:00:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-05 12:00:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-09-05 12:00:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 12:00:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2019-09-05 12:00:13,721 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 28 [2019-09-05 12:00:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:13,722 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-09-05 12:00:13,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 12:00:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2019-09-05 12:00:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 12:00:13,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:13,724 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:13,724 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash 7477945, now seen corresponding path program 1 times [2019-09-05 12:00:13,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:13,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:13,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:13,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:13,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 12:00:13,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:00:13,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 12:00:13,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:00:13,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:00:13,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:00:13,806 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 7 states. [2019-09-05 12:00:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:14,015 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2019-09-05 12:00:14,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:00:14,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-05 12:00:14,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:14,018 INFO L225 Difference]: With dead ends: 70 [2019-09-05 12:00:14,018 INFO L226 Difference]: Without dead ends: 63 [2019-09-05 12:00:14,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:00:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-05 12:00:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-09-05 12:00:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-05 12:00:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-09-05 12:00:14,031 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2019-09-05 12:00:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:14,032 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-09-05 12:00:14,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:00:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-09-05 12:00:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 12:00:14,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:14,033 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:14,033 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1583771254, now seen corresponding path program 1 times [2019-09-05 12:00:14,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:14,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:14,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:14,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:14,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 12:00:14,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:00:14,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-05 12:00:14,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 12:00:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 12:00:14,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:00:14,119 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2019-09-05 12:00:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:14,297 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2019-09-05 12:00:14,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 12:00:14,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-09-05 12:00:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:14,299 INFO L225 Difference]: With dead ends: 72 [2019-09-05 12:00:14,299 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 12:00:14,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:00:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 12:00:14,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-09-05 12:00:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 12:00:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-09-05 12:00:14,324 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 33 [2019-09-05 12:00:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:14,324 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-09-05 12:00:14,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 12:00:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-09-05 12:00:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 12:00:14,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:14,331 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2019-09-05 12:00:14,332 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:14,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash 199583202, now seen corresponding path program 1 times [2019-09-05 12:00:14,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:14,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:14,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:14,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:14,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 12:00:14,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:14,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:00:14,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:14,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 12:00:14,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:14,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-05 12:00:14,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:14,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2019-09-05 12:00:14,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:00:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:00:14,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-05 12:00:14,787 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 16 states. [2019-09-05 12:00:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:15,462 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2019-09-05 12:00:15,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:00:15,463 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-09-05 12:00:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:15,466 INFO L225 Difference]: With dead ends: 111 [2019-09-05 12:00:15,467 INFO L226 Difference]: Without dead ends: 96 [2019-09-05 12:00:15,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2019-09-05 12:00:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-05 12:00:15,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-09-05 12:00:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-05 12:00:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2019-09-05 12:00:15,483 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 56 [2019-09-05 12:00:15,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:15,483 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2019-09-05 12:00:15,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:00:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2019-09-05 12:00:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 12:00:15,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:15,485 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:15,486 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:15,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:15,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1513329503, now seen corresponding path program 1 times [2019-09-05 12:00:15,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:15,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:15,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:15,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:15,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 12:00:15,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:15,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:15,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:15,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 12:00:15,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:15,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 12:00:15,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:15,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-09-05 12:00:15,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 12:00:15,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 12:00:15,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-05 12:00:15,725 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 14 states. [2019-09-05 12:00:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:15,926 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2019-09-05 12:00:15,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 12:00:15,926 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-09-05 12:00:15,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:15,928 INFO L225 Difference]: With dead ends: 97 [2019-09-05 12:00:15,928 INFO L226 Difference]: Without dead ends: 95 [2019-09-05 12:00:15,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:00:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-05 12:00:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-05 12:00:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-05 12:00:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2019-09-05 12:00:15,941 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 58 [2019-09-05 12:00:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:15,942 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2019-09-05 12:00:15,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 12:00:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2019-09-05 12:00:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-05 12:00:15,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:15,944 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:15,944 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:15,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1920756074, now seen corresponding path program 2 times [2019-09-05 12:00:15,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:15,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:15,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:15,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:15,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-05 12:00:16,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:16,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:00:16,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:16,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:16,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:16,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 12:00:16,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:16,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:00:16,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:16,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-09-05 12:00:16,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 12:00:16,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 12:00:16,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:00:16,483 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 23 states. [2019-09-05 12:00:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:17,297 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2019-09-05 12:00:17,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 12:00:17,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2019-09-05 12:00:17,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:17,300 INFO L225 Difference]: With dead ends: 116 [2019-09-05 12:00:17,300 INFO L226 Difference]: Without dead ends: 114 [2019-09-05 12:00:17,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 12:00:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-05 12:00:17,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2019-09-05 12:00:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-05 12:00:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2019-09-05 12:00:17,314 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 83 [2019-09-05 12:00:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:17,315 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2019-09-05 12:00:17,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 12:00:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2019-09-05 12:00:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-05 12:00:17,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:17,317 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:17,318 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:17,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:17,318 INFO L82 PathProgramCache]: Analyzing trace with hash -357754430, now seen corresponding path program 2 times [2019-09-05 12:00:17,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:17,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:17,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:17,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:17,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-09-05 12:00:17,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:17,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:17,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:00:17,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:17,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:17,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 12:00:17,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:17,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-05 12:00:17,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:17,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2019-09-05 12:00:17,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 12:00:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 12:00:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:00:17,772 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 21 states. [2019-09-05 12:00:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:18,354 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-09-05 12:00:18,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 12:00:18,355 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-09-05 12:00:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:18,356 INFO L225 Difference]: With dead ends: 109 [2019-09-05 12:00:18,357 INFO L226 Difference]: Without dead ends: 100 [2019-09-05 12:00:18,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2019-09-05 12:00:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-05 12:00:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-09-05 12:00:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-05 12:00:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-09-05 12:00:18,367 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 106 [2019-09-05 12:00:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:18,368 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-09-05 12:00:18,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 12:00:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-09-05 12:00:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-05 12:00:18,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:18,370 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:18,370 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1512190145, now seen corresponding path program 3 times [2019-09-05 12:00:18,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:18,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:18,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:18,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:18,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2019-09-05 12:00:18,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:18,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:00:18,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:18,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 12:00:18,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:18,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 12:00:18,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:18,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 100 proven. 62 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:00:19,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:19,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2019-09-05 12:00:19,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 12:00:19,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 12:00:19,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:00:19,036 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 28 states. [2019-09-05 12:00:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:20,229 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-09-05 12:00:20,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 12:00:20,229 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 108 [2019-09-05 12:00:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:20,230 INFO L225 Difference]: With dead ends: 119 [2019-09-05 12:00:20,230 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 12:00:20,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=390, Invalid=1866, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 12:00:20,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 12:00:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 12:00:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 12:00:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 12:00:20,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2019-09-05 12:00:20,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:20,234 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 12:00:20,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 12:00:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 12:00:20,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 12:00:20,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 12:00:20,545 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-05 12:00:20,799 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-09-05 12:00:20,992 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-09-05 12:00:21,202 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-09-05 12:00:21,322 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-09-05 12:00:21,325 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-05 12:00:21,325 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 12:00:21,325 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 12:00:21,325 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 12:00:21,325 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 12:00:21,326 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 12:00:21,326 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse4 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~buf~0 main_~buflim~0)) (.cse2 (< main_~bufferlen~0 main_~inlen~0)) (.cse3 (= main_~bufferlen~0 (+ main_~buflim~0 2)))) (or (and .cse0 .cse1 (<= main_~in~0 1) .cse2 .cse3 (<= 1 main_~buf~0)) (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse1 .cse3 .cse4 (= main_~buf~0 0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse3 (<= 3 main_~buf~0) .cse0 .cse4 .cse1) (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 (<= 2 main_~buf~0)))) [2019-09-05 12:00:21,328 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse4 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~buf~0 main_~buflim~0)) (.cse2 (< main_~bufferlen~0 main_~inlen~0)) (.cse3 (= main_~bufferlen~0 (+ main_~buflim~0 2)))) (or (and .cse0 .cse1 (<= main_~in~0 1) .cse2 .cse3 (<= 1 main_~buf~0)) (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse1 .cse3 .cse4 (= main_~buf~0 0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse3 (<= 3 main_~buf~0) .cse0 .cse4 .cse1) (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 (<= 2 main_~buf~0)))) [2019-09-05 12:00:21,328 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2019-09-05 12:00:21,328 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-09-05 12:00:21,328 INFO L439 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-09-05 12:00:21,328 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-09-05 12:00:21,328 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-09-05 12:00:21,329 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse3 (< main_~bufferlen~0 main_~inlen~0)) (.cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse0 (<= 3 main_~buf~0) .cse1 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) .cse2) (and .cse1 .cse3 (<= main_~in~0 2) .cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and .cse1 (<= main_~in~0 1) .cse3 .cse0 (<= 1 main_~buf~0) .cse2))) [2019-09-05 12:00:21,329 INFO L439 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse3 (< main_~bufferlen~0 main_~inlen~0)) (.cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse0 (<= 3 main_~buf~0) .cse1 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) .cse2) (and .cse1 .cse3 (<= main_~in~0 2) .cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and .cse1 (<= main_~in~0 1) .cse3 .cse0 (<= 1 main_~buf~0) .cse2))) [2019-09-05 12:00:21,329 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-05 12:00:21,329 INFO L446 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-09-05 12:00:21,330 INFO L439 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse3 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~bufferlen~0 main_~inlen~0)) (.cse2 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse4 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and .cse0 .cse1 (<= main_~in~0 2) .cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse2 (<= 3 main_~buf~0) .cse0 .cse3 .cse4) (and .cse2 (<= 0 main_~in~0) .cse3 (<= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 (<= main_~in~0 1) .cse1 .cse2 (<= 1 main_~buf~0) .cse4))) [2019-09-05 12:00:21,330 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-09-05 12:00:21,330 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-09-05 12:00:21,330 INFO L443 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-09-05 12:00:21,330 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2019-09-05 12:00:21,331 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-09-05 12:00:21,331 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-09-05 12:00:21,331 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-09-05 12:00:21,331 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2019-09-05 12:00:21,331 INFO L443 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-09-05 12:00:21,331 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-05 12:00:21,332 INFO L439 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-09-05 12:00:21,332 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-05 12:00:21,332 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-05 12:00:21,332 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-05 12:00:21,333 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-05 12:00:21,333 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-05 12:00:21,333 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-05 12:00:21,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 12:00:21 BoogieIcfgContainer [2019-09-05 12:00:21,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 12:00:21,360 INFO L168 Benchmark]: Toolchain (without parser) took 9353.44 ms. Allocated memory was 133.2 MB in the beginning and 340.8 MB in the end (delta: 207.6 MB). Free memory was 89.1 MB in the beginning and 204.7 MB in the end (delta: -115.6 MB). Peak memory consumption was 212.3 MB. Max. memory is 7.1 GB. [2019-09-05 12:00:21,361 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 12:00:21,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.31 ms. Allocated memory is still 133.2 MB. Free memory was 88.9 MB in the beginning and 79.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-05 12:00:21,370 INFO L168 Benchmark]: Boogie Preprocessor took 114.96 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 79.4 MB in the beginning and 176.2 MB in the end (delta: -96.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2019-09-05 12:00:21,370 INFO L168 Benchmark]: RCFGBuilder took 299.75 ms. Allocated memory is still 199.8 MB. Free memory was 176.2 MB in the beginning and 162.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-09-05 12:00:21,372 INFO L168 Benchmark]: TraceAbstraction took 8700.08 ms. Allocated memory was 199.8 MB in the beginning and 340.8 MB in the end (delta: 141.0 MB). Free memory was 162.4 MB in the beginning and 204.7 MB in the end (delta: -42.2 MB). Peak memory consumption was 219.1 MB. Max. memory is 7.1 GB. [2019-09-05 12:00:21,383 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 234.31 ms. Allocated memory is still 133.2 MB. Free memory was 88.9 MB in the beginning and 79.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.96 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 79.4 MB in the beginning and 176.2 MB in the end (delta: -96.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 299.75 ms. Allocated memory is still 199.8 MB. Free memory was 176.2 MB in the beginning and 162.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8700.08 ms. Allocated memory was 199.8 MB in the beginning and 340.8 MB in the end (delta: 141.0 MB). Free memory was 162.4 MB in the beginning and 204.7 MB in the end (delta: -42.2 MB). Peak memory consumption was 219.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 23]: Loop Invariant Derived loop invariant: (((((((1 <= in && bufferlen < inlen) && in <= 2) && bufferlen == buflim + 2) && buf + 2 <= bufferlen) && 2 <= buf) || (((((bufferlen + 1 <= inlen && bufferlen == buflim + 2) && 3 <= buf) && 1 <= in) && in + buflim + 3 <= buf + inlen) && buf < buflim + 1)) || (((((bufferlen == buflim + 2 && 0 <= in) && in + buflim + 3 <= buf + inlen) && in <= 0) && buf == 0) && 2 <= bufferlen)) || (((((1 <= in && in <= 1) && bufferlen < inlen) && bufferlen == buflim + 2) && 1 <= buf) && buf < buflim + 1) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. SAFE Result, 8.5s OverallTime, 11 OverallIterations, 16 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 418 SDtfs, 472 SDslu, 2312 SDs, 0 SdLazy, 2289 SolverSat, 630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 568 GetRequests, 377 SyntacticMatches, 7 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 30 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 64 PreInvPairs, 113 NumberOfFragments, 513 HoareAnnotationTreeSize, 64 FomulaSimplifications, 1000 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1510 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 963 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 947 ConstructedInterpolants, 0 QuantifiedInterpolants, 291238 SizeOfPredicates, 25 NumberOfNonLiveVariables, 782 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 2703/2972 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...