./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/email_spec0_product11_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/product-lines/email_spec0_product11_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 8636c856cee4a943114b47de6348e0f03ee97db1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-12 14:36:37,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:36:37,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:36:37,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:36:37,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:36:37,103 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:36:37,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:36:37,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:36:37,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:36:37,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:36:37,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:36:37,113 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:36:37,114 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:36:37,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:36:37,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:36:37,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:36:37,118 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:36:37,119 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:36:37,121 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:36:37,123 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:36:37,124 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:36:37,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:36:37,128 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:36:37,128 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:36:37,128 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:36:37,129 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:36:37,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:36:37,133 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:36:37,134 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:36:37,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:36:37,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:36:37,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:36:37,139 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:36:37,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:36:37,140 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:36:37,141 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:36:37,141 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:36:37,168 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:36:37,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:36:37,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:36:37,170 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:36:37,170 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:36:37,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:36:37,171 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:36:37,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:36:37,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:36:37,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:36:37,172 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:36:37,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:36:37,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:36:37,172 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:36:37,172 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:36:37,172 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:36:37,172 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:36:37,173 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:36:37,173 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:36:37,174 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:36:37,174 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:36:37,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:36:37,174 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:36:37,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:36:37,174 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:36:37,175 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:36:37,175 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:36:37,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:36:37,175 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 -> 8636c856cee4a943114b47de6348e0f03ee97db1 [2019-01-12 14:36:37,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:36:37,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:36:37,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:36:37,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:36:37,246 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:36:37,248 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec0_product11_true-unreach-call_true-termination.cil.c [2019-01-12 14:36:37,297 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1389c27d/489ddd672ecc415697dff5f7b9958ea0/FLAG02e6bfcf7 [2019-01-12 14:36:37,846 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:36:37,850 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec0_product11_true-unreach-call_true-termination.cil.c [2019-01-12 14:36:37,870 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1389c27d/489ddd672ecc415697dff5f7b9958ea0/FLAG02e6bfcf7 [2019-01-12 14:36:38,127 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1389c27d/489ddd672ecc415697dff5f7b9958ea0 [2019-01-12 14:36:38,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:36:38,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:36:38,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:36:38,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:36:38,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:36:38,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:36:38" (1/1) ... [2019-01-12 14:36:38,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4620c393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:38, skipping insertion in model container [2019-01-12 14:36:38,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:36:38" (1/1) ... [2019-01-12 14:36:38,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:36:38,240 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:36:38,905 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:36:38,922 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:36:39,192 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:36:39,277 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:36:39,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39 WrapperNode [2019-01-12 14:36:39,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:36:39,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:36:39,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:36:39,278 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:36:39,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39" (1/1) ... [2019-01-12 14:36:39,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39" (1/1) ... [2019-01-12 14:36:39,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:36:39,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:36:39,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:36:39,458 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:36:39,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39" (1/1) ... [2019-01-12 14:36:39,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39" (1/1) ... [2019-01-12 14:36:39,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39" (1/1) ... [2019-01-12 14:36:39,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39" (1/1) ... [2019-01-12 14:36:39,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39" (1/1) ... [2019-01-12 14:36:39,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39" (1/1) ... [2019-01-12 14:36:39,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39" (1/1) ... [2019-01-12 14:36:39,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:36:39,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:36:39,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:36:39,560 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:36:39,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39" (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-12 14:36:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-12 14:36:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:36:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:36:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:36:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:36:42,698 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:36:42,699 INFO L286 CfgBuilder]: Removed 219 assue(true) statements. [2019-01-12 14:36:42,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:36:42 BoogieIcfgContainer [2019-01-12 14:36:42,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:36:42,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:36:42,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:36:42,705 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:36:42,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:36:38" (1/3) ... [2019-01-12 14:36:42,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f7eaff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:36:42, skipping insertion in model container [2019-01-12 14:36:42,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:39" (2/3) ... [2019-01-12 14:36:42,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f7eaff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:36:42, skipping insertion in model container [2019-01-12 14:36:42,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:36:42" (3/3) ... [2019-01-12 14:36:42,711 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product11_true-unreach-call_true-termination.cil.c [2019-01-12 14:36:42,719 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:36:42,727 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 14:36:42,743 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 14:36:42,777 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:36:42,778 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:36:42,778 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:36:42,779 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:36:42,779 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:36:42,779 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:36:42,779 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:36:42,779 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:36:42,779 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:36:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states. [2019-01-12 14:36:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 14:36:42,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:42,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:36:42,821 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:42,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:42,827 INFO L82 PathProgramCache]: Analyzing trace with hash 48512962, now seen corresponding path program 1 times [2019-01-12 14:36:42,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:42,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:42,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:42,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:43,221 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-12 14:36:43,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:43,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:43,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:43,243 INFO L87 Difference]: Start difference. First operand 329 states. Second operand 3 states. [2019-01-12 14:36:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:43,515 INFO L93 Difference]: Finished difference Result 952 states and 1658 transitions. [2019-01-12 14:36:43,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:43,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-01-12 14:36:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:43,546 INFO L225 Difference]: With dead ends: 952 [2019-01-12 14:36:43,546 INFO L226 Difference]: Without dead ends: 606 [2019-01-12 14:36:43,552 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-12 14:36:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-01-12 14:36:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 312. [2019-01-12 14:36:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-12 14:36:43,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 539 transitions. [2019-01-12 14:36:43,621 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 539 transitions. Word has length 40 [2019-01-12 14:36:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:43,622 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 539 transitions. [2019-01-12 14:36:43,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 539 transitions. [2019-01-12 14:36:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-12 14:36:43,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:43,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:36:43,627 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:43,628 INFO L82 PathProgramCache]: Analyzing trace with hash 802740885, now seen corresponding path program 1 times [2019-01-12 14:36:43,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:43,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:43,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:43,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:43,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:44,002 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-12 14:36:44,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:44,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:36:44,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:36:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:36:44,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:36:44,008 INFO L87 Difference]: Start difference. First operand 312 states and 539 transitions. Second operand 5 states. [2019-01-12 14:36:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:44,911 INFO L93 Difference]: Finished difference Result 885 states and 1533 transitions. [2019-01-12 14:36:44,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:36:44,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-01-12 14:36:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:44,918 INFO L225 Difference]: With dead ends: 885 [2019-01-12 14:36:44,918 INFO L226 Difference]: Without dead ends: 592 [2019-01-12 14:36:44,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:36:44,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-01-12 14:36:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 312. [2019-01-12 14:36:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-12 14:36:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 538 transitions. [2019-01-12 14:36:44,970 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 538 transitions. Word has length 42 [2019-01-12 14:36:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:44,971 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 538 transitions. [2019-01-12 14:36:44,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:36:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 538 transitions. [2019-01-12 14:36:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 14:36:44,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:44,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:36:44,975 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:44,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash -447724126, now seen corresponding path program 1 times [2019-01-12 14:36:44,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:44,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:44,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:45,134 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-12 14:36:45,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:45,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:45,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:45,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:45,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:45,137 INFO L87 Difference]: Start difference. First operand 312 states and 538 transitions. Second operand 3 states. [2019-01-12 14:36:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:45,222 INFO L93 Difference]: Finished difference Result 606 states and 1050 transitions. [2019-01-12 14:36:45,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:45,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-12 14:36:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:45,231 INFO L225 Difference]: With dead ends: 606 [2019-01-12 14:36:45,232 INFO L226 Difference]: Without dead ends: 317 [2019-01-12 14:36:45,233 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-12 14:36:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-01-12 14:36:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 312. [2019-01-12 14:36:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-12 14:36:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 535 transitions. [2019-01-12 14:36:45,264 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 535 transitions. Word has length 43 [2019-01-12 14:36:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:45,264 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 535 transitions. [2019-01-12 14:36:45,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 535 transitions. [2019-01-12 14:36:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 14:36:45,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:45,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:36:45,272 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash -806251715, now seen corresponding path program 1 times [2019-01-12 14:36:45,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:45,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:45,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:45,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:45,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:45,572 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-12 14:36:45,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:45,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:36:45,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:36:45,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:36:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:36:45,576 INFO L87 Difference]: Start difference. First operand 312 states and 535 transitions. Second operand 5 states. [2019-01-12 14:36:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:46,442 INFO L93 Difference]: Finished difference Result 875 states and 1513 transitions. [2019-01-12 14:36:46,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:36:46,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-01-12 14:36:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:46,449 INFO L225 Difference]: With dead ends: 875 [2019-01-12 14:36:46,449 INFO L226 Difference]: Without dead ends: 590 [2019-01-12 14:36:46,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:36:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-01-12 14:36:46,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 312. [2019-01-12 14:36:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-12 14:36:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 534 transitions. [2019-01-12 14:36:46,479 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 534 transitions. Word has length 45 [2019-01-12 14:36:46,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:46,480 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 534 transitions. [2019-01-12 14:36:46,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:36:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 534 transitions. [2019-01-12 14:36:46,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 14:36:46,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:46,482 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, 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-12 14:36:46,483 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:46,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:46,484 INFO L82 PathProgramCache]: Analyzing trace with hash -692287456, now seen corresponding path program 1 times [2019-01-12 14:36:46,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:46,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:46,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:46,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:46,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:46,769 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-12 14:36:46,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:46,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:36:46,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:36:46,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:36:46,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:36:46,772 INFO L87 Difference]: Start difference. First operand 312 states and 534 transitions. Second operand 5 states. [2019-01-12 14:36:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:47,261 INFO L93 Difference]: Finished difference Result 880 states and 1517 transitions. [2019-01-12 14:36:47,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:36:47,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-12 14:36:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:47,268 INFO L225 Difference]: With dead ends: 880 [2019-01-12 14:36:47,269 INFO L226 Difference]: Without dead ends: 595 [2019-01-12 14:36:47,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:36:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-01-12 14:36:47,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 312. [2019-01-12 14:36:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-12 14:36:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 533 transitions. [2019-01-12 14:36:47,309 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 533 transitions. Word has length 46 [2019-01-12 14:36:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:47,309 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 533 transitions. [2019-01-12 14:36:47,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:36:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 533 transitions. [2019-01-12 14:36:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 14:36:47,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:47,313 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, 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-12 14:36:47,313 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:47,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1299263688, now seen corresponding path program 1 times [2019-01-12 14:36:47,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:47,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:47,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:47,429 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-12 14:36:47,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:47,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:47,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:47,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:47,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:47,431 INFO L87 Difference]: Start difference. First operand 312 states and 533 transitions. Second operand 3 states. [2019-01-12 14:36:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:47,526 INFO L93 Difference]: Finished difference Result 386 states and 642 transitions. [2019-01-12 14:36:47,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:47,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-01-12 14:36:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:47,530 INFO L225 Difference]: With dead ends: 386 [2019-01-12 14:36:47,530 INFO L226 Difference]: Without dead ends: 315 [2019-01-12 14:36:47,531 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-12 14:36:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-12 14:36:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-01-12 14:36:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-12 14:36:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 535 transitions. [2019-01-12 14:36:47,560 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 535 transitions. Word has length 47 [2019-01-12 14:36:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:47,560 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 535 transitions. [2019-01-12 14:36:47,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 535 transitions. [2019-01-12 14:36:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 14:36:47,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:47,563 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 14:36:47,564 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:47,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:47,564 INFO L82 PathProgramCache]: Analyzing trace with hash -527622090, now seen corresponding path program 1 times [2019-01-12 14:36:47,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:47,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:47,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:47,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:47,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:47,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:47,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:47,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:47,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:47,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:47,666 INFO L87 Difference]: Start difference. First operand 314 states and 535 transitions. Second operand 3 states. [2019-01-12 14:36:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:47,787 INFO L93 Difference]: Finished difference Result 828 states and 1429 transitions. [2019-01-12 14:36:47,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:47,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-01-12 14:36:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:47,792 INFO L225 Difference]: With dead ends: 828 [2019-01-12 14:36:47,792 INFO L226 Difference]: Without dead ends: 545 [2019-01-12 14:36:47,793 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-12 14:36:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-01-12 14:36:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 474. [2019-01-12 14:36:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-01-12 14:36:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 828 transitions. [2019-01-12 14:36:47,850 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 828 transitions. Word has length 53 [2019-01-12 14:36:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:47,851 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 828 transitions. [2019-01-12 14:36:47,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 828 transitions. [2019-01-12 14:36:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 14:36:47,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:47,853 INFO L402 BasicCegarLoop]: trace histogram [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-12 14:36:47,853 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash 424261333, now seen corresponding path program 1 times [2019-01-12 14:36:47,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:47,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:47,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:47,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:48,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:48,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 14:36:48,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:36:48,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:36:48,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:36:48,462 INFO L87 Difference]: Start difference. First operand 474 states and 828 transitions. Second operand 10 states. [2019-01-12 14:36:49,668 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 14:36:51,263 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 14:36:52,135 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 14:36:52,457 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-12 14:36:53,506 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 14:36:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:53,599 INFO L93 Difference]: Finished difference Result 917 states and 1436 transitions. [2019-01-12 14:36:53,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 14:36:53,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-01-12 14:36:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:53,604 INFO L225 Difference]: With dead ends: 917 [2019-01-12 14:36:53,604 INFO L226 Difference]: Without dead ends: 868 [2019-01-12 14:36:53,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 14:36:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-01-12 14:36:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 508. [2019-01-12 14:36:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-01-12 14:36:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 875 transitions. [2019-01-12 14:36:53,659 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 875 transitions. Word has length 54 [2019-01-12 14:36:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:53,660 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 875 transitions. [2019-01-12 14:36:53,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:36:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 875 transitions. [2019-01-12 14:36:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 14:36:53,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:53,662 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 14:36:53,663 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:53,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash -315862889, now seen corresponding path program 1 times [2019-01-12 14:36:53,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:53,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:53,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:53,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:53,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:53,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:36:53,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:36:53,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:36:53,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:36:53,951 INFO L87 Difference]: Start difference. First operand 508 states and 875 transitions. Second operand 5 states. [2019-01-12 14:36:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:54,820 INFO L93 Difference]: Finished difference Result 1139 states and 1926 transitions. [2019-01-12 14:36:54,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:36:54,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-01-12 14:36:54,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:54,828 INFO L225 Difference]: With dead ends: 1139 [2019-01-12 14:36:54,829 INFO L226 Difference]: Without dead ends: 1057 [2019-01-12 14:36:54,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:36:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-01-12 14:36:54,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 977. [2019-01-12 14:36:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-12 14:36:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1699 transitions. [2019-01-12 14:36:54,962 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1699 transitions. Word has length 55 [2019-01-12 14:36:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:54,962 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1699 transitions. [2019-01-12 14:36:54,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:36:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1699 transitions. [2019-01-12 14:36:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 14:36:54,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:54,964 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 14:36:54,964 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash -547065452, now seen corresponding path program 1 times [2019-01-12 14:36:54,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:54,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:54,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:55,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:55,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:36:55,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:36:55,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:36:55,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:36:55,224 INFO L87 Difference]: Start difference. First operand 977 states and 1699 transitions. Second operand 6 states. [2019-01-12 14:36:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:55,451 INFO L93 Difference]: Finished difference Result 1223 states and 2036 transitions. [2019-01-12 14:36:55,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:36:55,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-01-12 14:36:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:55,457 INFO L225 Difference]: With dead ends: 1223 [2019-01-12 14:36:55,457 INFO L226 Difference]: Without dead ends: 1053 [2019-01-12 14:36:55,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:36:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-01-12 14:36:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 969. [2019-01-12 14:36:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-01-12 14:36:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1685 transitions. [2019-01-12 14:36:55,543 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1685 transitions. Word has length 55 [2019-01-12 14:36:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:55,543 INFO L480 AbstractCegarLoop]: Abstraction has 969 states and 1685 transitions. [2019-01-12 14:36:55,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:36:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1685 transitions. [2019-01-12 14:36:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-12 14:36:55,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:55,545 INFO L402 BasicCegarLoop]: trace histogram [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-12 14:36:55,546 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:55,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:55,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1660760208, now seen corresponding path program 1 times [2019-01-12 14:36:55,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:55,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:55,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:55,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:55,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 14:36:55,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:36:55,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:36:55,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:36:55,896 INFO L87 Difference]: Start difference. First operand 969 states and 1685 transitions. Second operand 9 states. [2019-01-12 14:36:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:56,579 INFO L93 Difference]: Finished difference Result 1498 states and 2409 transitions. [2019-01-12 14:36:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 14:36:56,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-01-12 14:36:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:56,587 INFO L225 Difference]: With dead ends: 1498 [2019-01-12 14:36:56,587 INFO L226 Difference]: Without dead ends: 1340 [2019-01-12 14:36:56,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2019-01-12 14:36:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-01-12 14:36:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1048. [2019-01-12 14:36:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-01-12 14:36:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1795 transitions. [2019-01-12 14:36:56,707 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1795 transitions. Word has length 56 [2019-01-12 14:36:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:56,708 INFO L480 AbstractCegarLoop]: Abstraction has 1048 states and 1795 transitions. [2019-01-12 14:36:56,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:36:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1795 transitions. [2019-01-12 14:36:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:36:56,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:56,711 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 14:36:56,711 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:56,711 INFO L82 PathProgramCache]: Analyzing trace with hash 505798560, now seen corresponding path program 1 times [2019-01-12 14:36:56,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:56,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:56,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:56,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:56,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:36:56,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:36:56,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:36:56,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:36:56,889 INFO L87 Difference]: Start difference. First operand 1048 states and 1795 transitions. Second operand 4 states. [2019-01-12 14:36:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:57,099 INFO L93 Difference]: Finished difference Result 1139 states and 1911 transitions. [2019-01-12 14:36:57,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:36:57,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-12 14:36:57,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:57,104 INFO L225 Difference]: With dead ends: 1139 [2019-01-12 14:36:57,104 INFO L226 Difference]: Without dead ends: 955 [2019-01-12 14:36:57,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12 14:36:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-01-12 14:36:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 920. [2019-01-12 14:36:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-01-12 14:36:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1604 transitions. [2019-01-12 14:36:57,179 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1604 transitions. Word has length 57 [2019-01-12 14:36:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:57,179 INFO L480 AbstractCegarLoop]: Abstraction has 920 states and 1604 transitions. [2019-01-12 14:36:57,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:36:57,180 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1604 transitions. [2019-01-12 14:36:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-12 14:36:57,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:57,182 INFO L402 BasicCegarLoop]: trace histogram [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-12 14:36:57,182 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:57,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1737575739, now seen corresponding path program 1 times [2019-01-12 14:36:57,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:57,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:57,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:57,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:57,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:57,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:57,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:57,265 INFO L87 Difference]: Start difference. First operand 920 states and 1604 transitions. Second operand 3 states. [2019-01-12 14:36:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:57,493 INFO L93 Difference]: Finished difference Result 2694 states and 4724 transitions. [2019-01-12 14:36:57,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:57,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-01-12 14:36:57,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:57,504 INFO L225 Difference]: With dead ends: 2694 [2019-01-12 14:36:57,505 INFO L226 Difference]: Without dead ends: 1805 [2019-01-12 14:36:57,507 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-12 14:36:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-01-12 14:36:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1660. [2019-01-12 14:36:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-01-12 14:36:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2958 transitions. [2019-01-12 14:36:57,725 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2958 transitions. Word has length 62 [2019-01-12 14:36:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:57,725 INFO L480 AbstractCegarLoop]: Abstraction has 1660 states and 2958 transitions. [2019-01-12 14:36:57,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2958 transitions. [2019-01-12 14:36:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 14:36:57,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:57,730 INFO L402 BasicCegarLoop]: trace histogram [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-12 14:36:57,730 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash -661936822, now seen corresponding path program 1 times [2019-01-12 14:36:57,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:57,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:57,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:57,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:57,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:57,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:57,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:57,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:57,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:57,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:57,828 INFO L87 Difference]: Start difference. First operand 1660 states and 2958 transitions. Second operand 3 states. [2019-01-12 14:36:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:58,026 INFO L93 Difference]: Finished difference Result 4878 states and 8722 transitions. [2019-01-12 14:36:58,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:58,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-01-12 14:36:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:58,040 INFO L225 Difference]: With dead ends: 4878 [2019-01-12 14:36:58,041 INFO L226 Difference]: Without dead ends: 3249 [2019-01-12 14:36:58,044 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-12 14:36:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-01-12 14:36:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3104. [2019-01-12 14:36:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-01-12 14:36:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 5598 transitions. [2019-01-12 14:36:58,243 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 5598 transitions. Word has length 63 [2019-01-12 14:36:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:58,243 INFO L480 AbstractCegarLoop]: Abstraction has 3104 states and 5598 transitions. [2019-01-12 14:36:58,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 5598 transitions. [2019-01-12 14:36:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 14:36:58,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:58,248 INFO L402 BasicCegarLoop]: trace histogram [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-12 14:36:58,248 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:58,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1211094141, now seen corresponding path program 1 times [2019-01-12 14:36:58,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:58,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:58,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:58,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:58,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:58,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:58,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:58,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:58,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:58,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:58,336 INFO L87 Difference]: Start difference. First operand 3104 states and 5598 transitions. Second operand 3 states. [2019-01-12 14:36:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:58,589 INFO L93 Difference]: Finished difference Result 8754 states and 15802 transitions. [2019-01-12 14:36:58,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:58,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-12 14:36:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:58,614 INFO L225 Difference]: With dead ends: 8754 [2019-01-12 14:36:58,614 INFO L226 Difference]: Without dead ends: 5681 [2019-01-12 14:36:58,620 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-12 14:36:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-01-12 14:36:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 5536. [2019-01-12 14:36:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5536 states. [2019-01-12 14:36:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5536 states to 5536 states and 10030 transitions. [2019-01-12 14:36:58,970 INFO L78 Accepts]: Start accepts. Automaton has 5536 states and 10030 transitions. Word has length 64 [2019-01-12 14:36:58,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:58,970 INFO L480 AbstractCegarLoop]: Abstraction has 5536 states and 10030 transitions. [2019-01-12 14:36:58,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:58,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5536 states and 10030 transitions. [2019-01-12 14:36:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 14:36:58,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:58,975 INFO L402 BasicCegarLoop]: trace histogram [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-12 14:36:58,975 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:58,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1922447845, now seen corresponding path program 1 times [2019-01-12 14:36:58,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:58,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:58,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:58,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:58,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:59,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:59,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:59,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:59,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:59,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:59,084 INFO L87 Difference]: Start difference. First operand 5536 states and 10030 transitions. Second operand 3 states. [2019-01-12 14:36:59,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:59,534 INFO L93 Difference]: Finished difference Result 15554 states and 28186 transitions. [2019-01-12 14:36:59,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:59,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-01-12 14:36:59,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:59,573 INFO L225 Difference]: With dead ends: 15554 [2019-01-12 14:36:59,573 INFO L226 Difference]: Without dead ends: 10049 [2019-01-12 14:36:59,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10049 states. [2019-01-12 14:36:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10049 to 9904. [2019-01-12 14:36:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9904 states. [2019-01-12 14:37:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9904 states to 9904 states and 17966 transitions. [2019-01-12 14:37:00,016 INFO L78 Accepts]: Start accepts. Automaton has 9904 states and 17966 transitions. Word has length 65 [2019-01-12 14:37:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:37:00,016 INFO L480 AbstractCegarLoop]: Abstraction has 9904 states and 17966 transitions. [2019-01-12 14:37:00,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:37:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 9904 states and 17966 transitions. [2019-01-12 14:37:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-12 14:37:00,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:37:00,021 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 14:37:00,021 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:37:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:37:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash -459560082, now seen corresponding path program 1 times [2019-01-12 14:37:00,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:37:00,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:37:00,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:37:00,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:37:00,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:37:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:37:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:37:00,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:37:00,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:37:00,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:37:00,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:37:00,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:37:00,195 INFO L87 Difference]: Start difference. First operand 9904 states and 17966 transitions. Second operand 4 states. [2019-01-12 14:37:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:37:00,675 INFO L93 Difference]: Finished difference Result 9935 states and 18008 transitions. [2019-01-12 14:37:00,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:37:00,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-12 14:37:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:37:00,676 INFO L225 Difference]: With dead ends: 9935 [2019-01-12 14:37:00,677 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:37:00,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12 14:37:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:37:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:37:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:37:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:37:00,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2019-01-12 14:37:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:37:00,685 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:37:00,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:37:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:37:00,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:37:00,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:37:00,852 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 24 [2019-01-12 14:37:01,030 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 105 [2019-01-12 14:37:01,136 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 24 [2019-01-12 14:37:01,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,554 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 154 [2019-01-12 14:37:01,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:02,404 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 152 [2019-01-12 14:37:02,525 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 120 [2019-01-12 14:37:03,202 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 154 [2019-01-12 14:37:04,019 WARN L181 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 209 [2019-01-12 14:37:04,656 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 152 [2019-01-12 14:37:04,871 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2019-01-12 14:37:05,137 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 154 [2019-01-12 14:37:05,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,281 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2019-01-12 14:37:06,638 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 154 [2019-01-12 14:37:07,164 WARN L181 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 195 [2019-01-12 14:37:07,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:07,664 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2019-01-12 14:37:07,843 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-01-12 14:37:08,871 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 104 DAG size of output: 43 [2019-01-12 14:37:10,040 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 153 DAG size of output: 41 [2019-01-12 14:37:10,779 WARN L181 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 41 [2019-01-12 14:37:11,688 WARN L181 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 39 [2019-01-12 14:37:12,187 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 41 [2019-01-12 14:37:12,501 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 32 [2019-01-12 14:37:12,748 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 25 [2019-01-12 14:37:13,609 WARN L181 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 41 [2019-01-12 14:37:13,776 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 17 [2019-01-12 14:37:14,261 WARN L181 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 43 [2019-01-12 14:37:14,587 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 28 [2019-01-12 14:37:15,974 WARN L181 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 208 DAG size of output: 22 [2019-01-12 14:37:16,407 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2019-01-12 14:37:16,985 WARN L181 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 43 [2019-01-12 14:37:17,539 WARN L181 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 41 [2019-01-12 14:37:18,408 WARN L181 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 39 [2019-01-12 14:37:18,643 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 28 [2019-01-12 14:37:19,040 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 32 [2019-01-12 14:37:19,801 WARN L181 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 41 [2019-01-12 14:37:20,152 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 36 [2019-01-12 14:37:20,618 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 24 [2019-01-12 14:37:21,120 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2019-01-12 14:37:21,385 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 22 [2019-01-12 14:37:21,571 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 21 [2019-01-12 14:37:22,343 WARN L181 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 41 [2019-01-12 14:37:23,407 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 194 DAG size of output: 22 [2019-01-12 14:37:23,619 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 26 [2019-01-12 14:37:24,040 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 37 [2019-01-12 14:37:24,136 INFO L448 ceAbstractionStarter]: For program point L1357(lines 1357 1364) no Hoare annotation was computed. [2019-01-12 14:37:24,136 INFO L448 ceAbstractionStarter]: For program point L2282(lines 2282 2290) no Hoare annotation was computed. [2019-01-12 14:37:24,136 INFO L448 ceAbstractionStarter]: For program point L2282-2(lines 2282 2290) no Hoare annotation was computed. [2019-01-12 14:37:24,136 INFO L448 ceAbstractionStarter]: For program point L2282-4(lines 2282 2290) no Hoare annotation was computed. [2019-01-12 14:37:24,137 INFO L448 ceAbstractionStarter]: For program point L2282-6(lines 2282 2290) no Hoare annotation was computed. [2019-01-12 14:37:24,137 INFO L448 ceAbstractionStarter]: For program point L2282-8(lines 2282 2290) no Hoare annotation was computed. [2019-01-12 14:37:24,137 INFO L448 ceAbstractionStarter]: For program point L2282-10(lines 2282 2290) no Hoare annotation was computed. [2019-01-12 14:37:24,137 INFO L444 ceAbstractionStarter]: At program point L763(lines 744 765) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op1~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,138 INFO L448 ceAbstractionStarter]: For program point L1424(lines 1424 1431) no Hoare annotation was computed. [2019-01-12 14:37:24,138 INFO L448 ceAbstractionStarter]: For program point L1293(lines 1292 1459) no Hoare annotation was computed. [2019-01-12 14:37:24,138 INFO L448 ceAbstractionStarter]: For program point L1294(lines 1294 1298) no Hoare annotation was computed. [2019-01-12 14:37:24,138 INFO L448 ceAbstractionStarter]: For program point L2285(lines 2285 2289) no Hoare annotation was computed. [2019-01-12 14:37:24,138 INFO L448 ceAbstractionStarter]: For program point L2285-3(lines 2285 2289) no Hoare annotation was computed. [2019-01-12 14:37:24,138 INFO L444 ceAbstractionStarter]: At program point L2285-2(lines 1 2755) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,139 INFO L444 ceAbstractionStarter]: At program point L2285-5(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 2) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (= 0 ~__ste_client_forwardReceiver1~0) (= ULTIMATE.start_setClientId_~handle ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,139 INFO L448 ceAbstractionStarter]: For program point L2285-6(lines 2285 2289) no Hoare annotation was computed. [2019-01-12 14:37:24,139 INFO L448 ceAbstractionStarter]: For program point L2285-9(lines 2285 2289) no Hoare annotation was computed. [2019-01-12 14:37:24,139 INFO L444 ceAbstractionStarter]: At program point L2285-8(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,139 INFO L444 ceAbstractionStarter]: At program point L2285-11(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_test_~op3~0 0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,140 INFO L448 ceAbstractionStarter]: For program point L2285-12(lines 2285 2289) no Hoare annotation was computed. [2019-01-12 14:37:24,140 INFO L448 ceAbstractionStarter]: For program point L2285-15(lines 2285 2289) no Hoare annotation was computed. [2019-01-12 14:37:24,140 INFO L444 ceAbstractionStarter]: At program point L2285-14(lines 846 855) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,140 INFO L444 ceAbstractionStarter]: At program point L2285-17(lines 836 845) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,140 INFO L444 ceAbstractionStarter]: At program point L2617-1(lines 2591 2634) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op1~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,140 INFO L448 ceAbstractionStarter]: For program point L2617(lines 2617 2629) no Hoare annotation was computed. [2019-01-12 14:37:24,140 INFO L444 ceAbstractionStarter]: At program point L2617-3(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op4~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,140 INFO L448 ceAbstractionStarter]: For program point L2617-2(lines 2617 2629) no Hoare annotation was computed. [2019-01-12 14:37:24,140 INFO L444 ceAbstractionStarter]: At program point L2617-5(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_test_~op5~0 0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,141 INFO L448 ceAbstractionStarter]: For program point L2617-4(lines 2617 2629) no Hoare annotation was computed. [2019-01-12 14:37:24,141 INFO L444 ceAbstractionStarter]: At program point L2617-7(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,141 INFO L448 ceAbstractionStarter]: For program point L2617-6(lines 2617 2629) no Hoare annotation was computed. [2019-01-12 14:37:24,141 INFO L448 ceAbstractionStarter]: For program point L2353-1(lines 2353 2363) no Hoare annotation was computed. [2019-01-12 14:37:24,141 INFO L444 ceAbstractionStarter]: At program point L2617-9(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,141 INFO L448 ceAbstractionStarter]: For program point L2353(lines 2353 2363) no Hoare annotation was computed. [2019-01-12 14:37:24,141 INFO L448 ceAbstractionStarter]: For program point L2617-8(lines 2617 2629) no Hoare annotation was computed. [2019-01-12 14:37:24,141 INFO L448 ceAbstractionStarter]: For program point L2353-3(lines 2353 2363) no Hoare annotation was computed. [2019-01-12 14:37:24,141 INFO L448 ceAbstractionStarter]: For program point L2353-2(lines 2353 2363) no Hoare annotation was computed. [2019-01-12 14:37:24,141 INFO L448 ceAbstractionStarter]: For program point L2353-4(lines 2353 2363) no Hoare annotation was computed. [2019-01-12 14:37:24,141 INFO L448 ceAbstractionStarter]: For program point L2618(lines 2618 2626) no Hoare annotation was computed. [2019-01-12 14:37:24,142 INFO L448 ceAbstractionStarter]: For program point L2618-2(lines 2618 2626) no Hoare annotation was computed. [2019-01-12 14:37:24,142 INFO L448 ceAbstractionStarter]: For program point L2618-4(lines 2618 2626) no Hoare annotation was computed. [2019-01-12 14:37:24,143 INFO L448 ceAbstractionStarter]: For program point L2618-6(lines 2618 2626) no Hoare annotation was computed. [2019-01-12 14:37:24,144 INFO L448 ceAbstractionStarter]: For program point L2618-8(lines 2618 2626) no Hoare annotation was computed. [2019-01-12 14:37:24,144 INFO L448 ceAbstractionStarter]: For program point L2487(lines 2487 2533) no Hoare annotation was computed. [2019-01-12 14:37:24,144 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2019-01-12 14:37:24,144 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 175 183) no Hoare annotation was computed. [2019-01-12 14:37:24,144 INFO L448 ceAbstractionStarter]: For program point L175-4(lines 175 183) no Hoare annotation was computed. [2019-01-12 14:37:24,144 INFO L448 ceAbstractionStarter]: For program point L2488(lines 2488 2499) no Hoare annotation was computed. [2019-01-12 14:37:24,144 INFO L448 ceAbstractionStarter]: For program point L2621(lines 2621 2625) no Hoare annotation was computed. [2019-01-12 14:37:24,144 INFO L448 ceAbstractionStarter]: For program point L2621-3(lines 2621 2625) no Hoare annotation was computed. [2019-01-12 14:37:24,144 INFO L444 ceAbstractionStarter]: At program point L2423(lines 2376 2429) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op1~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,144 INFO L448 ceAbstractionStarter]: For program point L2621-6(lines 2621 2625) no Hoare annotation was computed. [2019-01-12 14:37:24,144 INFO L444 ceAbstractionStarter]: At program point L1366(lines 1353 1454) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,145 INFO L448 ceAbstractionStarter]: For program point L2621-9(lines 2621 2625) no Hoare annotation was computed. [2019-01-12 14:37:24,145 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1458) no Hoare annotation was computed. [2019-01-12 14:37:24,145 INFO L448 ceAbstractionStarter]: For program point L2621-12(lines 2621 2625) no Hoare annotation was computed. [2019-01-12 14:37:24,145 INFO L444 ceAbstractionStarter]: At program point L1433(lines 1420 1449) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,145 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 182) no Hoare annotation was computed. [2019-01-12 14:37:24,145 INFO L444 ceAbstractionStarter]: At program point L178-2(lines 171 186) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~rjh~0) (= 2 ~__ste_email_to0~0) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,145 INFO L448 ceAbstractionStarter]: For program point L178-3(lines 178 182) no Hoare annotation was computed. [2019-01-12 14:37:24,145 INFO L444 ceAbstractionStarter]: At program point L178-5(lines 171 186) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= 2 ~rjh~0)) (.cse2 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 (= 2 ULTIMATE.start_incoming_~client) .cse2 (= 2 ~__ste_email_to0~0) .cse3 .cse4 .cse5 .cse6) (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6))) [2019-01-12 14:37:24,145 INFO L448 ceAbstractionStarter]: For program point L178-6(lines 178 182) no Hoare annotation was computed. [2019-01-12 14:37:24,146 INFO L444 ceAbstractionStarter]: At program point L178-8(lines 171 186) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,146 INFO L448 ceAbstractionStarter]: For program point L2690(lines 2690 2706) no Hoare annotation was computed. [2019-01-12 14:37:24,146 INFO L448 ceAbstractionStarter]: For program point L2690-1(lines 2690 2706) no Hoare annotation was computed. [2019-01-12 14:37:24,146 INFO L448 ceAbstractionStarter]: For program point L2492(lines 2492 2498) no Hoare annotation was computed. [2019-01-12 14:37:24,146 INFO L448 ceAbstractionStarter]: For program point L1304(lines 1304 1311) no Hoare annotation was computed. [2019-01-12 14:37:24,146 INFO L444 ceAbstractionStarter]: At program point L2362(lines 2342 2366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op1~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,146 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1378) no Hoare annotation was computed. [2019-01-12 14:37:24,146 INFO L444 ceAbstractionStarter]: At program point L2362-2(lines 2342 2366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_test_~op5~0 0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,146 INFO L444 ceAbstractionStarter]: At program point L2362-1(lines 2342 2366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op4~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,146 INFO L444 ceAbstractionStarter]: At program point L2362-4(lines 2342 2366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,147 INFO L444 ceAbstractionStarter]: At program point L2362-3(lines 2342 2366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,147 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1445) no Hoare annotation was computed. [2019-01-12 14:37:24,147 INFO L444 ceAbstractionStarter]: At program point L1438-1(lines 1292 1459) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,147 INFO L448 ceAbstractionStarter]: For program point L2694(lines 2694 2705) no Hoare annotation was computed. [2019-01-12 14:37:24,147 INFO L448 ceAbstractionStarter]: For program point L2694-1(lines 2694 2705) no Hoare annotation was computed. [2019-01-12 14:37:24,147 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 130) no Hoare annotation was computed. [2019-01-12 14:37:24,147 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 119 130) no Hoare annotation was computed. [2019-01-12 14:37:24,147 INFO L448 ceAbstractionStarter]: For program point L2698(lines 2698 2704) no Hoare annotation was computed. [2019-01-12 14:37:24,147 INFO L448 ceAbstractionStarter]: For program point L2698-1(lines 2698 2704) no Hoare annotation was computed. [2019-01-12 14:37:24,147 INFO L448 ceAbstractionStarter]: For program point L2434(lines 2434 2470) no Hoare annotation was computed. [2019-01-12 14:37:24,147 INFO L448 ceAbstractionStarter]: For program point L2434-2(lines 2434 2470) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2434-1(lines 2434 2470) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2302(lines 2302 2318) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2434-4(lines 2434 2470) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2434-3(lines 2434 2470) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2302-2(lines 2302 2318) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2302-1(lines 2302 2318) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2302-4(lines 2302 2318) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2302-3(lines 2302 2318) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2501(lines 2501 2532) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2435(lines 2435 2443) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2435-2(lines 2435 2443) no Hoare annotation was computed. [2019-01-12 14:37:24,148 INFO L448 ceAbstractionStarter]: For program point L2435-4(lines 2435 2443) no Hoare annotation was computed. [2019-01-12 14:37:24,149 INFO L448 ceAbstractionStarter]: For program point L2435-6(lines 2435 2443) no Hoare annotation was computed. [2019-01-12 14:37:24,149 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 129) no Hoare annotation was computed. [2019-01-12 14:37:24,149 INFO L448 ceAbstractionStarter]: For program point L2435-8(lines 2435 2443) no Hoare annotation was computed. [2019-01-12 14:37:24,149 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 123 129) no Hoare annotation was computed. [2019-01-12 14:37:24,149 INFO L448 ceAbstractionStarter]: For program point L2502(lines 2502 2513) no Hoare annotation was computed. [2019-01-12 14:37:24,149 INFO L444 ceAbstractionStarter]: At program point L1313(lines 1300 1458) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,149 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:37:24,149 INFO L444 ceAbstractionStarter]: At program point L1380(lines 1367 1453) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,149 INFO L444 ceAbstractionStarter]: At program point L720(lines 700 722) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,149 INFO L444 ceAbstractionStarter]: At program point L1513(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,150 INFO L444 ceAbstractionStarter]: At program point L1513-1(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,157 INFO L448 ceAbstractionStarter]: For program point L2438(lines 2438 2442) no Hoare annotation was computed. [2019-01-12 14:37:24,157 INFO L448 ceAbstractionStarter]: For program point L2306(lines 2306 2317) no Hoare annotation was computed. [2019-01-12 14:37:24,157 INFO L448 ceAbstractionStarter]: For program point L2438-3(lines 2438 2442) no Hoare annotation was computed. [2019-01-12 14:37:24,157 INFO L448 ceAbstractionStarter]: For program point L2306-2(lines 2306 2317) no Hoare annotation was computed. [2019-01-12 14:37:24,157 INFO L448 ceAbstractionStarter]: For program point L2438-6(lines 2438 2442) no Hoare annotation was computed. [2019-01-12 14:37:24,157 INFO L448 ceAbstractionStarter]: For program point L2306-1(lines 2306 2317) no Hoare annotation was computed. [2019-01-12 14:37:24,157 INFO L448 ceAbstractionStarter]: For program point L2306-4(lines 2306 2317) no Hoare annotation was computed. [2019-01-12 14:37:24,157 INFO L448 ceAbstractionStarter]: For program point L2306-3(lines 2306 2317) no Hoare annotation was computed. [2019-01-12 14:37:24,158 INFO L448 ceAbstractionStarter]: For program point L2438-9(lines 2438 2442) no Hoare annotation was computed. [2019-01-12 14:37:24,158 INFO L448 ceAbstractionStarter]: For program point L2438-12(lines 2438 2442) no Hoare annotation was computed. [2019-01-12 14:37:24,158 INFO L444 ceAbstractionStarter]: At program point L2703-1(lines 2686 2709) the Hoare annotation is: (let ((.cse0 (= 2 ~rjh~0)) (.cse3 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse2 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))) (.cse1 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= |ULTIMATE.start_isReadable_#res| 1) (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse0 .cse1 (and .cse2 .cse3)) .cse4) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1)) (and (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse0 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (and .cse3 .cse2) .cse1) .cse4))) [2019-01-12 14:37:24,159 INFO L444 ceAbstractionStarter]: At program point L2703(lines 2686 2709) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,159 INFO L448 ceAbstractionStarter]: For program point L2506(lines 2506 2512) no Hoare annotation was computed. [2019-01-12 14:37:24,159 INFO L444 ceAbstractionStarter]: At program point L128(lines 115 133) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1))) (or (and .cse0 (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) .cse8) (and .cse0 (and .cse1 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse3 (= 2 ~__ste_email_to0~0) .cse4 .cse5 .cse6 .cse7) .cse8))) [2019-01-12 14:37:24,159 INFO L451 ceAbstractionStarter]: At program point L128-1(lines 115 133) the Hoare annotation is: true [2019-01-12 14:37:24,159 INFO L448 ceAbstractionStarter]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2019-01-12 14:37:24,159 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2735) no Hoare annotation was computed. [2019-01-12 14:37:24,159 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1392) no Hoare annotation was computed. [2019-01-12 14:37:24,159 INFO L448 ceAbstractionStarter]: For program point L2310(lines 2310 2316) no Hoare annotation was computed. [2019-01-12 14:37:24,159 INFO L448 ceAbstractionStarter]: For program point L2310-2(lines 2310 2316) no Hoare annotation was computed. [2019-01-12 14:37:24,160 INFO L448 ceAbstractionStarter]: For program point L2310-1(lines 2310 2316) no Hoare annotation was computed. [2019-01-12 14:37:24,161 INFO L448 ceAbstractionStarter]: For program point L2310-4(lines 2310 2316) no Hoare annotation was computed. [2019-01-12 14:37:24,161 INFO L448 ceAbstractionStarter]: For program point L2310-3(lines 2310 2316) no Hoare annotation was computed. [2019-01-12 14:37:24,161 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:37:24,161 INFO L448 ceAbstractionStarter]: For program point L2643-1(lines 2643 2659) no Hoare annotation was computed. [2019-01-12 14:37:24,161 INFO L448 ceAbstractionStarter]: For program point L2643(lines 2643 2659) no Hoare annotation was computed. [2019-01-12 14:37:24,161 INFO L448 ceAbstractionStarter]: For program point L2445-1(lines 2445 2469) no Hoare annotation was computed. [2019-01-12 14:37:24,161 INFO L448 ceAbstractionStarter]: For program point L2445(lines 2445 2469) no Hoare annotation was computed. [2019-01-12 14:37:24,161 INFO L448 ceAbstractionStarter]: For program point L2445-3(lines 2445 2469) no Hoare annotation was computed. [2019-01-12 14:37:24,161 INFO L448 ceAbstractionStarter]: For program point L2445-2(lines 2445 2469) no Hoare annotation was computed. [2019-01-12 14:37:24,161 INFO L448 ceAbstractionStarter]: For program point L2445-4(lines 2445 2469) no Hoare annotation was computed. [2019-01-12 14:37:24,162 INFO L444 ceAbstractionStarter]: At program point L530(lines 505 532) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse2 (= 2 ~rjh~0)) (.cse1 (and (= 1 ULTIMATE.start_outgoing_~msg) (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (= 1 |ULTIMATE.start_createEmail_#res|))) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse5 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1))) (or (and .cse0 (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse1 .cse2 .cse3) .cse4) .cse5) (and .cse0 (and (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse1 (= 2 ~__ste_email_to0~0) .cse3) .cse4) .cse5))) [2019-01-12 14:37:24,162 INFO L451 ceAbstractionStarter]: At program point L530-1(lines 505 532) the Hoare annotation is: true [2019-01-12 14:37:24,162 INFO L448 ceAbstractionStarter]: For program point L2446(lines 2446 2454) no Hoare annotation was computed. [2019-01-12 14:37:24,162 INFO L448 ceAbstractionStarter]: For program point L2380(lines 2380 2426) no Hoare annotation was computed. [2019-01-12 14:37:24,162 INFO L448 ceAbstractionStarter]: For program point L2446-2(lines 2446 2454) no Hoare annotation was computed. [2019-01-12 14:37:24,162 INFO L448 ceAbstractionStarter]: For program point L2446-4(lines 2446 2454) no Hoare annotation was computed. [2019-01-12 14:37:24,162 INFO L448 ceAbstractionStarter]: For program point L2446-6(lines 2446 2454) no Hoare annotation was computed. [2019-01-12 14:37:24,162 INFO L448 ceAbstractionStarter]: For program point L2446-8(lines 2446 2454) no Hoare annotation was computed. [2019-01-12 14:37:24,162 INFO L448 ceAbstractionStarter]: For program point L2381(lines 2381 2392) no Hoare annotation was computed. [2019-01-12 14:37:24,162 INFO L444 ceAbstractionStarter]: At program point L1324(lines 1314 1457) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,163 INFO L444 ceAbstractionStarter]: At program point L2315-1(lines 2298 2321) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op4~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,163 INFO L444 ceAbstractionStarter]: At program point L2315(lines 2298 2321) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op1~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,163 INFO L444 ceAbstractionStarter]: At program point L2315-3(lines 2298 2321) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,163 INFO L444 ceAbstractionStarter]: At program point L2315-2(lines 2298 2321) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_test_~op5~0 0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,163 INFO L444 ceAbstractionStarter]: At program point L2315-4(lines 2298 2321) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,163 INFO L448 ceAbstractionStarter]: For program point L2647-1(lines 2647 2658) no Hoare annotation was computed. [2019-01-12 14:37:24,163 INFO L448 ceAbstractionStarter]: For program point L2647(lines 2647 2658) no Hoare annotation was computed. [2019-01-12 14:37:24,163 INFO L444 ceAbstractionStarter]: At program point L1590(lines 1585 1593) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse1 (= 2 ~rjh~0)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (and .cse3 .cse4 .cse5))) (and (= |ULTIMATE.start_isReadable_#res| 1) (and (= ULTIMATE.start_setEmailTo_~handle 1) (and (and .cse3 .cse5 .cse4) .cse1 .cse2) .cse0) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1)))) [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L2515(lines 2515 2531) no Hoare annotation was computed. [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L2449(lines 2449 2453) no Hoare annotation was computed. [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L2449-3(lines 2449 2453) no Hoare annotation was computed. [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L2449-6(lines 2449 2453) no Hoare annotation was computed. [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L2449-9(lines 2449 2453) no Hoare annotation was computed. [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L2449-12(lines 2449 2453) no Hoare annotation was computed. [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L2714(lines 2714 2726) no Hoare annotation was computed. [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L2714-2(lines 2714 2726) no Hoare annotation was computed. [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L2714-4(lines 2714 2726) no Hoare annotation was computed. [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L2516(lines 2516 2527) no Hoare annotation was computed. [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 146) no Hoare annotation was computed. [2019-01-12 14:37:24,164 INFO L448 ceAbstractionStarter]: For program point L138-2(lines 138 146) no Hoare annotation was computed. [2019-01-12 14:37:24,165 INFO L448 ceAbstractionStarter]: For program point L138-4(lines 138 146) no Hoare annotation was computed. [2019-01-12 14:37:24,165 INFO L448 ceAbstractionStarter]: For program point L733(lines 733 740) no Hoare annotation was computed. [2019-01-12 14:37:24,165 INFO L451 ceAbstractionStarter]: At program point L733-1(lines 733 740) the Hoare annotation is: true [2019-01-12 14:37:24,165 INFO L444 ceAbstractionStarter]: At program point L1460(lines 1291 1461) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,165 INFO L444 ceAbstractionStarter]: At program point L1394(lines 1381 1452) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,165 INFO L448 ceAbstractionStarter]: For program point L2385(lines 2385 2391) no Hoare annotation was computed. [2019-01-12 14:37:24,165 INFO L448 ceAbstractionStarter]: For program point L1329(lines 1329 1336) no Hoare annotation was computed. [2019-01-12 14:37:24,165 INFO L448 ceAbstractionStarter]: For program point L2717(lines 2717 2725) no Hoare annotation was computed. [2019-01-12 14:37:24,165 INFO L448 ceAbstractionStarter]: For program point L2651-1(lines 2651 2657) no Hoare annotation was computed. [2019-01-12 14:37:24,165 INFO L448 ceAbstractionStarter]: For program point L2717-2(lines 2717 2725) no Hoare annotation was computed. [2019-01-12 14:37:24,165 INFO L448 ceAbstractionStarter]: For program point L2651(lines 2651 2657) no Hoare annotation was computed. [2019-01-12 14:37:24,166 INFO L448 ceAbstractionStarter]: For program point L2717-4(lines 2717 2725) no Hoare annotation was computed. [2019-01-12 14:37:24,167 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 145) no Hoare annotation was computed. [2019-01-12 14:37:24,167 INFO L444 ceAbstractionStarter]: At program point L141-2(lines 134 149) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,167 INFO L448 ceAbstractionStarter]: For program point L141-3(lines 141 145) no Hoare annotation was computed. [2019-01-12 14:37:24,168 INFO L444 ceAbstractionStarter]: At program point L141-5(lines 134 149) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,168 INFO L448 ceAbstractionStarter]: For program point L141-6(lines 141 145) no Hoare annotation was computed. [2019-01-12 14:37:24,168 INFO L444 ceAbstractionStarter]: At program point L141-8(lines 134 149) the Hoare annotation is: (let ((.cse0 (= 2 ~rjh~0)) (.cse3 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse2 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))) (.cse1 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= |ULTIMATE.start_isReadable_#res| 1) (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse0 .cse1 (and .cse2 .cse3)) .cse4) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1)) (and (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse0 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (and .cse3 .cse2) .cse1) .cse4))) [2019-01-12 14:37:24,168 INFO L444 ceAbstractionStarter]: At program point L538(lines 533 541) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7)) (and .cse0 (and .cse1 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse3 (= 2 ~__ste_email_to0~0) .cse4 .cse5 .cse6 .cse7)))) [2019-01-12 14:37:24,168 INFO L448 ceAbstractionStarter]: For program point L2520(lines 2520 2526) no Hoare annotation was computed. [2019-01-12 14:37:24,168 INFO L444 ceAbstractionStarter]: At program point L538-1(lines 533 541) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse2 (= 2 ~rjh~0)) (.cse1 (and (= 1 ULTIMATE.start_outgoing_~msg) (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (= 1 |ULTIMATE.start_createEmail_#res|))) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse5 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1))) (or (and .cse0 (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse1 .cse2 .cse3) .cse4) .cse5) (and .cse0 (and (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse1 (= 2 ~__ste_email_to0~0) .cse3) .cse4) .cse5))) [2019-01-12 14:37:24,168 INFO L444 ceAbstractionStarter]: At program point L538-2(lines 533 541) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= |ULTIMATE.start_isReadable_#res| 1) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,169 INFO L451 ceAbstractionStarter]: At program point L538-3(lines 533 541) the Hoare annotation is: true [2019-01-12 14:37:24,169 INFO L448 ceAbstractionStarter]: For program point L2720(lines 2720 2724) no Hoare annotation was computed. [2019-01-12 14:37:24,169 INFO L444 ceAbstractionStarter]: At program point L2720-2(lines 1 2755) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,169 INFO L448 ceAbstractionStarter]: For program point L2720-3(lines 2720 2724) no Hoare annotation was computed. [2019-01-12 14:37:24,169 INFO L448 ceAbstractionStarter]: For program point L2720-6(lines 2720 2724) no Hoare annotation was computed. [2019-01-12 14:37:24,169 INFO L444 ceAbstractionStarter]: At program point L2720-5(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 2) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (= 0 ~__ste_client_forwardReceiver1~0) (= ULTIMATE.start_setClientId_~handle ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,169 INFO L444 ceAbstractionStarter]: At program point L2720-8(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,169 INFO L448 ceAbstractionStarter]: For program point L2456(lines 2456 2468) no Hoare annotation was computed. [2019-01-12 14:37:24,169 INFO L448 ceAbstractionStarter]: For program point L2456-2(lines 2456 2468) no Hoare annotation was computed. [2019-01-12 14:37:24,169 INFO L448 ceAbstractionStarter]: For program point L1399(lines 1399 1403) no Hoare annotation was computed. [2019-01-12 14:37:24,170 INFO L444 ceAbstractionStarter]: At program point L2456-1(lines 2430 2473) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op1~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,170 INFO L448 ceAbstractionStarter]: For program point L2456-4(lines 2456 2468) no Hoare annotation was computed. [2019-01-12 14:37:24,170 INFO L444 ceAbstractionStarter]: At program point L2456-3(lines 2430 2473) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op4~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,170 INFO L448 ceAbstractionStarter]: For program point L2456-6(lines 2456 2468) no Hoare annotation was computed. [2019-01-12 14:37:24,170 INFO L444 ceAbstractionStarter]: At program point L2456-5(lines 2430 2473) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_test_~op5~0 0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,170 INFO L448 ceAbstractionStarter]: For program point L2456-8(lines 2456 2468) no Hoare annotation was computed. [2019-01-12 14:37:24,170 INFO L444 ceAbstractionStarter]: At program point L2456-7(lines 2430 2473) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,170 INFO L444 ceAbstractionStarter]: At program point L2456-9(lines 2430 2473) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,170 INFO L448 ceAbstractionStarter]: For program point L2457(lines 2457 2465) no Hoare annotation was computed. [2019-01-12 14:37:24,170 INFO L448 ceAbstractionStarter]: For program point L2457-2(lines 2457 2465) no Hoare annotation was computed. [2019-01-12 14:37:24,171 INFO L448 ceAbstractionStarter]: For program point L2457-4(lines 2457 2465) no Hoare annotation was computed. [2019-01-12 14:37:24,171 INFO L448 ceAbstractionStarter]: For program point L2457-6(lines 2457 2465) no Hoare annotation was computed. [2019-01-12 14:37:24,171 INFO L448 ceAbstractionStarter]: For program point L2457-8(lines 2457 2465) no Hoare annotation was computed. [2019-01-12 14:37:24,171 INFO L444 ceAbstractionStarter]: At program point L2656(lines 2639 2662) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getClientForwardReceiver_~handle 2) (= 2 ~rjh~0) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,171 INFO L444 ceAbstractionStarter]: At program point L1599(lines 1594 1602) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse1 (= 2 ~rjh~0)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (and .cse3 .cse4 .cse5))) (and (= |ULTIMATE.start_isReadable_#res| 1) (and (= ULTIMATE.start_setEmailTo_~handle 1) (and (and .cse3 .cse5 .cse4) .cse1 .cse2) .cse0) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1)))) [2019-01-12 14:37:24,171 INFO L444 ceAbstractionStarter]: At program point L2656-1(lines 2639 2662) the Hoare annotation is: (let ((.cse0 (and (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))))) (or (and (= 0 |ULTIMATE.start_getClientForwardReceiver_#res|) .cse0) (and (and (= 2 ~rjh~0) (and .cse0 (= 1 |ULTIMATE.start_createEmail_#res|)) (= 2 ULTIMATE.start_createEmail_~to)) (= 1 ULTIMATE.start_createEmail_~msg~0)))) [2019-01-12 14:37:24,171 INFO L448 ceAbstractionStarter]: For program point L2326(lines 2326 2338) no Hoare annotation was computed. [2019-01-12 14:37:24,171 INFO L448 ceAbstractionStarter]: For program point L2326-2(lines 2326 2338) no Hoare annotation was computed. [2019-01-12 14:37:24,171 INFO L448 ceAbstractionStarter]: For program point L2326-4(lines 2326 2338) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L2326-6(lines 2326 2338) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L2326-8(lines 2326 2338) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L451 ceAbstractionStarter]: At program point L741(lines 723 743) the Hoare annotation is: true [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L2460(lines 2460 2464) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L2394(lines 2394 2425) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L2460-3(lines 2460 2464) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L2460-6(lines 2460 2464) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L2460-9(lines 2460 2464) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L2460-12(lines 2460 2464) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 82 93) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 685) no Hoare annotation was computed. [2019-01-12 14:37:24,172 INFO L448 ceAbstractionStarter]: For program point L1536(lines 1536 1543) no Hoare annotation was computed. [2019-01-12 14:37:24,173 INFO L444 ceAbstractionStarter]: At program point L1536-1(lines 1 2755) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse1 (= 2 ~rjh~0)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (and .cse3 .cse4 .cse5))) (and (= |ULTIMATE.start_isReadable_#res| 1) (and (= ULTIMATE.start_setEmailTo_~handle 1) (and (and .cse3 .cse5 .cse4) .cse1 .cse2) .cse0) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1)))) [2019-01-12 14:37:24,173 INFO L448 ceAbstractionStarter]: For program point L1536-2(lines 1536 1543) no Hoare annotation was computed. [2019-01-12 14:37:24,173 INFO L448 ceAbstractionStarter]: For program point L2395(lines 2395 2406) no Hoare annotation was computed. [2019-01-12 14:37:24,173 INFO L444 ceAbstractionStarter]: At program point L1338(lines 1325 1456) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,173 INFO L448 ceAbstractionStarter]: For program point L2329(lines 2329 2337) no Hoare annotation was computed. [2019-01-12 14:37:24,173 INFO L448 ceAbstractionStarter]: For program point L2329-2(lines 2329 2337) no Hoare annotation was computed. [2019-01-12 14:37:24,173 INFO L448 ceAbstractionStarter]: For program point L2329-4(lines 2329 2337) no Hoare annotation was computed. [2019-01-12 14:37:24,173 INFO L448 ceAbstractionStarter]: For program point L2329-6(lines 2329 2337) no Hoare annotation was computed. [2019-01-12 14:37:24,173 INFO L448 ceAbstractionStarter]: For program point L2329-8(lines 2329 2337) no Hoare annotation was computed. [2019-01-12 14:37:24,173 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 882) no Hoare annotation was computed. [2019-01-12 14:37:24,174 INFO L448 ceAbstractionStarter]: For program point L876-2(lines 876 882) no Hoare annotation was computed. [2019-01-12 14:37:24,180 INFO L444 ceAbstractionStarter]: At program point L1405(lines 1395 1451) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,180 INFO L448 ceAbstractionStarter]: For program point L2595-1(lines 2595 2631) no Hoare annotation was computed. [2019-01-12 14:37:24,180 INFO L448 ceAbstractionStarter]: For program point L2595(lines 2595 2631) no Hoare annotation was computed. [2019-01-12 14:37:24,180 INFO L448 ceAbstractionStarter]: For program point L2595-3(lines 2595 2631) no Hoare annotation was computed. [2019-01-12 14:37:24,180 INFO L448 ceAbstractionStarter]: For program point L2595-2(lines 2595 2631) no Hoare annotation was computed. [2019-01-12 14:37:24,180 INFO L448 ceAbstractionStarter]: For program point L2595-4(lines 2595 2631) no Hoare annotation was computed. [2019-01-12 14:37:24,180 INFO L448 ceAbstractionStarter]: For program point L2596(lines 2596 2604) no Hoare annotation was computed. [2019-01-12 14:37:24,180 INFO L444 ceAbstractionStarter]: At program point L2530(lines 2483 2536) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op1~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,180 INFO L448 ceAbstractionStarter]: For program point L2596-2(lines 2596 2604) no Hoare annotation was computed. [2019-01-12 14:37:24,181 INFO L448 ceAbstractionStarter]: For program point L2596-4(lines 2596 2604) no Hoare annotation was computed. [2019-01-12 14:37:24,181 INFO L448 ceAbstractionStarter]: For program point L2596-6(lines 2596 2604) no Hoare annotation was computed. [2019-01-12 14:37:24,181 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:37:24,181 INFO L448 ceAbstractionStarter]: For program point L2332(lines 2332 2336) no Hoare annotation was computed. [2019-01-12 14:37:24,181 INFO L448 ceAbstractionStarter]: For program point L2596-8(lines 2596 2604) no Hoare annotation was computed. [2019-01-12 14:37:24,181 INFO L444 ceAbstractionStarter]: At program point L2332-2(lines 2322 2341) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op1~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,181 INFO L448 ceAbstractionStarter]: For program point L2332-3(lines 2332 2336) no Hoare annotation was computed. [2019-01-12 14:37:24,181 INFO L448 ceAbstractionStarter]: For program point L2332-6(lines 2332 2336) no Hoare annotation was computed. [2019-01-12 14:37:24,181 INFO L444 ceAbstractionStarter]: At program point L2332-5(lines 2322 2341) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_test_~op4~0 0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,181 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 92) no Hoare annotation was computed. [2019-01-12 14:37:24,182 INFO L444 ceAbstractionStarter]: At program point L2332-8(lines 2322 2341) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_test_~op5~0 0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,182 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 86 92) no Hoare annotation was computed. [2019-01-12 14:37:24,186 INFO L448 ceAbstractionStarter]: For program point L2332-9(lines 2332 2336) no Hoare annotation was computed. [2019-01-12 14:37:24,186 INFO L448 ceAbstractionStarter]: For program point L2332-12(lines 2332 2336) no Hoare annotation was computed. [2019-01-12 14:37:24,186 INFO L444 ceAbstractionStarter]: At program point L2332-11(lines 2322 2341) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,186 INFO L444 ceAbstractionStarter]: At program point L2332-14(lines 2322 2341) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,186 INFO L448 ceAbstractionStarter]: For program point L2399(lines 2399 2405) no Hoare annotation was computed. [2019-01-12 14:37:24,186 INFO L448 ceAbstractionStarter]: For program point L1343(lines 1343 1350) no Hoare annotation was computed. [2019-01-12 14:37:24,187 INFO L444 ceAbstractionStarter]: At program point L1608(lines 1603 1611) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse1 (= 2 ~rjh~0)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (and .cse3 .cse4 .cse5))) (and (= |ULTIMATE.start_isReadable_#res| 1) (and (= ULTIMATE.start_setEmailTo_~handle 1) (and (and .cse3 .cse5 .cse4) .cse1 .cse2) .cse0) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1)))) [2019-01-12 14:37:24,187 INFO L448 ceAbstractionStarter]: For program point L2599(lines 2599 2603) no Hoare annotation was computed. [2019-01-12 14:37:24,187 INFO L448 ceAbstractionStarter]: For program point L2599-3(lines 2599 2603) no Hoare annotation was computed. [2019-01-12 14:37:24,187 INFO L448 ceAbstractionStarter]: For program point L1410(lines 1410 1417) no Hoare annotation was computed. [2019-01-12 14:37:24,187 INFO L448 ceAbstractionStarter]: For program point L2599-6(lines 2599 2603) no Hoare annotation was computed. [2019-01-12 14:37:24,187 INFO L448 ceAbstractionStarter]: For program point L2599-9(lines 2599 2603) no Hoare annotation was computed. [2019-01-12 14:37:24,187 INFO L448 ceAbstractionStarter]: For program point L2599-12(lines 2599 2603) no Hoare annotation was computed. [2019-01-12 14:37:24,187 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 167) no Hoare annotation was computed. [2019-01-12 14:37:24,187 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 156 167) no Hoare annotation was computed. [2019-01-12 14:37:24,187 INFO L448 ceAbstractionStarter]: For program point L156-2(lines 156 167) no Hoare annotation was computed. [2019-01-12 14:37:24,187 INFO L448 ceAbstractionStarter]: For program point L156-3(lines 156 167) no Hoare annotation was computed. [2019-01-12 14:37:24,187 INFO L448 ceAbstractionStarter]: For program point L2667(lines 2667 2679) no Hoare annotation was computed. [2019-01-12 14:37:24,188 INFO L444 ceAbstractionStarter]: At program point L487(lines 1 2755) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,188 INFO L444 ceAbstractionStarter]: At program point L91(lines 78 96) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1))) (or (and .cse0 (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) .cse8) (and .cse0 (and .cse1 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse3 (= 2 ~__ste_email_to0~0) .cse4 .cse5 .cse6 .cse7) .cse8))) [2019-01-12 14:37:24,188 INFO L451 ceAbstractionStarter]: At program point L91-1(lines 78 96) the Hoare annotation is: true [2019-01-12 14:37:24,188 INFO L448 ceAbstractionStarter]: For program point L2735-1(line 2735) no Hoare annotation was computed. [2019-01-12 14:37:24,188 INFO L448 ceAbstractionStarter]: For program point L2735(line 2735) no Hoare annotation was computed. [2019-01-12 14:37:24,188 INFO L444 ceAbstractionStarter]: At program point L2736(lines 868 885) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)))) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1))) (or (and .cse0 (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) .cse8) (and .cse0 (and .cse1 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse3 (= 2 ~__ste_email_to0~0) .cse4 .cse5 .cse6 .cse7) .cse8))) [2019-01-12 14:37:24,188 INFO L448 ceAbstractionStarter]: For program point L2670(lines 2670 2678) no Hoare annotation was computed. [2019-01-12 14:37:24,188 INFO L451 ceAbstractionStarter]: At program point L2736-1(lines 868 885) the Hoare annotation is: true [2019-01-12 14:37:24,188 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 166) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 160 166) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point L160-2(lines 160 166) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point L160-3(lines 160 166) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point L2606(lines 2606 2630) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point L2606-2(lines 2606 2630) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point L2606-1(lines 2606 2630) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point L2606-4(lines 2606 2630) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point L2606-3(lines 2606 2630) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point L2408(lines 2408 2424) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point L2673(lines 2673 2677) no Hoare annotation was computed. [2019-01-12 14:37:24,189 INFO L448 ceAbstractionStarter]: For program point L2607(lines 2607 2615) no Hoare annotation was computed. [2019-01-12 14:37:24,190 INFO L444 ceAbstractionStarter]: At program point L2673-2(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,190 INFO L448 ceAbstractionStarter]: For program point L2607-2(lines 2607 2615) no Hoare annotation was computed. [2019-01-12 14:37:24,190 INFO L448 ceAbstractionStarter]: For program point L2607-4(lines 2607 2615) no Hoare annotation was computed. [2019-01-12 14:37:24,190 INFO L448 ceAbstractionStarter]: For program point L2409(lines 2409 2420) no Hoare annotation was computed. [2019-01-12 14:37:24,190 INFO L444 ceAbstractionStarter]: At program point L1352(lines 1339 1455) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,190 INFO L448 ceAbstractionStarter]: For program point L2607-6(lines 2607 2615) no Hoare annotation was computed. [2019-01-12 14:37:24,190 INFO L448 ceAbstractionStarter]: For program point L2607-8(lines 2607 2615) no Hoare annotation was computed. [2019-01-12 14:37:24,190 INFO L444 ceAbstractionStarter]: At program point L1419(lines 1406 1450) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,190 INFO L444 ceAbstractionStarter]: At program point L495(lines 490 498) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:37:24,190 INFO L448 ceAbstractionStarter]: For program point L2279(lines 2279 2291) no Hoare annotation was computed. [2019-01-12 14:37:24,191 INFO L444 ceAbstractionStarter]: At program point L165(lines 152 170) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,191 INFO L448 ceAbstractionStarter]: For program point L2279-2(lines 2279 2291) no Hoare annotation was computed. [2019-01-12 14:37:24,191 INFO L444 ceAbstractionStarter]: At program point L165-1(lines 152 170) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse2 (= 2 ~rjh~0)) (.cse1 (and (= 1 ULTIMATE.start_outgoing_~msg) (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1))) (= 1 |ULTIMATE.start_createEmail_#res|))) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse5 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4 1))) (or (and .cse0 (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse1 .cse2 .cse3) .cse4) .cse5) (and .cse0 (and (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse1 (= 2 ~__ste_email_to0~0) .cse3) .cse4) .cse5))) [2019-01-12 14:37:24,191 INFO L444 ceAbstractionStarter]: At program point L165-2(lines 152 170) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_createEmail_~to) (= 1 |ULTIMATE.start_createEmail_#res|) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,191 INFO L448 ceAbstractionStarter]: For program point L2279-4(lines 2279 2291) no Hoare annotation was computed. [2019-01-12 14:37:24,191 INFO L451 ceAbstractionStarter]: At program point L165-3(lines 152 170) the Hoare annotation is: true [2019-01-12 14:37:24,191 INFO L448 ceAbstractionStarter]: For program point L2279-6(lines 2279 2291) no Hoare annotation was computed. [2019-01-12 14:37:24,191 INFO L448 ceAbstractionStarter]: For program point L2279-8(lines 2279 2291) no Hoare annotation was computed. [2019-01-12 14:37:24,191 INFO L448 ceAbstractionStarter]: For program point L2279-10(lines 2279 2291) no Hoare annotation was computed. [2019-01-12 14:37:24,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2735) no Hoare annotation was computed. [2019-01-12 14:37:24,200 INFO L448 ceAbstractionStarter]: For program point L2610(lines 2610 2614) no Hoare annotation was computed. [2019-01-12 14:37:24,200 INFO L444 ceAbstractionStarter]: At program point L562(lines 551 565) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~rjh~0) (= 2 ~__ste_email_to0~0) (= 2 ULTIMATE.start_createEmail_~to) (= 1 |ULTIMATE.start_createEmail_#res|) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:37:24,200 INFO L448 ceAbstractionStarter]: For program point L2610-3(lines 2610 2614) no Hoare annotation was computed. [2019-01-12 14:37:24,200 INFO L448 ceAbstractionStarter]: For program point L2610-6(lines 2610 2614) no Hoare annotation was computed. [2019-01-12 14:37:24,200 INFO L448 ceAbstractionStarter]: For program point L2610-9(lines 2610 2614) no Hoare annotation was computed. [2019-01-12 14:37:24,200 INFO L448 ceAbstractionStarter]: For program point L2610-12(lines 2610 2614) no Hoare annotation was computed. [2019-01-12 14:37:24,200 INFO L448 ceAbstractionStarter]: For program point L2413(lines 2413 2419) no Hoare annotation was computed. [2019-01-12 14:37:24,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:37:24 BoogieIcfgContainer [2019-01-12 14:37:24,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:37:24,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:37:24,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:37:24,308 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:37:24,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:36:42" (3/4) ... [2019-01-12 14:37:24,313 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:37:24,359 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 123 nodes and edges [2019-01-12 14:37:24,362 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2019-01-12 14:37:24,365 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-12 14:37:24,368 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:37:24,370 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:37:24,414 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && handle == 3) && handle == 1) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && !(rjh___0 == 1)) && 2 == value) && 1 == msg [2019-01-12 14:37:24,416 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && 1 == msg) && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && !(rjh___0 == 1)) && 2 == value) && 1 == msg [2019-01-12 14:37:24,418 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && 1 == msg) && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && !(rjh___0 == 1)) && 2 == value) && 1 == msg [2019-01-12 14:37:24,419 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == chuck___0 && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && !(rjh___0 == 1)) && 1 == msg [2019-01-12 14:37:24,420 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == chuck___0 && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && !(rjh___0 == 1)) && 1 == msg [2019-01-12 14:37:24,420 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((handle == chuck___0 && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && !(rjh___0 == 1)) && 1 == msg [2019-01-12 14:37:24,420 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 == msg && ((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) || ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) [2019-01-12 14:37:24,420 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == msg && handle == 2) && 2 == \result) && 2 == rjh) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) || ((handle == 1 && ((((1 == msg && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) [2019-01-12 14:37:24,420 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 == msg && ((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) || ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) [2019-01-12 14:37:24,421 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 == msg && ((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) || ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) [2019-01-12 14:37:24,421 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 1 && (handle == 1 && ((((1 == msg && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) || (\result == 1 && (((((((((1 == msg && handle == 2) && 2 == \result) && 2 == rjh) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) [2019-01-12 14:37:24,421 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 == msg && ((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) || ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) [2019-01-12 14:37:24,421 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (handle == 1 && ((((1 == msg && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((((((1 == msg && handle == 2) && 2 == \result) && 2 == rjh) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) [2019-01-12 14:37:24,421 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (handle == 1 && (2 == rjh && 2 == to) && ((handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 1 == msg) && tmp == 1) || ((((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 2 == to) && 1 == msg) [2019-01-12 14:37:24,421 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (handle == 1 && ((((1 == msg && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((((((1 == msg && handle == 2) && 2 == \result) && 2 == rjh) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) [2019-01-12 14:37:24,422 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (handle == 1 && (2 == rjh && 2 == to) && ((handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 1 == msg) && tmp == 1) || ((((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 2 == to) && 1 == msg) [2019-01-12 14:37:24,422 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (handle == 1 && ((((1 == msg && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((((((1 == msg && handle == 2) && 2 == \result) && 2 == rjh) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) [2019-01-12 14:37:24,422 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == chuck___0 && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && !(rjh___0 == 1)) && 1 == msg [2019-01-12 14:37:24,422 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && tmp == 1) [2019-01-12 14:37:24,422 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == chuck___0 && handle == 3) && 2 == rjh) && 1 == \result) && 2 == to) && !(rjh___0 == 1)) && 1 == msg [2019-01-12 14:37:24,423 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == \result && (!(to == 1) && !(rjh == 1)) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) || (((2 == rjh && ((!(to == 1) && !(rjh == 1)) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == to) && 1 == msg) [2019-01-12 14:37:24,423 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && tmp == 1) [2019-01-12 14:37:24,423 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && tmp == 1) [2019-01-12 14:37:24,423 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == chuck___0 && handle == 3) && 2 == rjh) && 1 == \result) && 2 == to) && !(rjh___0 == 1)) && 1 == msg [2019-01-12 14:37:24,423 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == chuck___0 && handle == 3) && 2 == rjh) && \result == 1) && 1 == \result) && 2 == to) && !(rjh___0 == 1)) && 1 == msg [2019-01-12 14:37:24,615 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:37:24,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:37:24,617 INFO L168 Benchmark]: Toolchain (without parser) took 46486.34 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 967.3 MB). Free memory was 943.3 MB in the beginning and 897.5 MB in the end (delta: 45.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-01-12 14:37:24,618 INFO L168 Benchmark]: CDTParser took 0.18 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-12 14:37:24,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1145.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:37:24,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 178.29 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:37:24,621 INFO L168 Benchmark]: Boogie Preprocessor took 101.57 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:37:24,622 INFO L168 Benchmark]: RCFGBuilder took 3140.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 943.6 MB in the end (delta: 153.3 MB). Peak memory consumption was 153.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:37:24,622 INFO L168 Benchmark]: TraceAbstraction took 41606.09 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 822.6 MB). Free memory was 943.6 MB in the beginning and 942.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 986.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:37:24,623 INFO L168 Benchmark]: Witness Printer took 308.52 ms. Allocated memory is still 2.0 GB. Free memory was 942.2 MB in the beginning and 897.5 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:37:24,628 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.18 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 1145.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 178.29 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.57 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3140.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 943.6 MB in the end (delta: 153.3 MB). Peak memory consumption was 153.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41606.09 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 822.6 MB). Free memory was 943.6 MB in the beginning and 942.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 986.9 MB. Max. memory is 11.5 GB. * Witness Printer took 308.52 ms. Allocated memory is still 2.0 GB. Free memory was 942.2 MB in the beginning and 897.5 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2735]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2735]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 1420]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2342]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op4 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: ((\result == 1 && (handle == 1 && ((((1 == msg && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((((((1 == msg && handle == 2) && 2 == \result) && 2 == rjh) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) - InvariantResult [Line: 2342]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2483]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op1 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2342]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && 2 == rjh) && op5 == 0) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2342]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1585]: Loop Invariant Derived loop invariant: (1 == msg && ((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) || ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) - InvariantResult [Line: 2298]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && 2 == rjh) && op5 == 0) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2298]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2298]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 505]: Loop Invariant Derived loop invariant: ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && tmp == 1) - InvariantResult [Line: 505]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && handle == 3) && 2 == rjh) && !(handle == 2)) && !(handle == 1)) && 0 == __ste_client_forwardReceiver1) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2342]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op1 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1325]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2686]: Loop Invariant Derived loop invariant: ((\result == 1 && (handle == 1 && (2 == rjh && 2 == to) && ((handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 1 == msg) && tmp == 1) || ((((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 2 == to) && 1 == msg) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && tmp == 1) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && !(rjh___0 == 1)) && 1 == msg - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && handle == 3) && 2 == rjh) && \result == 1) && 1 == \result) && 2 == to) && !(rjh___0 == 1)) && 1 == msg - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1300]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2298]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op1 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1406]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2298]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op4 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == msg && ((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) || ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1291]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((\result == 1 && (handle == 1 && ((((1 == msg && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((((((1 == msg && handle == 2) && 2 == \result) && 2 == rjh) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) - InvariantResult [Line: 1395]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1292]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1381]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2686]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 1 == msg) && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && !(rjh___0 == 1)) && 2 == value) && 1 == msg - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((handle == chuck___0 && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && !(rjh___0 == 1)) && 1 == msg - InvariantResult [Line: 868]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (\result == 1 && (handle == 1 && ((((1 == msg && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) || (\result == 1 && (((((((((1 == msg && handle == 2) && 2 == \result) && 2 == rjh) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) - InvariantResult [Line: 868]: Loop Invariant Derived loop invariant: ((\result == 1 && (handle == 1 && ((((1 == msg && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((((((1 == msg && handle == 2) && 2 == \result) && 2 == rjh) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) && tmp == 1) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) || ((\result == 1 && (((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && tmp == 1) - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1367]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((\result == 1 && (handle == 1 && (2 == rjh && 2 == to) && ((handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 1 == msg) && tmp == 1) || ((((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 2 == to) && 1 == msg) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 1 == msg) && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && !(rjh___0 == 1)) && 2 == value) && 1 == msg - InvariantResult [Line: 2639]: Loop Invariant Derived loop invariant: (0 == \result && (!(to == 1) && !(rjh == 1)) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) || (((2 == rjh && ((!(to == 1) && !(rjh == 1)) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == to) && 1 == msg) - InvariantResult [Line: 1594]: Loop Invariant Derived loop invariant: (1 == msg && ((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) || ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) - InvariantResult [Line: 2639]: Loop Invariant Derived loop invariant: (((((((((((((handle == chuck___0 && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && !(rjh___0 == 1)) && 1 == msg - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && 2 == rjh) && op5 == 0) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && 2 == rjh) && op5 == 0) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && 2 == rjh) && op5 == 0) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 836]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (!(rjh == 1) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && handle == 3) && handle == 1) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && !(rjh___0 == 1)) && 2 == value) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && 2 == rjh) && op3 == 0) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op1 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2376]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op1 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op4 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((handle == chuck___0 && handle == 3) && 2 == rjh) && !(handle == 1)) && 0 == __ste_client_forwardReceiver1) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2591]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op1 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op4 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1353]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 846]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op4 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((handle == chuck___0 && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && !(rjh___0 == 1)) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((handle == chuck___0 && handle == 3) && 2 == rjh) && 1 == \result) && 2 == to) && !(rjh___0 == 1)) && 1 == msg - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((handle == chuck___0 && handle == 3) && 2 == rjh) && 2 == to) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1)) && 1 == msg - InvariantResult [Line: 1339]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && handle == 3) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1603]: Loop Invariant Derived loop invariant: (1 == msg && ((((handle == 2 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) || ((\result == 1 && (handle == 1 && (((1 == msg && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && tmp == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((handle == chuck___0 && handle == 3) && 2 == rjh) && 1 == \result) && 2 == to) && !(rjh___0 == 1)) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((handle == 2 && !(handle == 1)) && handle == rjh___0) && 0 == __ste_client_forwardReceiver1) && handle == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && handle == 3) && handle == 1) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && !(rjh___0 == 1)) && 2 == value) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == 2 && handle == rjh___0) && 0 == __ste_client_forwardReceiver1) && handle == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((1 == msg && handle == 2) && 2 == \result) && 2 == rjh) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) || ((handle == 1 && ((((1 == msg && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && (handle == chuck___0 && handle == 3) && !(rjh___0 == 1)) && 1 == msg) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op1 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && handle == 3) && op1 == 0) && 2 == rjh) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 723]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && handle == 3) && 2 == rjh) && !(handle == 2)) && !(handle == 1)) && 0 == __ste_client_forwardReceiver1) && !(rjh___0 == 1)) && !(__ste_email_to0 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 329 locations, 2 error locations. SAFE Result, 41.4s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 23.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 10111 SDtfs, 14239 SDslu, 17973 SDs, 0 SdLazy, 738 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9904occurred in iteration=16, 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.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 2643 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 2337 NumberOfFragments, 2636 HoareAnnotationTreeSize, 88 FomulaSimplifications, 34547562 FormulaSimplificationTreeSizeReduction, 6.6s HoareSimplificationTime, 88 FomulaSimplificationsInter, 21966716 FormulaSimplificationTreeSizeReductionInter, 16.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 896 ConstructedInterpolants, 0 QuantifiedInterpolants, 72720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...