./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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_1_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 a72fcebcfa7a668c9bb314320ec142761ff8c6a6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:23:06,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:23:06,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:23:06,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:23:06,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:23:06,022 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:23:06,023 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:23:06,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:23:06,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:23:06,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:23:06,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:23:06,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:23:06,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:23:06,031 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:23:06,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:23:06,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:23:06,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:23:06,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:23:06,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:23:06,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:23:06,040 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:23:06,041 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:23:06,046 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:23:06,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:23:06,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:23:06,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:23:06,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:23:06,056 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:23:06,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:23:06,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:23:06,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:23:06,063 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:23:06,063 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:23:06,063 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:23:06,064 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:23:06,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:23:06,066 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:23:06,098 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:23:06,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:23:06,101 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:23:06,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:23:06,101 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:23:06,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:23:06,101 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:23:06,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:23:06,102 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:23:06,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:23:06,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:23:06,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:23:06,103 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:23:06,103 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:23:06,103 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:23:06,103 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:23:06,104 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:23:06,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:23:06,104 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:23:06,104 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:23:06,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:23:06,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:23:06,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:23:06,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:23:06,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:23:06,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:23:06,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:23:06,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:23:06,107 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 -> a72fcebcfa7a668c9bb314320ec142761ff8c6a6 [2019-01-11 21:23:06,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:23:06,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:23:06,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:23:06,183 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:23:06,183 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:23:06,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2019-01-11 21:23:06,246 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a76146c3b/15a682d3c6c94c52b27a0569b0b1be28/FLAGaaeb98c15 [2019-01-11 21:23:06,715 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:23:06,716 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2019-01-11 21:23:06,738 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a76146c3b/15a682d3c6c94c52b27a0569b0b1be28/FLAGaaeb98c15 [2019-01-11 21:23:07,005 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a76146c3b/15a682d3c6c94c52b27a0569b0b1be28 [2019-01-11 21:23:07,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:23:07,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:23:07,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:07,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:23:07,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:23:07,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:07" (1/1) ... [2019-01-11 21:23:07,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e51134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07, skipping insertion in model container [2019-01-11 21:23:07,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:07" (1/1) ... [2019-01-11 21:23:07,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:23:07,069 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:23:07,305 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:07,315 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:23:07,402 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:07,417 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:23:07,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07 WrapperNode [2019-01-11 21:23:07,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:07,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:07,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:23:07,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:23:07,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07" (1/1) ... [2019-01-11 21:23:07,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07" (1/1) ... [2019-01-11 21:23:07,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:07,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:23:07,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:23:07,581 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:23:07,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07" (1/1) ... [2019-01-11 21:23:07,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07" (1/1) ... [2019-01-11 21:23:07,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07" (1/1) ... [2019-01-11 21:23:07,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07" (1/1) ... [2019-01-11 21:23:07,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07" (1/1) ... [2019-01-11 21:23:07,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07" (1/1) ... [2019-01-11 21:23:07,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07" (1/1) ... [2019-01-11 21:23:07,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:23:07,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:23:07,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:23:07,641 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:23:07,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:23:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:23:07,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:23:07,891 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:23:08,830 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-11 21:23:08,831 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-11 21:23:08,832 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:23:08,832 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:23:08,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:08 BoogieIcfgContainer [2019-01-11 21:23:08,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:23:08,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:23:08,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:23:08,838 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:23:08,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:23:07" (1/3) ... [2019-01-11 21:23:08,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67309659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:08, skipping insertion in model container [2019-01-11 21:23:08,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:07" (2/3) ... [2019-01-11 21:23:08,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67309659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:08, skipping insertion in model container [2019-01-11 21:23:08,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:08" (3/3) ... [2019-01-11 21:23:08,842 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_true-unreach-call_true-termination.cil.c [2019-01-11 21:23:08,850 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:23:08,858 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:23:08,874 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:23:08,909 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:23:08,909 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:23:08,910 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:23:08,910 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:23:08,910 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:23:08,910 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:23:08,910 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:23:08,911 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:23:08,911 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:23:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-01-11 21:23:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:23:08,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:08,939 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] [2019-01-11 21:23:08,941 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:08,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-01-11 21:23:08,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:08,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:08,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:08,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:08,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:09,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:09,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:09,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:09,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:09,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:09,176 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-01-11 21:23:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:09,610 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-01-11 21:23:09,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:09,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:23:09,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:09,629 INFO L225 Difference]: With dead ends: 249 [2019-01-11 21:23:09,632 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 21:23:09,640 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 [2019-01-11 21:23:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 21:23:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-11 21:23:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-11 21:23:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-01-11 21:23:09,687 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-01-11 21:23:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:09,687 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-01-11 21:23:09,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-01-11 21:23:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 21:23:09,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:09,689 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] [2019-01-11 21:23:09,690 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-01-11 21:23:09,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:09,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:09,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:09,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:09,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:09,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:09,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:09,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:09,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:09,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:09,826 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-01-11 21:23:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:10,400 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-01-11 21:23:10,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:10,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-11 21:23:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:10,404 INFO L225 Difference]: With dead ends: 235 [2019-01-11 21:23:10,404 INFO L226 Difference]: Without dead ends: 131 [2019-01-11 21:23:10,406 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 [2019-01-11 21:23:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-11 21:23:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-01-11 21:23:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-11 21:23:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-01-11 21:23:10,419 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-01-11 21:23:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:10,420 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-01-11 21:23:10,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-01-11 21:23:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 21:23:10,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:10,422 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] [2019-01-11 21:23:10,422 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:10,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:10,423 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-01-11 21:23:10,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:10,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:10,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:10,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:10,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:23:10,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:10,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:10,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:10,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:10,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:10,504 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-01-11 21:23:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:10,777 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-01-11 21:23:10,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:10,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-11 21:23:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:10,782 INFO L225 Difference]: With dead ends: 268 [2019-01-11 21:23:10,782 INFO L226 Difference]: Without dead ends: 149 [2019-01-11 21:23:10,784 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 [2019-01-11 21:23:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-11 21:23:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-01-11 21:23:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-11 21:23:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-01-11 21:23:10,796 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-01-11 21:23:10,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:10,797 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-01-11 21:23:10,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:10,797 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-01-11 21:23:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 21:23:10,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:10,799 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] [2019-01-11 21:23:10,800 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:10,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-01-11 21:23:10,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:10,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:10,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 21:23:10,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:10,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:10,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:10,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:10,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:10,930 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-01-11 21:23:11,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:11,308 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-01-11 21:23:11,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:11,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-11 21:23:11,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:11,312 INFO L225 Difference]: With dead ends: 332 [2019-01-11 21:23:11,312 INFO L226 Difference]: Without dead ends: 195 [2019-01-11 21:23:11,313 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 [2019-01-11 21:23:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-11 21:23:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-01-11 21:23:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 21:23:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-01-11 21:23:11,338 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-01-11 21:23:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:11,338 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-01-11 21:23:11,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-01-11 21:23:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 21:23:11,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:11,340 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] [2019-01-11 21:23:11,340 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:11,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-01-11 21:23:11,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:11,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:11,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:11,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:11,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 21:23:11,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:11,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:11,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:11,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:11,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:11,435 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-01-11 21:23:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:11,650 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-01-11 21:23:11,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:11,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-11 21:23:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:11,654 INFO L225 Difference]: With dead ends: 386 [2019-01-11 21:23:11,654 INFO L226 Difference]: Without dead ends: 209 [2019-01-11 21:23:11,655 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 [2019-01-11 21:23:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-11 21:23:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-01-11 21:23:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-11 21:23:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-01-11 21:23:11,666 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-01-11 21:23:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:11,667 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-01-11 21:23:11,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-01-11 21:23:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:23:11,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:11,669 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] [2019-01-11 21:23:11,669 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:11,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:11,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-01-11 21:23:11,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:11,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:11,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:11,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-11 21:23:11,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:11,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:11,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:11,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:11,811 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-01-11 21:23:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:11,972 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-01-11 21:23:11,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:11,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:23:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:11,975 INFO L225 Difference]: With dead ends: 425 [2019-01-11 21:23:11,975 INFO L226 Difference]: Without dead ends: 229 [2019-01-11 21:23:11,976 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 [2019-01-11 21:23:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-01-11 21:23:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-01-11 21:23:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-11 21:23:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-01-11 21:23:11,985 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-01-11 21:23:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:11,985 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-01-11 21:23:11,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-01-11 21:23:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-11 21:23:11,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:11,988 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] [2019-01-11 21:23:11,988 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:11,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:11,988 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-01-11 21:23:11,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:11,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:11,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:11,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-11 21:23:12,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:12,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:12,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:12,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:12,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:12,100 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-01-11 21:23:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:12,181 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-01-11 21:23:12,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:12,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-11 21:23:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:12,195 INFO L225 Difference]: With dead ends: 658 [2019-01-11 21:23:12,195 INFO L226 Difference]: Without dead ends: 441 [2019-01-11 21:23:12,198 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 [2019-01-11 21:23:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-01-11 21:23:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-01-11 21:23:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-01-11 21:23:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-01-11 21:23:12,232 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-01-11 21:23:12,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:12,234 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-01-11 21:23:12,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-01-11 21:23:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:23:12,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:12,241 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] [2019-01-11 21:23:12,241 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-01-11 21:23:12,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:12,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:12,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:12,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:12,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-11 21:23:12,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:12,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:12,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:12,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:12,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:12,416 INFO L87 Difference]: Start difference. First operand 441 states and 607 transitions. Second operand 3 states. [2019-01-11 21:23:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:12,718 INFO L93 Difference]: Finished difference Result 658 states and 906 transitions. [2019-01-11 21:23:12,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:12,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:23:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:12,723 INFO L225 Difference]: With dead ends: 658 [2019-01-11 21:23:12,723 INFO L226 Difference]: Without dead ends: 656 [2019-01-11 21:23:12,724 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 [2019-01-11 21:23:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-01-11 21:23:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-01-11 21:23:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-01-11 21:23:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2019-01-11 21:23:12,743 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 105 [2019-01-11 21:23:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:12,743 INFO L480 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2019-01-11 21:23:12,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2019-01-11 21:23:12,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-11 21:23:12,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:12,746 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2019-01-11 21:23:12,746 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:12,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1076298523, now seen corresponding path program 1 times [2019-01-11 21:23:12,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:12,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:12,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-11 21:23:12,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:12,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:12,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:12,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:12,871 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2019-01-11 21:23:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:13,622 INFO L93 Difference]: Finished difference Result 1383 states and 1932 transitions. [2019-01-11 21:23:13,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:13,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-01-11 21:23:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:13,627 INFO L225 Difference]: With dead ends: 1383 [2019-01-11 21:23:13,628 INFO L226 Difference]: Without dead ends: 736 [2019-01-11 21:23:13,630 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 [2019-01-11 21:23:13,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-01-11 21:23:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725. [2019-01-11 21:23:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-01-11 21:23:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 988 transitions. [2019-01-11 21:23:13,658 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 988 transitions. Word has length 130 [2019-01-11 21:23:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:13,658 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 988 transitions. [2019-01-11 21:23:13,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 988 transitions. [2019-01-11 21:23:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-11 21:23:13,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:13,663 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1] [2019-01-11 21:23:13,664 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1485143904, now seen corresponding path program 1 times [2019-01-11 21:23:13,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:13,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:13,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:13,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:13,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-01-11 21:23:13,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:13,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:13,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:13,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:13,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:13,799 INFO L87 Difference]: Start difference. First operand 725 states and 988 transitions. Second operand 3 states. [2019-01-11 21:23:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:14,303 INFO L93 Difference]: Finished difference Result 1594 states and 2230 transitions. [2019-01-11 21:23:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:14,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-01-11 21:23:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:14,312 INFO L225 Difference]: With dead ends: 1594 [2019-01-11 21:23:14,313 INFO L226 Difference]: Without dead ends: 875 [2019-01-11 21:23:14,314 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 [2019-01-11 21:23:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-01-11 21:23:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 842. [2019-01-11 21:23:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-01-11 21:23:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1165 transitions. [2019-01-11 21:23:14,338 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1165 transitions. Word has length 151 [2019-01-11 21:23:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:14,339 INFO L480 AbstractCegarLoop]: Abstraction has 842 states and 1165 transitions. [2019-01-11 21:23:14,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1165 transitions. [2019-01-11 21:23:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-11 21:23:14,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:14,344 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2019-01-11 21:23:14,344 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:14,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:14,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1560654223, now seen corresponding path program 1 times [2019-01-11 21:23:14,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:14,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:14,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:14,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:14,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-01-11 21:23:14,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:14,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:14,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:14,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:14,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:14,479 INFO L87 Difference]: Start difference. First operand 842 states and 1165 transitions. Second operand 3 states. [2019-01-11 21:23:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:15,287 INFO L93 Difference]: Finished difference Result 1765 states and 2434 transitions. [2019-01-11 21:23:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:15,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-01-11 21:23:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:15,297 INFO L225 Difference]: With dead ends: 1765 [2019-01-11 21:23:15,298 INFO L226 Difference]: Without dead ends: 932 [2019-01-11 21:23:15,299 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 [2019-01-11 21:23:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-01-11 21:23:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 926. [2019-01-11 21:23:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-01-11 21:23:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1264 transitions. [2019-01-11 21:23:15,322 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1264 transitions. Word has length 187 [2019-01-11 21:23:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:15,324 INFO L480 AbstractCegarLoop]: Abstraction has 926 states and 1264 transitions. [2019-01-11 21:23:15,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1264 transitions. [2019-01-11 21:23:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-11 21:23:15,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:15,329 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2019-01-11 21:23:15,329 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:15,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash -999954445, now seen corresponding path program 1 times [2019-01-11 21:23:15,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:15,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:15,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:15,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:15,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-01-11 21:23:15,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:15,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:15,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:15,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:15,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:15,480 INFO L87 Difference]: Start difference. First operand 926 states and 1264 transitions. Second operand 3 states. [2019-01-11 21:23:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:15,823 INFO L93 Difference]: Finished difference Result 1945 states and 2659 transitions. [2019-01-11 21:23:15,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:15,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-01-11 21:23:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:15,829 INFO L225 Difference]: With dead ends: 1945 [2019-01-11 21:23:15,829 INFO L226 Difference]: Without dead ends: 1028 [2019-01-11 21:23:15,830 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 [2019-01-11 21:23:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-01-11 21:23:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2019-01-11 21:23:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-01-11 21:23:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1372 transitions. [2019-01-11 21:23:15,854 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1372 transitions. Word has length 187 [2019-01-11 21:23:15,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:15,855 INFO L480 AbstractCegarLoop]: Abstraction has 1019 states and 1372 transitions. [2019-01-11 21:23:15,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1372 transitions. [2019-01-11 21:23:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-11 21:23:15,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:15,860 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:15,860 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:15,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1300602353, now seen corresponding path program 1 times [2019-01-11 21:23:15,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:15,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:15,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:15,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:15,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-01-11 21:23:15,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:15,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:15,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:15,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:15,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:15,993 INFO L87 Difference]: Start difference. First operand 1019 states and 1372 transitions. Second operand 3 states. [2019-01-11 21:23:16,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:16,102 INFO L93 Difference]: Finished difference Result 3036 states and 4087 transitions. [2019-01-11 21:23:16,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:16,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-01-11 21:23:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:16,132 INFO L225 Difference]: With dead ends: 3036 [2019-01-11 21:23:16,132 INFO L226 Difference]: Without dead ends: 2026 [2019-01-11 21:23:16,134 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 [2019-01-11 21:23:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-01-11 21:23:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2024. [2019-01-11 21:23:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-01-11 21:23:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2724 transitions. [2019-01-11 21:23:16,182 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2724 transitions. Word has length 217 [2019-01-11 21:23:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:16,183 INFO L480 AbstractCegarLoop]: Abstraction has 2024 states and 2724 transitions. [2019-01-11 21:23:16,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2724 transitions. [2019-01-11 21:23:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-11 21:23:16,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:16,190 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:16,190 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:16,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:16,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1861302131, now seen corresponding path program 1 times [2019-01-11 21:23:16,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:16,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:16,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-11 21:23:16,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:16,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:16,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:16,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:16,309 INFO L87 Difference]: Start difference. First operand 2024 states and 2724 transitions. Second operand 3 states. [2019-01-11 21:23:17,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:17,970 INFO L93 Difference]: Finished difference Result 4264 states and 5762 transitions. [2019-01-11 21:23:17,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:17,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-01-11 21:23:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:17,985 INFO L225 Difference]: With dead ends: 4264 [2019-01-11 21:23:17,985 INFO L226 Difference]: Without dead ends: 2249 [2019-01-11 21:23:17,989 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 [2019-01-11 21:23:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-01-11 21:23:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2237. [2019-01-11 21:23:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2019-01-11 21:23:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 2967 transitions. [2019-01-11 21:23:18,066 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 2967 transitions. Word has length 217 [2019-01-11 21:23:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:18,067 INFO L480 AbstractCegarLoop]: Abstraction has 2237 states and 2967 transitions. [2019-01-11 21:23:18,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2967 transitions. [2019-01-11 21:23:18,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-11 21:23:18,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:18,076 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:18,076 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:18,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:18,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1392663397, now seen corresponding path program 1 times [2019-01-11 21:23:18,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:18,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:18,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:18,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-01-11 21:23:18,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:18,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:18,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:18,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:18,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:18,218 INFO L87 Difference]: Start difference. First operand 2237 states and 2967 transitions. Second operand 3 states. [2019-01-11 21:23:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:18,998 INFO L93 Difference]: Finished difference Result 4576 states and 6077 transitions. [2019-01-11 21:23:18,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:18,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-01-11 21:23:19,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:19,010 INFO L225 Difference]: With dead ends: 4576 [2019-01-11 21:23:19,011 INFO L226 Difference]: Without dead ends: 2348 [2019-01-11 21:23:19,014 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 [2019-01-11 21:23:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-01-11 21:23:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2336. [2019-01-11 21:23:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2019-01-11 21:23:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3081 transitions. [2019-01-11 21:23:19,078 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3081 transitions. Word has length 241 [2019-01-11 21:23:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:19,079 INFO L480 AbstractCegarLoop]: Abstraction has 2336 states and 3081 transitions. [2019-01-11 21:23:19,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3081 transitions. [2019-01-11 21:23:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-11 21:23:19,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:19,088 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:19,088 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash 844629829, now seen corresponding path program 1 times [2019-01-11 21:23:19,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:19,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:19,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:19,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:19,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-01-11 21:23:19,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:19,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:19,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:19,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:19,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:19,237 INFO L87 Difference]: Start difference. First operand 2336 states and 3081 transitions. Second operand 3 states. [2019-01-11 21:23:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:20,062 INFO L93 Difference]: Finished difference Result 4963 states and 6677 transitions. [2019-01-11 21:23:20,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:20,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-01-11 21:23:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:20,077 INFO L225 Difference]: With dead ends: 4963 [2019-01-11 21:23:20,077 INFO L226 Difference]: Without dead ends: 2636 [2019-01-11 21:23:20,081 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 [2019-01-11 21:23:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-01-11 21:23:20,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2576. [2019-01-11 21:23:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-01-11 21:23:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3363 transitions. [2019-01-11 21:23:20,146 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3363 transitions. Word has length 252 [2019-01-11 21:23:20,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:20,147 INFO L480 AbstractCegarLoop]: Abstraction has 2576 states and 3363 transitions. [2019-01-11 21:23:20,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3363 transitions. [2019-01-11 21:23:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-01-11 21:23:20,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:20,157 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:20,158 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1701177459, now seen corresponding path program 1 times [2019-01-11 21:23:20,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:20,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:20,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:20,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:20,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-01-11 21:23:20,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:23:20,426 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 [2019-01-11 21:23:20,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:20,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:23:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-01-11 21:23:20,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:23:20,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:23:20,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:23:20,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:23:20,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:23:20,742 INFO L87 Difference]: Start difference. First operand 2576 states and 3363 transitions. Second operand 4 states. [2019-01-11 21:23:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:23,667 INFO L93 Difference]: Finished difference Result 8082 states and 10681 transitions. [2019-01-11 21:23:23,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:23:23,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-01-11 21:23:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:23,692 INFO L225 Difference]: With dead ends: 8082 [2019-01-11 21:23:23,692 INFO L226 Difference]: Without dead ends: 5509 [2019-01-11 21:23:23,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:23:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2019-01-11 21:23:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5117. [2019-01-11 21:23:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2019-01-11 21:23:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 6676 transitions. [2019-01-11 21:23:23,823 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 6676 transitions. Word has length 291 [2019-01-11 21:23:23,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:23,823 INFO L480 AbstractCegarLoop]: Abstraction has 5117 states and 6676 transitions. [2019-01-11 21:23:23,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:23:23,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 6676 transitions. [2019-01-11 21:23:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-01-11 21:23:23,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:23,838 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:23,838 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:23,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1916566562, now seen corresponding path program 1 times [2019-01-11 21:23:23,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:23,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:23,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:23,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-01-11 21:23:24,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:24,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:24,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:24,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:24,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:24,096 INFO L87 Difference]: Start difference. First operand 5117 states and 6676 transitions. Second operand 3 states. [2019-01-11 21:23:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:24,330 INFO L93 Difference]: Finished difference Result 12402 states and 16215 transitions. [2019-01-11 21:23:24,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:24,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-01-11 21:23:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:24,383 INFO L225 Difference]: With dead ends: 12402 [2019-01-11 21:23:24,386 INFO L226 Difference]: Without dead ends: 7294 [2019-01-11 21:23:24,394 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 [2019-01-11 21:23:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2019-01-11 21:23:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 7292. [2019-01-11 21:23:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2019-01-11 21:23:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 9521 transitions. [2019-01-11 21:23:24,553 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 9521 transitions. Word has length 292 [2019-01-11 21:23:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:24,553 INFO L480 AbstractCegarLoop]: Abstraction has 7292 states and 9521 transitions. [2019-01-11 21:23:24,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 9521 transitions. [2019-01-11 21:23:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-01-11 21:23:24,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:24,569 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:24,570 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:24,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:24,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1205777966, now seen corresponding path program 1 times [2019-01-11 21:23:24,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:24,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:24,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-01-11 21:23:24,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:24,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:24,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:24,718 INFO L87 Difference]: Start difference. First operand 7292 states and 9521 transitions. Second operand 3 states. [2019-01-11 21:23:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:25,207 INFO L93 Difference]: Finished difference Result 14569 states and 18999 transitions. [2019-01-11 21:23:25,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:25,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-01-11 21:23:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:25,233 INFO L225 Difference]: With dead ends: 14569 [2019-01-11 21:23:25,233 INFO L226 Difference]: Without dead ends: 7286 [2019-01-11 21:23:25,242 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 [2019-01-11 21:23:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2019-01-11 21:23:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 6269. [2019-01-11 21:23:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6269 states. [2019-01-11 21:23:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 8068 transitions. [2019-01-11 21:23:25,356 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 8068 transitions. Word has length 293 [2019-01-11 21:23:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:25,357 INFO L480 AbstractCegarLoop]: Abstraction has 6269 states and 8068 transitions. [2019-01-11 21:23:25,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 8068 transitions. [2019-01-11 21:23:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-01-11 21:23:25,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:25,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:25,371 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:25,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:25,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2024435260, now seen corresponding path program 1 times [2019-01-11 21:23:25,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:25,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:25,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:25,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:25,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1419 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-01-11 21:23:25,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:25,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:25,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:25,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:25,531 INFO L87 Difference]: Start difference. First operand 6269 states and 8068 transitions. Second operand 3 states. [2019-01-11 21:23:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:25,991 INFO L93 Difference]: Finished difference Result 13675 states and 17821 transitions. [2019-01-11 21:23:25,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:25,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-01-11 21:23:25,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:26,008 INFO L225 Difference]: With dead ends: 13675 [2019-01-11 21:23:26,008 INFO L226 Difference]: Without dead ends: 7415 [2019-01-11 21:23:26,015 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 [2019-01-11 21:23:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-01-11 21:23:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 6611. [2019-01-11 21:23:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6611 states. [2019-01-11 21:23:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 8554 transitions. [2019-01-11 21:23:26,144 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 8554 transitions. Word has length 333 [2019-01-11 21:23:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:26,146 INFO L480 AbstractCegarLoop]: Abstraction has 6611 states and 8554 transitions. [2019-01-11 21:23:26,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 8554 transitions. [2019-01-11 21:23:26,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-01-11 21:23:26,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:26,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:26,156 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:26,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2018141812, now seen corresponding path program 1 times [2019-01-11 21:23:26,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:26,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:26,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:26,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:26,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-01-11 21:23:26,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:23:26,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:23:26,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:26,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:23:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-01-11 21:23:27,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:23:27,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:23:27,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:23:27,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:23:27,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:23:27,067 INFO L87 Difference]: Start difference. First operand 6611 states and 8554 transitions. Second operand 5 states. [2019-01-11 21:23:28,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:28,359 INFO L93 Difference]: Finished difference Result 17553 states and 22618 transitions. [2019-01-11 21:23:28,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 21:23:28,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 371 [2019-01-11 21:23:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:28,384 INFO L225 Difference]: With dead ends: 17553 [2019-01-11 21:23:28,384 INFO L226 Difference]: Without dead ends: 10934 [2019-01-11 21:23:28,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:23:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2019-01-11 21:23:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 9585. [2019-01-11 21:23:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9585 states. [2019-01-11 21:23:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 12272 transitions. [2019-01-11 21:23:28,598 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 12272 transitions. Word has length 371 [2019-01-11 21:23:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:28,599 INFO L480 AbstractCegarLoop]: Abstraction has 9585 states and 12272 transitions. [2019-01-11 21:23:28,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:23:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 12272 transitions. [2019-01-11 21:23:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-01-11 21:23:28,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:28,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:28,614 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:28,614 INFO L82 PathProgramCache]: Analyzing trace with hash -77148624, now seen corresponding path program 1 times [2019-01-11 21:23:28,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:28,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:28,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:28,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:28,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-01-11 21:23:28,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:28,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:28,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:28,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:28,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:28,815 INFO L87 Difference]: Start difference. First operand 9585 states and 12272 transitions. Second operand 3 states. [2019-01-11 21:23:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:30,072 INFO L93 Difference]: Finished difference Result 18222 states and 23076 transitions. [2019-01-11 21:23:30,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:30,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-01-11 21:23:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:30,083 INFO L225 Difference]: With dead ends: 18222 [2019-01-11 21:23:30,083 INFO L226 Difference]: Without dead ends: 3798 [2019-01-11 21:23:30,098 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 [2019-01-11 21:23:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2019-01-11 21:23:30,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3523. [2019-01-11 21:23:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2019-01-11 21:23:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 4382 transitions. [2019-01-11 21:23:30,161 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 4382 transitions. Word has length 412 [2019-01-11 21:23:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:30,161 INFO L480 AbstractCegarLoop]: Abstraction has 3523 states and 4382 transitions. [2019-01-11 21:23:30,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 4382 transitions. [2019-01-11 21:23:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-01-11 21:23:30,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:30,173 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:30,173 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:30,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:30,173 INFO L82 PathProgramCache]: Analyzing trace with hash -896719054, now seen corresponding path program 1 times [2019-01-11 21:23:30,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:30,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:30,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:30,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:30,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-01-11 21:23:30,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:23:30,643 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 [2019-01-11 21:23:30,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:30,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:23:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-01-11 21:23:30,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:23:30,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:23:30,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:23:30,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:23:30,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:23:30,922 INFO L87 Difference]: Start difference. First operand 3523 states and 4382 transitions. Second operand 4 states. [2019-01-11 21:23:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:32,206 INFO L93 Difference]: Finished difference Result 3784 states and 4712 transitions. [2019-01-11 21:23:32,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:23:32,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 441 [2019-01-11 21:23:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:32,208 INFO L225 Difference]: With dead ends: 3784 [2019-01-11 21:23:32,208 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:23:32,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:23:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:23:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:23:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:23:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:23:32,213 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 441 [2019-01-11 21:23:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:32,213 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:23:32,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:23:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:23:32,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:23:32,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:23:32,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,691 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 97 [2019-01-11 21:23:32,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:33,358 WARN L181 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-01-11 21:23:33,661 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-01-11 21:23:34,359 WARN L181 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-01-11 21:23:34,600 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-01-11 21:23:34,787 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2019-01-11 21:23:35,063 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-01-11 21:23:35,305 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 18 [2019-01-11 21:23:35,504 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-01-11 21:23:35,504 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-01-11 21:23:35,504 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2019-01-11 21:23:35,504 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2019-01-11 21:23:35,505 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2019-01-11 21:23:35,505 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-01-11 21:23:35,505 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-01-11 21:23:35,505 INFO L444 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-01-11 21:23:35,505 INFO L451 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2019-01-11 21:23:35,505 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-01-11 21:23:35,505 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2019-01-11 21:23:35,506 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2019-01-11 21:23:35,506 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2019-01-11 21:23:35,506 INFO L444 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse1) (and .cse0 .cse1))) [2019-01-11 21:23:35,506 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2019-01-11 21:23:35,506 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2019-01-11 21:23:35,506 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2019-01-11 21:23:35,506 INFO L444 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-01-11 21:23:35,506 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-01-11 21:23:35,506 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2019-01-11 21:23:35,507 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2019-01-11 21:23:35,507 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2019-01-11 21:23:35,513 INFO L448 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2019-01-11 21:23:35,513 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2019-01-11 21:23:35,513 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2019-01-11 21:23:35,513 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2019-01-11 21:23:35,513 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2019-01-11 21:23:35,513 INFO L448 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2019-01-11 21:23:35,514 INFO L444 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-01-11 21:23:35,516 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2019-01-11 21:23:35,516 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2019-01-11 21:23:35,517 INFO L448 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2019-01-11 21:23:35,517 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2019-01-11 21:23:35,517 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2019-01-11 21:23:35,517 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2019-01-11 21:23:35,517 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2019-01-11 21:23:35,517 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2019-01-11 21:23:35,517 INFO L444 ceAbstractionStarter]: At program point L179(lines 175 489) the Hoare annotation is: (let ((.cse0 (<= 4464 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 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2019-01-11 21:23:35,517 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-01-11 21:23:35,518 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2019-01-11 21:23:35,518 INFO L448 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2019-01-11 21:23:35,518 INFO L451 ceAbstractionStarter]: At program point L544(lines 11 546) the Hoare annotation is: true [2019-01-11 21:23:35,518 INFO L444 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: false [2019-01-11 21:23:35,518 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2019-01-11 21:23:35,518 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2019-01-11 21:23:35,518 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2019-01-11 21:23:35,518 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-01-11 21:23:35,518 INFO L444 ceAbstractionStarter]: At program point L149(lines 145 499) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse3 .cse2) (and .cse0 .cse1 .cse3 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-01-11 21:23:35,519 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-11 21:23:35,521 INFO L444 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse11 (= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse9 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse10 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse2 .cse3) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4480) .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse4 .cse5) (and .cse2 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse8 .cse5 .cse7) (and .cse9 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10) (and .cse11 .cse2) (and .cse6 .cse4 .cse7) (and .cse4 .cse3 .cse5) (and .cse11 .cse4 .cse5) (and .cse9 .cse10 .cse4 .cse8 .cse5 .cse7) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4464) .cse4 .cse5) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse2) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4368) .cse2) (and .cse2 .cse5) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4496) .cse4 .cse5))) [2019-01-11 21:23:35,521 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-01-11 21:23:35,521 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2019-01-11 21:23:35,521 INFO L448 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2019-01-11 21:23:35,521 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2019-01-11 21:23:35,522 INFO L448 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2019-01-11 21:23:35,522 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-01-11 21:23:35,522 INFO L448 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2019-01-11 21:23:35,522 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2019-01-11 21:23:35,522 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2019-01-11 21:23:35,522 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2019-01-11 21:23:35,522 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2019-01-11 21:23:35,522 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:23:35,522 INFO L444 ceAbstractionStarter]: At program point L185(lines 181 487) the Hoare annotation is: (let ((.cse0 (<= 4464 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 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2019-01-11 21:23:35,523 INFO L444 ceAbstractionStarter]: At program point L119(lines 115 509) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-01-11 21:23:35,523 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-01-11 21:23:35,523 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2019-01-11 21:23:35,523 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2019-01-11 21:23:35,523 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-01-11 21:23:35,523 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2019-01-11 21:23:35,523 INFO L448 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2019-01-11 21:23:35,523 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2019-01-11 21:23:35,523 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2019-01-11 21:23:35,523 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2019-01-11 21:23:35,523 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2019-01-11 21:23:35,523 INFO L448 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2019-01-11 21:23:35,524 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2019-01-11 21:23:35,524 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2019-01-11 21:23:35,526 INFO L448 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2019-01-11 21:23:35,526 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:23:35,526 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2019-01-11 21:23:35,526 INFO L448 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2019-01-11 21:23:35,526 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2019-01-11 21:23:35,526 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2019-01-11 21:23:35,526 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2019-01-11 21:23:35,526 INFO L448 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2019-01-11 21:23:35,527 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2019-01-11 21:23:35,527 INFO L444 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse1 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse2 .cse3) (and .cse0 .cse4 .cse3))) [2019-01-11 21:23:35,527 INFO L444 ceAbstractionStarter]: At program point L125(lines 121 507) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-01-11 21:23:35,527 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-01-11 21:23:35,527 INFO L451 ceAbstractionStarter]: At program point L555(lines 547 557) the Hoare annotation is: true [2019-01-11 21:23:35,527 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-01-11 21:23:35,527 INFO L448 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2019-01-11 21:23:35,527 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2019-01-11 21:23:35,527 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2019-01-11 21:23:35,528 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2019-01-11 21:23:35,528 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2019-01-11 21:23:35,528 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:23:35,528 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-01-11 21:23:35,528 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-01-11 21:23:35,528 INFO L444 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse2 .cse4 .cse3) (and .cse0 .cse2 .cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2))) [2019-01-11 21:23:35,528 INFO L444 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-01-11 21:23:35,528 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-01-11 21:23:35,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2019-01-11 21:23:35,533 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2019-01-11 21:23:35,533 INFO L448 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2019-01-11 21:23:35,533 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2019-01-11 21:23:35,533 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 75 545) no Hoare annotation was computed. [2019-01-11 21:23:35,533 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2019-01-11 21:23:35,533 INFO L448 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2019-01-11 21:23:35,533 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2019-01-11 21:23:35,533 INFO L448 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2019-01-11 21:23:35,533 INFO L451 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2019-01-11 21:23:35,534 INFO L444 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-01-11 21:23:35,534 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-01-11 21:23:35,534 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-01-11 21:23:35,534 INFO L448 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2019-01-11 21:23:35,534 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2019-01-11 21:23:35,534 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-01-11 21:23:35,534 INFO L448 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2019-01-11 21:23:35,534 INFO L448 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2019-01-11 21:23:35,534 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2019-01-11 21:23:35,535 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2019-01-11 21:23:35,535 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2019-01-11 21:23:35,535 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2019-01-11 21:23:35,535 INFO L444 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-01-11 21:23:35,535 INFO L444 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__state~0 12292))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse0))) [2019-01-11 21:23:35,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:23:35 BoogieIcfgContainer [2019-01-11 21:23:35,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:23:35,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:23:35,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:23:35,585 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:23:35,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:08" (3/4) ... [2019-01-11 21:23:35,592 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:23:35,612 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:23:35,613 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:23:35,760 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:23:35,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:23:35,765 INFO L168 Benchmark]: Toolchain (without parser) took 28755.84 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 579.3 MB). Free memory was 952.7 MB in the beginning and 1.4 GB in the end (delta: -456.7 MB). Peak memory consumption was 122.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:35,767 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-11 21:23:35,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.15 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:35,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 161.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -231.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:35,768 INFO L168 Benchmark]: Boogie Preprocessor took 59.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:35,769 INFO L168 Benchmark]: RCFGBuilder took 1192.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:35,771 INFO L168 Benchmark]: TraceAbstraction took 26749.38 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 419.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -331.0 MB). Peak memory consumption was 606.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:35,772 INFO L168 Benchmark]: Witness Printer took 179.85 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:35,775 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.16 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 407.15 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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 161.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -231.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1192.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26749.38 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 419.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -331.0 MB). Peak memory consumption was 606.9 MB. Max. memory is 11.5 GB. * Witness Printer took 179.85 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB 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: 543]: 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: 139]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && s__hit == 0) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state == 12292) || (((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) && s__state == 12292) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && s__hit == 0) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) || ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) - InvariantResult [Line: 547]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4480 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || (((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 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)) || (s__state == 4512 && blastFlag <= 2)) || ((s__state <= 3 && s__s3__tmp__new_cipher__algorithms == 256) && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__new_cipher__algorithms == 256 && s__state == 4528) && s__hit == 0)) || ((s__state == 4512 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state == 4464 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || (s__state == 4384 && blastFlag <= 2)) || (s__state == 4368 && blastFlag <= 2)) || (blastFlag <= 2 && s__hit == 0)) || ((s__state == 4496 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && s__hit == 0) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((4560 <= s__state && blastFlag <= 4) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || ((4560 <= s__state && blastFlag <= 2) && s__hit == 0) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && s__hit == 0) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || ((((s__state <= 4560 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && s__hit == 0) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) || ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && s__hit == 0) || ((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 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) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || (blastFlag <= 2 && s__hit == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && s__hit == 0) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && s__hit == 0) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. SAFE Result, 26.6s OverallTime, 23 OverallIterations, 18 TraceHistogramMax, 16.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 4460 SDtfs, 1516 SDslu, 2672 SDs, 0 SdLazy, 2748 SolverSat, 408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1181 GetRequests, 1149 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9585occurred in iteration=21, 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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 4007 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 325 NumberOfFragments, 660 HoareAnnotationTreeSize, 22 FomulaSimplifications, 12271 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1807 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 5652 NumberOfCodeBlocks, 5652 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5626 ConstructedInterpolants, 0 QuantifiedInterpolants, 2278652 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1911 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 18665/18734 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...