./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4189574b2550552a572f663e591e000dc3f42b46 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:08:35,047 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:08:35,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:08:35,061 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:08:35,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:08:35,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:08:35,064 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:08:35,066 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:08:35,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:08:35,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:08:35,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:08:35,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:08:35,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:08:35,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:08:35,074 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:08:35,075 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:08:35,075 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:08:35,077 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:08:35,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:08:35,081 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:08:35,082 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:08:35,084 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:08:35,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:08:35,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:08:35,086 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:08:35,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:08:35,089 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:08:35,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:08:35,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:08:35,091 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:08:35,091 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:08:35,092 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:08:35,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:08:35,093 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:08:35,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:08:35,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:08:35,095 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:08:35,110 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:08:35,110 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:08:35,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:08:35,112 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:08:35,112 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:08:35,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:08:35,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:08:35,113 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:08:35,113 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:08:35,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:08:35,113 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:08:35,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:08:35,113 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:08:35,114 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:08:35,114 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:08:35,114 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:08:35,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:08:35,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:08:35,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:08:35,116 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:08:35,117 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:08:35,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:08:35,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:08:35,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:08:35,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:08:35,118 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:08:35,118 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:08:35,118 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:08:35,118 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4189574b2550552a572f663e591e000dc3f42b46 [2018-12-30 16:08:35,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:08:35,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:08:35,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:08:35,191 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:08:35,192 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:08:35,194 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-30 16:08:35,262 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf3cbd6d/4e4f81cfc4004464bc576c7e434ba6a9/FLAG7fc257503 [2018-12-30 16:08:35,733 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:08:35,734 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-30 16:08:35,744 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf3cbd6d/4e4f81cfc4004464bc576c7e434ba6a9/FLAG7fc257503 [2018-12-30 16:08:36,046 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf3cbd6d/4e4f81cfc4004464bc576c7e434ba6a9 [2018-12-30 16:08:36,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:08:36,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:08:36,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:08:36,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:08:36,058 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:08:36,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:08:36" (1/1) ... [2018-12-30 16:08:36,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ae614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36, skipping insertion in model container [2018-12-30 16:08:36,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:08:36" (1/1) ... [2018-12-30 16:08:36,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:08:36,123 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:08:36,441 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:08:36,446 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:08:36,508 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:08:36,536 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:08:36,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36 WrapperNode [2018-12-30 16:08:36,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:08:36,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:08:36,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:08:36,538 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:08:36,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36" (1/1) ... [2018-12-30 16:08:36,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36" (1/1) ... [2018-12-30 16:08:36,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:08:36,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:08:36,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:08:36,682 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:08:36,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36" (1/1) ... [2018-12-30 16:08:36,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36" (1/1) ... [2018-12-30 16:08:36,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36" (1/1) ... [2018-12-30 16:08:36,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36" (1/1) ... [2018-12-30 16:08:36,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36" (1/1) ... [2018-12-30 16:08:36,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36" (1/1) ... [2018-12-30 16:08:36,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36" (1/1) ... [2018-12-30 16:08:36,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:08:36,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:08:36,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:08:36,726 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:08:36,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:08:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:08:36,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:08:36,934 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:08:36,935 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:08:38,005 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:08:38,005 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:08:38,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:38 BoogieIcfgContainer [2018-12-30 16:08:38,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:08:38,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:08:38,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:08:38,011 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:08:38,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:08:36" (1/3) ... [2018-12-30 16:08:38,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31218d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:08:38, skipping insertion in model container [2018-12-30 16:08:38,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:36" (2/3) ... [2018-12-30 16:08:38,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31218d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:08:38, skipping insertion in model container [2018-12-30 16:08:38,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:38" (3/3) ... [2018-12-30 16:08:38,015 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-30 16:08:38,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:08:38,034 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:08:38,051 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:08:38,084 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:08:38,085 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:08:38,085 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:08:38,085 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:08:38,086 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:08:38,086 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:08:38,086 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:08:38,086 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:08:38,086 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:08:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-12-30 16:08:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:08:38,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:38,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:38,120 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:38,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:38,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2018-12-30 16:08:38,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:38,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:38,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:38,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:38,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:38,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:38,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:38,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:38,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:38,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:38,359 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2018-12-30 16:08:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:38,786 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2018-12-30 16:08:38,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:38,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:08:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:38,803 INFO L225 Difference]: With dead ends: 251 [2018-12-30 16:08:38,803 INFO L226 Difference]: Without dead ends: 114 [2018-12-30 16:08:38,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:38,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-30 16:08:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-30 16:08:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-30 16:08:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2018-12-30 16:08:38,858 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2018-12-30 16:08:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:38,859 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2018-12-30 16:08:38,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2018-12-30 16:08:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-30 16:08:38,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:38,861 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:38,861 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:38,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:38,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2018-12-30 16:08:38,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:38,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:38,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:38,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:39,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:39,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:39,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:39,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:39,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:39,012 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2018-12-30 16:08:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:39,714 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2018-12-30 16:08:39,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:39,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-30 16:08:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:39,717 INFO L225 Difference]: With dead ends: 237 [2018-12-30 16:08:39,717 INFO L226 Difference]: Without dead ends: 132 [2018-12-30 16:08:39,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-30 16:08:39,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2018-12-30 16:08:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-30 16:08:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2018-12-30 16:08:39,733 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2018-12-30 16:08:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:39,733 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2018-12-30 16:08:39,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2018-12-30 16:08:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-30 16:08:39,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:39,736 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:39,736 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:39,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2018-12-30 16:08:39,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:39,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:39,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 16:08:39,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:39,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:39,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:39,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:39,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:39,858 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2018-12-30 16:08:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:40,151 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2018-12-30 16:08:40,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:40,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-30 16:08:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:40,156 INFO L225 Difference]: With dead ends: 270 [2018-12-30 16:08:40,156 INFO L226 Difference]: Without dead ends: 150 [2018-12-30 16:08:40,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:40,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-30 16:08:40,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2018-12-30 16:08:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-30 16:08:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2018-12-30 16:08:40,171 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2018-12-30 16:08:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:40,171 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2018-12-30 16:08:40,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2018-12-30 16:08:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-30 16:08:40,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:40,174 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:40,174 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1168366188, now seen corresponding path program 1 times [2018-12-30 16:08:40,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:40,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:40,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:40,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:40,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 16:08:40,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:40,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:40,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:40,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:40,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:40,288 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2018-12-30 16:08:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:40,672 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2018-12-30 16:08:40,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:40,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-30 16:08:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:40,676 INFO L225 Difference]: With dead ends: 334 [2018-12-30 16:08:40,676 INFO L226 Difference]: Without dead ends: 196 [2018-12-30 16:08:40,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-30 16:08:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2018-12-30 16:08:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-30 16:08:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2018-12-30 16:08:40,692 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2018-12-30 16:08:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:40,692 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2018-12-30 16:08:40,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2018-12-30 16:08:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-30 16:08:40,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:40,697 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:40,697 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:40,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:40,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1321162774, now seen corresponding path program 1 times [2018-12-30 16:08:40,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:40,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:40,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:40,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:40,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 16:08:40,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:40,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:40,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:40,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:40,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:40,832 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2018-12-30 16:08:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:41,068 INFO L93 Difference]: Finished difference Result 390 states and 556 transitions. [2018-12-30 16:08:41,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:41,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-30 16:08:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:41,072 INFO L225 Difference]: With dead ends: 390 [2018-12-30 16:08:41,072 INFO L226 Difference]: Without dead ends: 212 [2018-12-30 16:08:41,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-30 16:08:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2018-12-30 16:08:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-30 16:08:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2018-12-30 16:08:41,086 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2018-12-30 16:08:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:41,088 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2018-12-30 16:08:41,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2018-12-30 16:08:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:08:41,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:41,092 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:41,093 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash -136835443, now seen corresponding path program 1 times [2018-12-30 16:08:41,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:41,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:41,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:41,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:41,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-30 16:08:41,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:41,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:41,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:41,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:41,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:41,205 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2018-12-30 16:08:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:41,379 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2018-12-30 16:08:41,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:41,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:08:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:41,382 INFO L225 Difference]: With dead ends: 427 [2018-12-30 16:08:41,382 INFO L226 Difference]: Without dead ends: 230 [2018-12-30 16:08:41,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-30 16:08:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-12-30 16:08:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-30 16:08:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2018-12-30 16:08:41,393 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2018-12-30 16:08:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:41,393 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2018-12-30 16:08:41,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2018-12-30 16:08:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-30 16:08:41,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:41,398 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:41,398 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1324345659, now seen corresponding path program 1 times [2018-12-30 16:08:41,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:41,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:41,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:41,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-30 16:08:41,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:41,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:41,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:41,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:41,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:41,543 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2018-12-30 16:08:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:41,645 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2018-12-30 16:08:41,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:41,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-30 16:08:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:41,654 INFO L225 Difference]: With dead ends: 661 [2018-12-30 16:08:41,659 INFO L226 Difference]: Without dead ends: 443 [2018-12-30 16:08:41,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-30 16:08:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-12-30 16:08:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-12-30 16:08:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2018-12-30 16:08:41,689 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2018-12-30 16:08:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:41,690 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2018-12-30 16:08:41,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2018-12-30 16:08:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-30 16:08:41,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:41,698 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:41,698 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:41,699 INFO L82 PathProgramCache]: Analyzing trace with hash -606282988, now seen corresponding path program 1 times [2018-12-30 16:08:41,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:41,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:41,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:41,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:41,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-30 16:08:41,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:41,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:41,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:41,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:41,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:41,813 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2018-12-30 16:08:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:42,142 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2018-12-30 16:08:42,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:42,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-12-30 16:08:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:42,147 INFO L225 Difference]: With dead ends: 661 [2018-12-30 16:08:42,147 INFO L226 Difference]: Without dead ends: 659 [2018-12-30 16:08:42,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-12-30 16:08:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2018-12-30 16:08:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-12-30 16:08:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2018-12-30 16:08:42,170 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2018-12-30 16:08:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:42,171 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2018-12-30 16:08:42,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2018-12-30 16:08:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-30 16:08:42,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:42,176 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:42,176 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:42,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:42,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1653094939, now seen corresponding path program 1 times [2018-12-30 16:08:42,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:42,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:42,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:42,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:42,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 16:08:42,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:42,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:42,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:42,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:42,310 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2018-12-30 16:08:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:43,574 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2018-12-30 16:08:43,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:43,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-12-30 16:08:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:43,581 INFO L225 Difference]: With dead ends: 1462 [2018-12-30 16:08:43,582 INFO L226 Difference]: Without dead ends: 809 [2018-12-30 16:08:43,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-12-30 16:08:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2018-12-30 16:08:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-12-30 16:08:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2018-12-30 16:08:43,607 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 146 [2018-12-30 16:08:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:43,607 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2018-12-30 16:08:43,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:43,608 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2018-12-30 16:08:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-30 16:08:43,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:43,612 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:43,612 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash 285230582, now seen corresponding path program 1 times [2018-12-30 16:08:43,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:43,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:43,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:43,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:43,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-12-30 16:08:43,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:43,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:43,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:43,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:43,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:43,735 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2018-12-30 16:08:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:44,345 INFO L93 Difference]: Finished difference Result 1623 states and 2286 transitions. [2018-12-30 16:08:44,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:44,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-12-30 16:08:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:44,351 INFO L225 Difference]: With dead ends: 1623 [2018-12-30 16:08:44,352 INFO L226 Difference]: Without dead ends: 856 [2018-12-30 16:08:44,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-12-30 16:08:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 845. [2018-12-30 16:08:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-30 16:08:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1180 transitions. [2018-12-30 16:08:44,378 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1180 transitions. Word has length 182 [2018-12-30 16:08:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:44,378 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1180 transitions. [2018-12-30 16:08:44,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1180 transitions. [2018-12-30 16:08:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-30 16:08:44,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:44,384 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:44,384 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash 742481215, now seen corresponding path program 1 times [2018-12-30 16:08:44,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:44,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:44,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:44,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:44,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-12-30 16:08:44,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:44,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:44,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:44,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:44,531 INFO L87 Difference]: Start difference. First operand 845 states and 1180 transitions. Second operand 3 states. [2018-12-30 16:08:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:45,085 INFO L93 Difference]: Finished difference Result 1765 states and 2467 transitions. [2018-12-30 16:08:45,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:45,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2018-12-30 16:08:45,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:45,094 INFO L225 Difference]: With dead ends: 1765 [2018-12-30 16:08:45,095 INFO L226 Difference]: Without dead ends: 929 [2018-12-30 16:08:45,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-12-30 16:08:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 920. [2018-12-30 16:08:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2018-12-30 16:08:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1270 transitions. [2018-12-30 16:08:45,119 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1270 transitions. Word has length 203 [2018-12-30 16:08:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:45,119 INFO L480 AbstractCegarLoop]: Abstraction has 920 states and 1270 transitions. [2018-12-30 16:08:45,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1270 transitions. [2018-12-30 16:08:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-30 16:08:45,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:45,124 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:45,125 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash 884333740, now seen corresponding path program 1 times [2018-12-30 16:08:45,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:45,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:45,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:45,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:45,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-12-30 16:08:45,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:45,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:45,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:45,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:45,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:45,248 INFO L87 Difference]: Start difference. First operand 920 states and 1270 transitions. Second operand 3 states. [2018-12-30 16:08:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:45,550 INFO L93 Difference]: Finished difference Result 1921 states and 2656 transitions. [2018-12-30 16:08:45,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:45,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-12-30 16:08:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:45,560 INFO L225 Difference]: With dead ends: 1921 [2018-12-30 16:08:45,560 INFO L226 Difference]: Without dead ends: 1010 [2018-12-30 16:08:45,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2018-12-30 16:08:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1004. [2018-12-30 16:08:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2018-12-30 16:08:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1369 transitions. [2018-12-30 16:08:45,591 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1369 transitions. Word has length 227 [2018-12-30 16:08:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:45,591 INFO L480 AbstractCegarLoop]: Abstraction has 1004 states and 1369 transitions. [2018-12-30 16:08:45,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1369 transitions. [2018-12-30 16:08:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-30 16:08:45,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:45,598 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:45,598 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1915374638, now seen corresponding path program 1 times [2018-12-30 16:08:45,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:45,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:45,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:45,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:45,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-12-30 16:08:45,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:45,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:45,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:45,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:45,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:45,766 INFO L87 Difference]: Start difference. First operand 1004 states and 1369 transitions. Second operand 3 states. [2018-12-30 16:08:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:46,902 INFO L93 Difference]: Finished difference Result 2101 states and 2881 transitions. [2018-12-30 16:08:46,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:46,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-12-30 16:08:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:46,908 INFO L225 Difference]: With dead ends: 2101 [2018-12-30 16:08:46,908 INFO L226 Difference]: Without dead ends: 1106 [2018-12-30 16:08:46,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-12-30 16:08:46,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1097. [2018-12-30 16:08:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-12-30 16:08:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1477 transitions. [2018-12-30 16:08:46,934 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1477 transitions. Word has length 227 [2018-12-30 16:08:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:46,935 INFO L480 AbstractCegarLoop]: Abstraction has 1097 states and 1477 transitions. [2018-12-30 16:08:46,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1477 transitions. [2018-12-30 16:08:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-30 16:08:46,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:46,940 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:46,941 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:46,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:46,942 INFO L82 PathProgramCache]: Analyzing trace with hash -50346324, now seen corresponding path program 1 times [2018-12-30 16:08:46,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:46,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:46,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-30 16:08:47,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:47,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:47,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:47,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:47,107 INFO L87 Difference]: Start difference. First operand 1097 states and 1477 transitions. Second operand 3 states. [2018-12-30 16:08:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:47,237 INFO L93 Difference]: Finished difference Result 3270 states and 4402 transitions. [2018-12-30 16:08:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:47,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2018-12-30 16:08:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:47,248 INFO L225 Difference]: With dead ends: 3270 [2018-12-30 16:08:47,248 INFO L226 Difference]: Without dead ends: 2182 [2018-12-30 16:08:47,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2018-12-30 16:08:47,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2180. [2018-12-30 16:08:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2180 states. [2018-12-30 16:08:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2934 transitions. [2018-12-30 16:08:47,304 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2934 transitions. Word has length 257 [2018-12-30 16:08:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:47,304 INFO L480 AbstractCegarLoop]: Abstraction has 2180 states and 2934 transitions. [2018-12-30 16:08:47,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2934 transitions. [2018-12-30 16:08:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-30 16:08:47,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:47,314 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:47,314 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:47,314 INFO L82 PathProgramCache]: Analyzing trace with hash 980694574, now seen corresponding path program 1 times [2018-12-30 16:08:47,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:47,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:47,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:47,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-12-30 16:08:47,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:47,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:47,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:47,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:47,455 INFO L87 Difference]: Start difference. First operand 2180 states and 2934 transitions. Second operand 3 states. [2018-12-30 16:08:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:48,115 INFO L93 Difference]: Finished difference Result 4576 states and 6206 transitions. [2018-12-30 16:08:48,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:48,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2018-12-30 16:08:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:48,128 INFO L225 Difference]: With dead ends: 4576 [2018-12-30 16:08:48,129 INFO L226 Difference]: Without dead ends: 2405 [2018-12-30 16:08:48,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2018-12-30 16:08:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2393. [2018-12-30 16:08:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2018-12-30 16:08:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3177 transitions. [2018-12-30 16:08:48,188 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3177 transitions. Word has length 257 [2018-12-30 16:08:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:48,189 INFO L480 AbstractCegarLoop]: Abstraction has 2393 states and 3177 transitions. [2018-12-30 16:08:48,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3177 transitions. [2018-12-30 16:08:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-12-30 16:08:48,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:48,197 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:48,197 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:48,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:48,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1095007574, now seen corresponding path program 1 times [2018-12-30 16:08:48,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:48,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:48,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:48,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:48,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2018-12-30 16:08:48,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:48,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:48,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:48,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:48,320 INFO L87 Difference]: Start difference. First operand 2393 states and 3177 transitions. Second operand 3 states. [2018-12-30 16:08:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:49,201 INFO L93 Difference]: Finished difference Result 4888 states and 6509 transitions. [2018-12-30 16:08:49,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:49,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2018-12-30 16:08:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:49,216 INFO L225 Difference]: With dead ends: 4888 [2018-12-30 16:08:49,216 INFO L226 Difference]: Without dead ends: 2504 [2018-12-30 16:08:49,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:49,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2018-12-30 16:08:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2492. [2018-12-30 16:08:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2492 states. [2018-12-30 16:08:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3291 transitions. [2018-12-30 16:08:49,294 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 3291 transitions. Word has length 281 [2018-12-30 16:08:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:49,295 INFO L480 AbstractCegarLoop]: Abstraction has 2492 states and 3291 transitions. [2018-12-30 16:08:49,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3291 transitions. [2018-12-30 16:08:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-30 16:08:49,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:49,305 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:49,305 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:49,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1021889644, now seen corresponding path program 1 times [2018-12-30 16:08:49,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:49,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:49,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:49,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:49,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-12-30 16:08:49,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:49,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:49,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:49,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:49,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:49,477 INFO L87 Difference]: Start difference. First operand 2492 states and 3291 transitions. Second operand 3 states. [2018-12-30 16:08:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:49,819 INFO L93 Difference]: Finished difference Result 5275 states and 7097 transitions. [2018-12-30 16:08:49,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:49,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-12-30 16:08:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:49,836 INFO L225 Difference]: With dead ends: 5275 [2018-12-30 16:08:49,836 INFO L226 Difference]: Without dead ends: 2792 [2018-12-30 16:08:49,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2018-12-30 16:08:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2732. [2018-12-30 16:08:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2018-12-30 16:08:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3573 transitions. [2018-12-30 16:08:49,900 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3573 transitions. Word has length 292 [2018-12-30 16:08:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:49,900 INFO L480 AbstractCegarLoop]: Abstraction has 2732 states and 3573 transitions. [2018-12-30 16:08:49,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3573 transitions. [2018-12-30 16:08:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-30 16:08:49,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:49,908 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:49,908 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash -229308938, now seen corresponding path program 1 times [2018-12-30 16:08:49,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:49,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:49,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:49,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-12-30 16:08:50,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:50,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:50,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:50,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:50,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:50,050 INFO L87 Difference]: Start difference. First operand 2732 states and 3573 transitions. Second operand 3 states. [2018-12-30 16:08:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:50,616 INFO L93 Difference]: Finished difference Result 5539 states and 7235 transitions. [2018-12-30 16:08:50,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:50,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-12-30 16:08:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:50,630 INFO L225 Difference]: With dead ends: 5539 [2018-12-30 16:08:50,631 INFO L226 Difference]: Without dead ends: 2798 [2018-12-30 16:08:50,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:50,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2018-12-30 16:08:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2726. [2018-12-30 16:08:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-12-30 16:08:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3537 transitions. [2018-12-30 16:08:50,689 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3537 transitions. Word has length 300 [2018-12-30 16:08:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:50,689 INFO L480 AbstractCegarLoop]: Abstraction has 2726 states and 3537 transitions. [2018-12-30 16:08:50,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3537 transitions. [2018-12-30 16:08:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-12-30 16:08:50,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:50,696 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:50,696 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:50,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:50,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1736108088, now seen corresponding path program 1 times [2018-12-30 16:08:50,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:50,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:50,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:50,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-12-30 16:08:50,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:08:50,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:08:50,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:51,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:08:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-12-30 16:08:51,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:08:51,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:08:51,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:08:51,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:08:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:08:51,250 INFO L87 Difference]: Start difference. First operand 2726 states and 3537 transitions. Second operand 4 states. [2018-12-30 16:08:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:53,788 INFO L93 Difference]: Finished difference Result 8268 states and 10711 transitions. [2018-12-30 16:08:53,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:08:53,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2018-12-30 16:08:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:53,818 INFO L225 Difference]: With dead ends: 8268 [2018-12-30 16:08:53,818 INFO L226 Difference]: Without dead ends: 5545 [2018-12-30 16:08:53,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:08:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5545 states. [2018-12-30 16:08:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5545 to 3572. [2018-12-30 16:08:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2018-12-30 16:08:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4587 transitions. [2018-12-30 16:08:53,952 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4587 transitions. Word has length 331 [2018-12-30 16:08:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:53,952 INFO L480 AbstractCegarLoop]: Abstraction has 3572 states and 4587 transitions. [2018-12-30 16:08:53,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:08:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4587 transitions. [2018-12-30 16:08:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-12-30 16:08:53,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:53,961 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:53,961 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:53,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:53,962 INFO L82 PathProgramCache]: Analyzing trace with hash 619319881, now seen corresponding path program 1 times [2018-12-30 16:08:53,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:53,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:53,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:53,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 770 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-12-30 16:08:54,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:54,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:54,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:54,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:54,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:54,175 INFO L87 Difference]: Start difference. First operand 3572 states and 4587 transitions. Second operand 3 states. [2018-12-30 16:08:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:54,384 INFO L93 Difference]: Finished difference Result 9456 states and 12199 transitions. [2018-12-30 16:08:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:54,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2018-12-30 16:08:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:54,427 INFO L225 Difference]: With dead ends: 9456 [2018-12-30 16:08:54,427 INFO L226 Difference]: Without dead ends: 5893 [2018-12-30 16:08:54,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2018-12-30 16:08:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 5591. [2018-12-30 16:08:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5591 states. [2018-12-30 16:08:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5591 states to 5591 states and 7204 transitions. [2018-12-30 16:08:54,558 INFO L78 Accepts]: Start accepts. Automaton has 5591 states and 7204 transitions. Word has length 332 [2018-12-30 16:08:54,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:54,558 INFO L480 AbstractCegarLoop]: Abstraction has 5591 states and 7204 transitions. [2018-12-30 16:08:54,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5591 states and 7204 transitions. [2018-12-30 16:08:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-12-30 16:08:54,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:54,570 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:54,571 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash -319778261, now seen corresponding path program 1 times [2018-12-30 16:08:54,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:54,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:54,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:54,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:54,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-30 16:08:54,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:54,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:54,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:54,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:54,797 INFO L87 Difference]: Start difference. First operand 5591 states and 7204 transitions. Second operand 3 states. [2018-12-30 16:08:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:55,942 INFO L93 Difference]: Finished difference Result 11779 states and 15109 transitions. [2018-12-30 16:08:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:55,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-12-30 16:08:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:55,956 INFO L225 Difference]: With dead ends: 11779 [2018-12-30 16:08:55,956 INFO L226 Difference]: Without dead ends: 6197 [2018-12-30 16:08:55,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2018-12-30 16:08:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 5765. [2018-12-30 16:08:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2018-12-30 16:08:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7438 transitions. [2018-12-30 16:08:56,072 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7438 transitions. Word has length 337 [2018-12-30 16:08:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:56,074 INFO L480 AbstractCegarLoop]: Abstraction has 5765 states and 7438 transitions. [2018-12-30 16:08:56,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7438 transitions. [2018-12-30 16:08:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-30 16:08:56,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:56,084 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:56,084 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1517002467, now seen corresponding path program 1 times [2018-12-30 16:08:56,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:56,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:56,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:56,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-30 16:08:56,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:08:56,329 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 [2018-12-30 16:08:56,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:56,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:08:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-30 16:08:56,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:08:56,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:08:56,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:08:56,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:08:56,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:08:56,597 INFO L87 Difference]: Start difference. First operand 5765 states and 7438 transitions. Second operand 4 states. [2018-12-30 16:08:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:57,930 INFO L93 Difference]: Finished difference Result 13053 states and 16776 transitions. [2018-12-30 16:08:57,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:08:57,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2018-12-30 16:08:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:57,948 INFO L225 Difference]: With dead ends: 13053 [2018-12-30 16:08:57,949 INFO L226 Difference]: Without dead ends: 7284 [2018-12-30 16:08:57,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:08:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7284 states. [2018-12-30 16:08:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7284 to 5912. [2018-12-30 16:08:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2018-12-30 16:08:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 7555 transitions. [2018-12-30 16:08:58,085 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 7555 transitions. Word has length 375 [2018-12-30 16:08:58,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:58,086 INFO L480 AbstractCegarLoop]: Abstraction has 5912 states and 7555 transitions. [2018-12-30 16:08:58,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:08:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 7555 transitions. [2018-12-30 16:08:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-12-30 16:08:58,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:58,096 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:58,097 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:58,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:58,097 INFO L82 PathProgramCache]: Analyzing trace with hash 934852515, now seen corresponding path program 1 times [2018-12-30 16:08:58,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:58,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:58,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:58,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:58,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-12-30 16:08:58,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:58,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:58,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:58,278 INFO L87 Difference]: Start difference. First operand 5912 states and 7555 transitions. Second operand 3 states. [2018-12-30 16:08:58,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:58,630 INFO L93 Difference]: Finished difference Result 11428 states and 14363 transitions. [2018-12-30 16:08:58,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:58,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2018-12-30 16:08:58,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:58,638 INFO L225 Difference]: With dead ends: 11428 [2018-12-30 16:08:58,638 INFO L226 Difference]: Without dead ends: 3254 [2018-12-30 16:08:58,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2018-12-30 16:08:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3162. [2018-12-30 16:08:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3162 states. [2018-12-30 16:08:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 3995 transitions. [2018-12-30 16:08:58,701 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 3995 transitions. Word has length 414 [2018-12-30 16:08:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:58,701 INFO L480 AbstractCegarLoop]: Abstraction has 3162 states and 3995 transitions. [2018-12-30 16:08:58,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 3995 transitions. [2018-12-30 16:08:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-12-30 16:08:58,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:58,707 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:58,707 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:58,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:58,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1275695783, now seen corresponding path program 1 times [2018-12-30 16:08:58,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:58,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:58,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:58,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:58,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-12-30 16:08:59,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:08:59,018 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:08:59,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:59,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:08:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-12-30 16:08:59,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:08:59,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:08:59,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:08:59,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:08:59,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:08:59,306 INFO L87 Difference]: Start difference. First operand 3162 states and 3995 transitions. Second operand 4 states. [2018-12-30 16:08:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:59,512 INFO L93 Difference]: Finished difference Result 3822 states and 4839 transitions. [2018-12-30 16:08:59,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:08:59,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 481 [2018-12-30 16:08:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:59,513 INFO L225 Difference]: With dead ends: 3822 [2018-12-30 16:08:59,514 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:08:59,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:08:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:08:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:08:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:08:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:08:59,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 481 [2018-12-30 16:08:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:59,517 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:08:59,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:08:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:08:59,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:08:59,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:08:59,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:59,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:00,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:00,008 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 93 [2018-12-30 16:09:00,455 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2018-12-30 16:09:01,009 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-12-30 16:09:01,283 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2018-12-30 16:09:01,484 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2018-12-30 16:09:01,733 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-12-30 16:09:01,845 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 16 [2018-12-30 16:09:02,170 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2018-12-30 16:09:02,277 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 17 [2018-12-30 16:09:02,358 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-12-30 16:09:02,358 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-12-30 16:09:02,358 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-12-30 16:09:02,359 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-12-30 16:09:02,359 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-12-30 16:09:02,359 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-12-30 16:09:02,359 INFO L444 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2018-12-30 16:09:02,359 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= ULTIMATE.start_ssl3_connect_~s__state~0 12292)) [2018-12-30 16:09:02,359 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-12-30 16:09:02,359 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-12-30 16:09:02,359 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-12-30 16:09:02,359 INFO L448 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-12-30 16:09:02,360 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-12-30 16:09:02,360 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-12-30 16:09:02,360 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-12-30 16:09:02,360 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-12-30 16:09:02,360 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-12-30 16:09:02,360 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) [2018-12-30 16:09:02,360 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-12-30 16:09:02,360 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-12-30 16:09:02,360 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-12-30 16:09:02,361 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-12-30 16:09:02,361 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-12-30 16:09:02,361 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-12-30 16:09:02,361 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-12-30 16:09:02,361 INFO L444 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2018-12-30 16:09:02,361 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-12-30 16:09:02,361 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-12-30 16:09:02,361 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-12-30 16:09:02,361 INFO L444 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2018-12-30 16:09:02,362 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-12-30 16:09:02,362 INFO L448 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-12-30 16:09:02,362 INFO L451 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-12-30 16:09:02,362 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-12-30 16:09:02,362 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-12-30 16:09:02,362 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-12-30 16:09:02,362 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2018-12-30 16:09:02,362 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-12-30 16:09:02,362 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-12-30 16:09:02,362 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-12-30 16:09:02,363 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-12-30 16:09:02,363 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-12-30 16:09:02,363 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-12-30 16:09:02,363 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-12-30 16:09:02,363 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-12-30 16:09:02,363 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-12-30 16:09:02,363 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-12-30 16:09:02,363 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-12-30 16:09:02,363 INFO L444 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2018-12-30 16:09:02,363 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-12-30 16:09:02,363 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-12-30 16:09:02,363 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-12-30 16:09:02,364 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-12-30 16:09:02,364 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-12-30 16:09:02,364 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-12-30 16:09:02,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-12-30 16:09:02,364 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-12-30 16:09:02,364 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2018-12-30 16:09:02,364 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-12-30 16:09:02,364 INFO L448 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2018-12-30 16:09:02,364 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2018-12-30 16:09:02,365 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-12-30 16:09:02,365 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-12-30 16:09:02,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:09:02,365 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-12-30 16:09:02,365 INFO L448 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2018-12-30 16:09:02,365 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-12-30 16:09:02,365 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-12-30 16:09:02,365 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-12-30 16:09:02,365 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-12-30 16:09:02,365 INFO L451 ceAbstractionStarter]: At program point L550(lines 11 552) the Hoare annotation is: true [2018-12-30 16:09:02,366 INFO L444 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2))) [2018-12-30 16:09:02,366 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:09:02,366 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-12-30 16:09:02,366 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-12-30 16:09:02,366 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-12-30 16:09:02,366 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-12-30 16:09:02,366 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-12-30 16:09:02,367 INFO L444 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse5 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse7 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4400) .cse0 .cse1) (and .cse2 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3) (and .cse4 .cse0 .cse5) (and .cse4 .cse6 .cse1 .cse5) (and .cse7 .cse8 .cse9 .cse1 .cse10) (and .cse11 .cse10) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4416) .cse6 .cse1) (and .cse7 .cse8 .cse0) (and .cse2 .cse3 .cse9 .cse1 .cse10) (and .cse0 .cse11 .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4368) .cse0))) [2018-12-30 16:09:02,367 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-12-30 16:09:02,367 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-12-30 16:09:02,367 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-12-30 16:09:02,367 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-12-30 16:09:02,367 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-12-30 16:09:02,367 INFO L444 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: false [2018-12-30 16:09:02,367 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-12-30 16:09:02,367 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:09:02,367 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-12-30 16:09:02,368 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-12-30 16:09:02,369 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-12-30 16:09:02,369 INFO L448 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-12-30 16:09:02,369 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-12-30 16:09:02,369 INFO L444 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2018-12-30 16:09:02,369 INFO L444 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:09:02,369 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-12-30 16:09:02,369 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:09:02,369 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-12-30 16:09:02,369 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-12-30 16:09:02,369 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-12-30 16:09:02,370 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-12-30 16:09:02,370 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-12-30 16:09:02,370 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-12-30 16:09:02,370 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-12-30 16:09:02,370 INFO L444 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1))) [2018-12-30 16:09:02,370 INFO L444 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2018-12-30 16:09:02,370 INFO L448 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-12-30 16:09:02,370 INFO L451 ceAbstractionStarter]: At program point L561(lines 553 563) the Hoare annotation is: true [2018-12-30 16:09:02,370 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-12-30 16:09:02,370 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-12-30 16:09:02,370 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-12-30 16:09:02,371 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2018-12-30 16:09:02,371 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-12-30 16:09:02,371 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-12-30 16:09:02,371 INFO L444 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) [2018-12-30 16:09:02,371 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 16:09:02,371 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-12-30 16:09:02,371 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-12-30 16:09:02,371 INFO L448 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2018-12-30 16:09:02,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:09:02 BoogieIcfgContainer [2018-12-30 16:09:02,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:09:02,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:09:02,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:09:02,406 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:09:02,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:38" (3/4) ... [2018-12-30 16:09:02,428 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:09:02,457 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 16:09:02,458 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:09:02,593 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:09:02,594 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:09:02,595 INFO L168 Benchmark]: Toolchain (without parser) took 26543.89 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 493.9 MB). Free memory was 951.3 MB in the beginning and 838.6 MB in the end (delta: 112.7 MB). Peak memory consumption was 606.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:02,596 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:09:02,597 INFO L168 Benchmark]: CACSL2BoogieTranslator took 483.58 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:02,597 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -126.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:02,597 INFO L168 Benchmark]: Boogie Preprocessor took 43.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:09:02,598 INFO L168 Benchmark]: RCFGBuilder took 1280.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:02,598 INFO L168 Benchmark]: TraceAbstraction took 24398.23 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 417.9 MB). Free memory was 1.0 GB in the beginning and 853.4 MB in the end (delta: 160.6 MB). Peak memory consumption was 578.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:02,598 INFO L168 Benchmark]: Witness Printer took 188.26 ms. Allocated memory is still 1.5 GB. Free memory was 853.4 MB in the beginning and 838.6 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:02,604 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 483.58 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 143.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -126.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1280.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24398.23 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 417.9 MB). Free memory was 1.0 GB in the beginning and 853.4 MB in the end (delta: 160.6 MB). Peak memory consumption was 578.5 MB. Max. memory is 11.5 GB. * Witness Printer took 188.26 ms. Allocated memory is still 1.5 GB. Free memory was 853.4 MB in the beginning and 838.6 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 105]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && s__hit == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state) && s__hit == 0 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) || (((s__state <= 4560 && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || ((s__state <= 4560 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: blastFlag <= 2 && s__state == 12292 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && s__hit == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 4) && 4352 <= s__state) && s__hit == 0 - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((s__state == 4400 && blastFlag <= 2) && s__hit == 0) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state)) || (((s__state <= 4528 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && s__hit == 0)) || (s__state == 4384 && blastFlag <= 2)) || (s__state == 4368 && blastFlag <= 2) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && s__hit == 0) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. SAFE Result, 24.2s OverallTime, 24 OverallIterations, 18 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 4515 SDtfs, 1551 SDslu, 2498 SDs, 0 SdLazy, 2467 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1264 GetRequests, 1234 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5912occurred in iteration=22, 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: 1.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 4422 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 177 NumberOfFragments, 437 HoareAnnotationTreeSize, 22 FomulaSimplifications, 8922 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 2209 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 6366 NumberOfCodeBlocks, 6366 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6339 ConstructedInterpolants, 0 QuantifiedInterpolants, 2477651 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2046 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 23271/23337 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...