./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/email_spec0_product10_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 34ea1153081835871d2d8c4250456d7ca577de25 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:31:14,759 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:31:14,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:31:14,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:31:14,779 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:31:14,781 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:31:14,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:31:14,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:31:14,787 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:31:14,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:31:14,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:31:14,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:31:14,792 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:31:14,793 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:31:14,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:31:14,795 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:31:14,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:31:14,798 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:31:14,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:31:14,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:31:14,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:31:14,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:31:14,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:31:14,807 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:31:14,808 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:31:14,809 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:31:14,810 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:31:14,811 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:31:14,812 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:31:14,813 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:31:14,814 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:31:14,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:31:14,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:31:14,815 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:31:14,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:31:14,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:31:14,817 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:31:14,842 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:31:14,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:31:14,844 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:31:14,844 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:31:14,846 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:31:14,846 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:31:14,846 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:31:14,846 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:31:14,847 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:31:14,847 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:31:14,847 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:31:14,847 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:31:14,847 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:31:14,847 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:31:14,849 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:31:14,849 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:31:14,849 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:31:14,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:31:14,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:31:14,850 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:31:14,850 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:31:14,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:31:14,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:31:14,852 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:31:14,853 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:31:14,853 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:31:14,853 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:31:14,854 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:31:14,854 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 -> 34ea1153081835871d2d8c4250456d7ca577de25 [2018-12-31 09:31:14,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:31:14,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:31:14,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:31:14,914 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:31:14,914 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:31:14,915 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c [2018-12-31 09:31:14,975 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce7e42a4/0008a195e3bd4ca09db20ac4f9c1bec5/FLAG6c2fdd8ea [2018-12-31 09:31:15,556 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:31:15,556 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c [2018-12-31 09:31:15,579 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce7e42a4/0008a195e3bd4ca09db20ac4f9c1bec5/FLAG6c2fdd8ea [2018-12-31 09:31:15,765 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce7e42a4/0008a195e3bd4ca09db20ac4f9c1bec5 [2018-12-31 09:31:15,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:31:15,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:31:15,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:31:15,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:31:15,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:31:15,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:31:15" (1/1) ... [2018-12-31 09:31:15,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d0e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:15, skipping insertion in model container [2018-12-31 09:31:15,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:31:15" (1/1) ... [2018-12-31 09:31:15,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:31:15,891 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:31:16,534 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:31:16,581 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:31:16,815 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:31:16,897 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:31:16,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16 WrapperNode [2018-12-31 09:31:16,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:31:16,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:31:16,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:31:16,900 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:31:16,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16" (1/1) ... [2018-12-31 09:31:16,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16" (1/1) ... [2018-12-31 09:31:17,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:31:17,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:31:17,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:31:17,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:31:17,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16" (1/1) ... [2018-12-31 09:31:17,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16" (1/1) ... [2018-12-31 09:31:17,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16" (1/1) ... [2018-12-31 09:31:17,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16" (1/1) ... [2018-12-31 09:31:17,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16" (1/1) ... [2018-12-31 09:31:17,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16" (1/1) ... [2018-12-31 09:31:17,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16" (1/1) ... [2018-12-31 09:31:17,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:31:17,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:31:17,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:31:17,117 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:31:17,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:31:17,200 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2018-12-31 09:31:17,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:31:17,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:31:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:31:17,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:31:19,345 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:31:19,346 INFO L280 CfgBuilder]: Removed 155 assue(true) statements. [2018-12-31 09:31:19,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:31:19 BoogieIcfgContainer [2018-12-31 09:31:19,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:31:19,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:31:19,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:31:19,354 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:31:19,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:31:15" (1/3) ... [2018-12-31 09:31:19,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566544f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:31:19, skipping insertion in model container [2018-12-31 09:31:19,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:31:16" (2/3) ... [2018-12-31 09:31:19,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566544f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:31:19, skipping insertion in model container [2018-12-31 09:31:19,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:31:19" (3/3) ... [2018-12-31 09:31:19,363 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product10_true-unreach-call_true-termination.cil.c [2018-12-31 09:31:19,375 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:31:19,387 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-31 09:31:19,408 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-31 09:31:19,460 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:31:19,460 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:31:19,461 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:31:19,461 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:31:19,461 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:31:19,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:31:19,461 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:31:19,461 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:31:19,462 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:31:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2018-12-31 09:31:19,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 09:31:19,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:19,494 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] [2018-12-31 09:31:19,497 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:19,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:19,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1170669752, now seen corresponding path program 1 times [2018-12-31 09:31:19,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:19,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:19,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:19,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:19,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:31:19,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:19,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:31:19,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:31:19,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:31:19,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:31:19,929 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 2 states. [2018-12-31 09:31:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:19,967 INFO L93 Difference]: Finished difference Result 273 states and 434 transitions. [2018-12-31 09:31:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:31:19,969 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 38 [2018-12-31 09:31:19,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:19,987 INFO L225 Difference]: With dead ends: 273 [2018-12-31 09:31:19,988 INFO L226 Difference]: Without dead ends: 146 [2018-12-31 09:31:19,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:31:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-31 09:31:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-31 09:31:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-31 09:31:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 234 transitions. [2018-12-31 09:31:20,052 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 234 transitions. Word has length 38 [2018-12-31 09:31:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:20,052 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 234 transitions. [2018-12-31 09:31:20,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:31:20,053 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 234 transitions. [2018-12-31 09:31:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 09:31:20,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:20,056 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] [2018-12-31 09:31:20,056 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1521803372, now seen corresponding path program 1 times [2018-12-31 09:31:20,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:20,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:20,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:31:20,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:20,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:31:20,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:31:20,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:31:20,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:20,241 INFO L87 Difference]: Start difference. First operand 146 states and 234 transitions. Second operand 3 states. [2018-12-31 09:31:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:20,539 INFO L93 Difference]: Finished difference Result 411 states and 660 transitions. [2018-12-31 09:31:20,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:31:20,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-31 09:31:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:20,544 INFO L225 Difference]: With dead ends: 411 [2018-12-31 09:31:20,546 INFO L226 Difference]: Without dead ends: 276 [2018-12-31 09:31:20,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-12-31 09:31:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 145. [2018-12-31 09:31:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-31 09:31:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 230 transitions. [2018-12-31 09:31:20,589 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 230 transitions. Word has length 39 [2018-12-31 09:31:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:20,589 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 230 transitions. [2018-12-31 09:31:20,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:31:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 230 transitions. [2018-12-31 09:31:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 09:31:20,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:20,591 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] [2018-12-31 09:31:20,592 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash 964876999, now seen corresponding path program 1 times [2018-12-31 09:31:20,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:20,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:20,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:20,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:20,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:31:20,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:20,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:31:20,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:31:20,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:31:20,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:20,743 INFO L87 Difference]: Start difference. First operand 145 states and 230 transitions. Second operand 3 states. [2018-12-31 09:31:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:20,846 INFO L93 Difference]: Finished difference Result 276 states and 440 transitions. [2018-12-31 09:31:20,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:31:20,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-31 09:31:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:20,850 INFO L225 Difference]: With dead ends: 276 [2018-12-31 09:31:20,851 INFO L226 Difference]: Without dead ends: 146 [2018-12-31 09:31:20,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-31 09:31:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-12-31 09:31:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-31 09:31:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 227 transitions. [2018-12-31 09:31:20,866 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 227 transitions. Word has length 40 [2018-12-31 09:31:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:20,866 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 227 transitions. [2018-12-31 09:31:20,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:31:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 227 transitions. [2018-12-31 09:31:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-31 09:31:20,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:20,869 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] [2018-12-31 09:31:20,869 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:20,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:20,869 INFO L82 PathProgramCache]: Analyzing trace with hash -559359774, now seen corresponding path program 1 times [2018-12-31 09:31:20,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:20,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:20,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:20,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:20,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:31:21,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:21,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:31:21,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:31:21,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:31:21,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:21,012 INFO L87 Difference]: Start difference. First operand 145 states and 227 transitions. Second operand 3 states. [2018-12-31 09:31:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:21,099 INFO L93 Difference]: Finished difference Result 243 states and 376 transitions. [2018-12-31 09:31:21,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:31:21,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-31 09:31:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:21,101 INFO L225 Difference]: With dead ends: 243 [2018-12-31 09:31:21,101 INFO L226 Difference]: Without dead ends: 148 [2018-12-31 09:31:21,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-31 09:31:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-12-31 09:31:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-31 09:31:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 229 transitions. [2018-12-31 09:31:21,114 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 229 transitions. Word has length 42 [2018-12-31 09:31:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:21,115 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 229 transitions. [2018-12-31 09:31:21,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:31:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 229 transitions. [2018-12-31 09:31:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 09:31:21,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:21,117 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] [2018-12-31 09:31:21,117 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:21,118 INFO L82 PathProgramCache]: Analyzing trace with hash 499910929, now seen corresponding path program 1 times [2018-12-31 09:31:21,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:21,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:21,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:21,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:21,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 09:31:21,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:31:21,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:31:21,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:31:21,919 INFO L87 Difference]: Start difference. First operand 147 states and 229 transitions. Second operand 10 states. [2018-12-31 09:31:22,638 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-31 09:31:23,000 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-31 09:31:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:24,348 INFO L93 Difference]: Finished difference Result 770 states and 1137 transitions. [2018-12-31 09:31:24,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-31 09:31:24,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-12-31 09:31:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:24,353 INFO L225 Difference]: With dead ends: 770 [2018-12-31 09:31:24,354 INFO L226 Difference]: Without dead ends: 697 [2018-12-31 09:31:24,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 09:31:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-12-31 09:31:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 190. [2018-12-31 09:31:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-31 09:31:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 291 transitions. [2018-12-31 09:31:24,406 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 291 transitions. Word has length 47 [2018-12-31 09:31:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:24,406 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 291 transitions. [2018-12-31 09:31:24,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:31:24,409 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 291 transitions. [2018-12-31 09:31:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 09:31:24,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:24,412 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] [2018-12-31 09:31:24,417 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:24,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:24,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1433614264, now seen corresponding path program 1 times [2018-12-31 09:31:24,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:24,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:24,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:24,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:24,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 09:31:24,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:31:24,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:31:24,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:31:24,823 INFO L87 Difference]: Start difference. First operand 190 states and 291 transitions. Second operand 10 states. [2018-12-31 09:31:25,367 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-31 09:31:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:26,634 INFO L93 Difference]: Finished difference Result 805 states and 1181 transitions. [2018-12-31 09:31:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-31 09:31:26,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-12-31 09:31:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:26,639 INFO L225 Difference]: With dead ends: 805 [2018-12-31 09:31:26,639 INFO L226 Difference]: Without dead ends: 709 [2018-12-31 09:31:26,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 09:31:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-12-31 09:31:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 217. [2018-12-31 09:31:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-31 09:31:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 332 transitions. [2018-12-31 09:31:26,676 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 332 transitions. Word has length 48 [2018-12-31 09:31:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:26,676 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 332 transitions. [2018-12-31 09:31:26,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:31:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 332 transitions. [2018-12-31 09:31:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 09:31:26,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:26,679 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] [2018-12-31 09:31:26,679 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1851645243, now seen corresponding path program 1 times [2018-12-31 09:31:26,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:26,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:26,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:26,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:26,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:26,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:26,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:31:26,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:31:26,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:31:26,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:31:26,855 INFO L87 Difference]: Start difference. First operand 217 states and 332 transitions. Second operand 5 states. [2018-12-31 09:31:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:27,169 INFO L93 Difference]: Finished difference Result 626 states and 921 transitions. [2018-12-31 09:31:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:31:27,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-31 09:31:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:27,181 INFO L225 Difference]: With dead ends: 626 [2018-12-31 09:31:27,181 INFO L226 Difference]: Without dead ends: 477 [2018-12-31 09:31:27,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:31:27,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-12-31 09:31:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 223. [2018-12-31 09:31:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-31 09:31:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 338 transitions. [2018-12-31 09:31:27,219 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 338 transitions. Word has length 48 [2018-12-31 09:31:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:27,219 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 338 transitions. [2018-12-31 09:31:27,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:31:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 338 transitions. [2018-12-31 09:31:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 09:31:27,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:27,220 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] [2018-12-31 09:31:27,223 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:27,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2075432413, now seen corresponding path program 1 times [2018-12-31 09:31:27,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:27,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:27,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:27,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:27,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:27,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:27,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:31:27,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:31:27,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:31:27,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:31:27,401 INFO L87 Difference]: Start difference. First operand 223 states and 338 transitions. Second operand 5 states. [2018-12-31 09:31:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:28,435 INFO L93 Difference]: Finished difference Result 731 states and 1093 transitions. [2018-12-31 09:31:28,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:31:28,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-31 09:31:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:28,442 INFO L225 Difference]: With dead ends: 731 [2018-12-31 09:31:28,443 INFO L226 Difference]: Without dead ends: 619 [2018-12-31 09:31:28,444 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 [2018-12-31 09:31:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-12-31 09:31:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 423. [2018-12-31 09:31:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-12-31 09:31:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 647 transitions. [2018-12-31 09:31:28,526 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 647 transitions. Word has length 49 [2018-12-31 09:31:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:28,527 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 647 transitions. [2018-12-31 09:31:28,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:31:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 647 transitions. [2018-12-31 09:31:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 09:31:28,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:28,531 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] [2018-12-31 09:31:28,531 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:28,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1642065176, now seen corresponding path program 1 times [2018-12-31 09:31:28,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:28,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:28,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:28,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:28,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:28,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:28,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:31:28,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:31:28,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:31:28,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:31:28,772 INFO L87 Difference]: Start difference. First operand 423 states and 647 transitions. Second operand 6 states. [2018-12-31 09:31:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:29,045 INFO L93 Difference]: Finished difference Result 837 states and 1260 transitions. [2018-12-31 09:31:29,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:31:29,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-12-31 09:31:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:29,050 INFO L225 Difference]: With dead ends: 837 [2018-12-31 09:31:29,050 INFO L226 Difference]: Without dead ends: 505 [2018-12-31 09:31:29,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:31:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-12-31 09:31:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 423. [2018-12-31 09:31:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-12-31 09:31:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 643 transitions. [2018-12-31 09:31:29,115 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 643 transitions. Word has length 49 [2018-12-31 09:31:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:29,116 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 643 transitions. [2018-12-31 09:31:29,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:31:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 643 transitions. [2018-12-31 09:31:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 09:31:29,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:29,119 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] [2018-12-31 09:31:29,119 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash -352079530, now seen corresponding path program 1 times [2018-12-31 09:31:29,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:29,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:29,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:29,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:29,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:31:29,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:31:29,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:31:29,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:31:29,361 INFO L87 Difference]: Start difference. First operand 423 states and 643 transitions. Second operand 5 states. [2018-12-31 09:31:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:29,834 INFO L93 Difference]: Finished difference Result 843 states and 1250 transitions. [2018-12-31 09:31:29,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:31:29,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-31 09:31:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:29,840 INFO L225 Difference]: With dead ends: 843 [2018-12-31 09:31:29,840 INFO L226 Difference]: Without dead ends: 579 [2018-12-31 09:31:29,841 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 [2018-12-31 09:31:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-12-31 09:31:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 397. [2018-12-31 09:31:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-31 09:31:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 599 transitions. [2018-12-31 09:31:29,907 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 599 transitions. Word has length 49 [2018-12-31 09:31:29,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:29,907 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 599 transitions. [2018-12-31 09:31:29,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:31:29,907 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 599 transitions. [2018-12-31 09:31:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 09:31:29,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:29,908 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] [2018-12-31 09:31:29,909 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:29,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:29,909 INFO L82 PathProgramCache]: Analyzing trace with hash -372841469, now seen corresponding path program 1 times [2018-12-31 09:31:29,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:29,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:29,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:29,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:29,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:30,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:30,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 09:31:30,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:31:30,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:31:30,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:31:30,117 INFO L87 Difference]: Start difference. First operand 397 states and 599 transitions. Second operand 9 states. [2018-12-31 09:31:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:31,331 INFO L93 Difference]: Finished difference Result 1990 states and 2869 transitions. [2018-12-31 09:31:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-31 09:31:31,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-31 09:31:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:31,340 INFO L225 Difference]: With dead ends: 1990 [2018-12-31 09:31:31,340 INFO L226 Difference]: Without dead ends: 1681 [2018-12-31 09:31:31,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=610, Unknown=0, NotChecked=0, Total=870 [2018-12-31 09:31:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2018-12-31 09:31:31,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 587. [2018-12-31 09:31:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-12-31 09:31:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 869 transitions. [2018-12-31 09:31:31,462 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 869 transitions. Word has length 50 [2018-12-31 09:31:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:31,462 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 869 transitions. [2018-12-31 09:31:31,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:31:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 869 transitions. [2018-12-31 09:31:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 09:31:31,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:31,463 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] [2018-12-31 09:31:31,464 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash 426668348, now seen corresponding path program 1 times [2018-12-31 09:31:31,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:31,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:31,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:31,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:31,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:31,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:31,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:31:31,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:31:31,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:31:31,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:31:31,617 INFO L87 Difference]: Start difference. First operand 587 states and 869 transitions. Second operand 4 states. [2018-12-31 09:31:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:32,018 INFO L93 Difference]: Finished difference Result 951 states and 1381 transitions. [2018-12-31 09:31:32,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:31:32,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-31 09:31:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:32,022 INFO L225 Difference]: With dead ends: 951 [2018-12-31 09:31:32,022 INFO L226 Difference]: Without dead ends: 649 [2018-12-31 09:31:32,023 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 [2018-12-31 09:31:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-12-31 09:31:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 449. [2018-12-31 09:31:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-31 09:31:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 665 transitions. [2018-12-31 09:31:32,106 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 665 transitions. Word has length 51 [2018-12-31 09:31:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:32,107 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 665 transitions. [2018-12-31 09:31:32,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:31:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 665 transitions. [2018-12-31 09:31:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 09:31:32,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:32,108 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] [2018-12-31 09:31:32,109 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:32,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:32,109 INFO L82 PathProgramCache]: Analyzing trace with hash -758030884, now seen corresponding path program 1 times [2018-12-31 09:31:32,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:32,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:32,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:32,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:32,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:32,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:32,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:31:32,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:31:32,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:31:32,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:31:32,373 INFO L87 Difference]: Start difference. First operand 449 states and 665 transitions. Second operand 5 states. [2018-12-31 09:31:32,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:32,738 INFO L93 Difference]: Finished difference Result 964 states and 1382 transitions. [2018-12-31 09:31:32,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:31:32,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-31 09:31:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:32,742 INFO L225 Difference]: With dead ends: 964 [2018-12-31 09:31:32,742 INFO L226 Difference]: Without dead ends: 686 [2018-12-31 09:31:32,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:31:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-12-31 09:31:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 449. [2018-12-31 09:31:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-31 09:31:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 657 transitions. [2018-12-31 09:31:32,835 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 657 transitions. Word has length 52 [2018-12-31 09:31:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:32,835 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 657 transitions. [2018-12-31 09:31:32,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:31:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 657 transitions. [2018-12-31 09:31:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 09:31:32,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:32,837 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] [2018-12-31 09:31:32,837 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:32,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:32,837 INFO L82 PathProgramCache]: Analyzing trace with hash -515372532, now seen corresponding path program 1 times [2018-12-31 09:31:32,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:32,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:32,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:33,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:33,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:31:33,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:31:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:31:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:31:33,015 INFO L87 Difference]: Start difference. First operand 449 states and 657 transitions. Second operand 4 states. [2018-12-31 09:31:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:33,316 INFO L93 Difference]: Finished difference Result 1013 states and 1437 transitions. [2018-12-31 09:31:33,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:31:33,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-31 09:31:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:33,321 INFO L225 Difference]: With dead ends: 1013 [2018-12-31 09:31:33,321 INFO L226 Difference]: Without dead ends: 767 [2018-12-31 09:31:33,322 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 [2018-12-31 09:31:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-12-31 09:31:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 459. [2018-12-31 09:31:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-12-31 09:31:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 663 transitions. [2018-12-31 09:31:33,426 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 663 transitions. Word has length 53 [2018-12-31 09:31:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:33,426 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 663 transitions. [2018-12-31 09:31:33,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:31:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 663 transitions. [2018-12-31 09:31:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 09:31:33,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:33,429 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] [2018-12-31 09:31:33,430 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:33,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:33,430 INFO L82 PathProgramCache]: Analyzing trace with hash -350052377, now seen corresponding path program 1 times [2018-12-31 09:31:33,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:33,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:33,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:33,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:33,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:33,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:31:33,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:33,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:31:33,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:31:33,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:31:33,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:33,515 INFO L87 Difference]: Start difference. First operand 459 states and 663 transitions. Second operand 3 states. [2018-12-31 09:31:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:33,776 INFO L93 Difference]: Finished difference Result 1337 states and 1941 transitions. [2018-12-31 09:31:33,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:31:33,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-31 09:31:33,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:33,782 INFO L225 Difference]: With dead ends: 1337 [2018-12-31 09:31:33,782 INFO L226 Difference]: Without dead ends: 897 [2018-12-31 09:31:33,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-12-31 09:31:33,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 523. [2018-12-31 09:31:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-12-31 09:31:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 781 transitions. [2018-12-31 09:31:33,904 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 781 transitions. Word has length 57 [2018-12-31 09:31:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:33,905 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 781 transitions. [2018-12-31 09:31:33,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:31:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 781 transitions. [2018-12-31 09:31:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 09:31:33,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:33,908 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] [2018-12-31 09:31:33,908 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:33,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:33,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1274582038, now seen corresponding path program 1 times [2018-12-31 09:31:33,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:33,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:33,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:33,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:34,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:34,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 09:31:34,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:31:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:31:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:31:34,408 INFO L87 Difference]: Start difference. First operand 523 states and 781 transitions. Second operand 7 states. [2018-12-31 09:31:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:35,241 INFO L93 Difference]: Finished difference Result 1431 states and 2018 transitions. [2018-12-31 09:31:35,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 09:31:35,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-12-31 09:31:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:35,246 INFO L225 Difference]: With dead ends: 1431 [2018-12-31 09:31:35,246 INFO L226 Difference]: Without dead ends: 1133 [2018-12-31 09:31:35,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-12-31 09:31:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2018-12-31 09:31:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 573. [2018-12-31 09:31:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-12-31 09:31:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 844 transitions. [2018-12-31 09:31:35,390 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 844 transitions. Word has length 57 [2018-12-31 09:31:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:35,390 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 844 transitions. [2018-12-31 09:31:35,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:31:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 844 transitions. [2018-12-31 09:31:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-31 09:31:35,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:35,393 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] [2018-12-31 09:31:35,393 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:35,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1281029819, now seen corresponding path program 1 times [2018-12-31 09:31:35,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:35,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:35,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:35,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:35,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:35,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:35,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 09:31:35,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:31:35,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:31:35,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:31:35,883 INFO L87 Difference]: Start difference. First operand 573 states and 844 transitions. Second operand 7 states. [2018-12-31 09:31:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:36,581 INFO L93 Difference]: Finished difference Result 1288 states and 1809 transitions. [2018-12-31 09:31:36,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 09:31:36,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-12-31 09:31:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:36,585 INFO L225 Difference]: With dead ends: 1288 [2018-12-31 09:31:36,585 INFO L226 Difference]: Without dead ends: 960 [2018-12-31 09:31:36,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-12-31 09:31:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2018-12-31 09:31:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 624. [2018-12-31 09:31:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-12-31 09:31:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 902 transitions. [2018-12-31 09:31:36,710 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 902 transitions. Word has length 58 [2018-12-31 09:31:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:36,710 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 902 transitions. [2018-12-31 09:31:36,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:31:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 902 transitions. [2018-12-31 09:31:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-31 09:31:36,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:36,712 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] [2018-12-31 09:31:36,712 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:36,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1734073799, now seen corresponding path program 1 times [2018-12-31 09:31:36,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:36,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:36,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:36,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:36,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:37,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:37,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 09:31:37,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:31:37,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:31:37,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:31:37,007 INFO L87 Difference]: Start difference. First operand 624 states and 902 transitions. Second operand 8 states. [2018-12-31 09:31:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:38,068 INFO L93 Difference]: Finished difference Result 1598 states and 2164 transitions. [2018-12-31 09:31:38,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-31 09:31:38,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-12-31 09:31:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:38,073 INFO L225 Difference]: With dead ends: 1598 [2018-12-31 09:31:38,073 INFO L226 Difference]: Without dead ends: 1358 [2018-12-31 09:31:38,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2018-12-31 09:31:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2018-12-31 09:31:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 623. [2018-12-31 09:31:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-12-31 09:31:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 890 transitions. [2018-12-31 09:31:38,258 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 890 transitions. Word has length 58 [2018-12-31 09:31:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:38,258 INFO L480 AbstractCegarLoop]: Abstraction has 623 states and 890 transitions. [2018-12-31 09:31:38,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:31:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 890 transitions. [2018-12-31 09:31:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-31 09:31:38,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:38,261 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] [2018-12-31 09:31:38,262 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:38,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash -845239413, now seen corresponding path program 1 times [2018-12-31 09:31:38,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:38,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:38,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:38,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:38,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:31:38,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:38,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:31:38,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:31:38,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:31:38,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:38,346 INFO L87 Difference]: Start difference. First operand 623 states and 890 transitions. Second operand 3 states. [2018-12-31 09:31:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:38,767 INFO L93 Difference]: Finished difference Result 1811 states and 2590 transitions. [2018-12-31 09:31:38,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:31:38,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-31 09:31:38,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:38,775 INFO L225 Difference]: With dead ends: 1811 [2018-12-31 09:31:38,776 INFO L226 Difference]: Without dead ends: 1207 [2018-12-31 09:31:38,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-12-31 09:31:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 733. [2018-12-31 09:31:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-12-31 09:31:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1092 transitions. [2018-12-31 09:31:38,943 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1092 transitions. Word has length 58 [2018-12-31 09:31:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:38,943 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 1092 transitions. [2018-12-31 09:31:38,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:31:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1092 transitions. [2018-12-31 09:31:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 09:31:38,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:38,945 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] [2018-12-31 09:31:38,945 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:38,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:38,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1160186982, now seen corresponding path program 1 times [2018-12-31 09:31:38,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:38,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:38,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:39,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:39,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 09:31:39,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:31:39,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:31:39,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:31:39,100 INFO L87 Difference]: Start difference. First operand 733 states and 1092 transitions. Second operand 8 states. [2018-12-31 09:31:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:39,928 INFO L93 Difference]: Finished difference Result 1722 states and 2378 transitions. [2018-12-31 09:31:39,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-31 09:31:39,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-12-31 09:31:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:39,935 INFO L225 Difference]: With dead ends: 1722 [2018-12-31 09:31:39,935 INFO L226 Difference]: Without dead ends: 1376 [2018-12-31 09:31:39,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2018-12-31 09:31:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-12-31 09:31:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 748. [2018-12-31 09:31:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-12-31 09:31:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1103 transitions. [2018-12-31 09:31:40,092 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1103 transitions. Word has length 59 [2018-12-31 09:31:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:40,092 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 1103 transitions. [2018-12-31 09:31:40,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:31:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1103 transitions. [2018-12-31 09:31:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 09:31:40,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:40,094 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] [2018-12-31 09:31:40,094 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:40,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1746992996, now seen corresponding path program 1 times [2018-12-31 09:31:40,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:40,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:40,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:40,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:40,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:40,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:31:40,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:31:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:31:40,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:31:40,389 INFO L87 Difference]: Start difference. First operand 748 states and 1103 transitions. Second operand 6 states. [2018-12-31 09:31:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:40,812 INFO L93 Difference]: Finished difference Result 1313 states and 1844 transitions. [2018-12-31 09:31:40,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:31:40,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-31 09:31:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:40,817 INFO L225 Difference]: With dead ends: 1313 [2018-12-31 09:31:40,817 INFO L226 Difference]: Without dead ends: 937 [2018-12-31 09:31:40,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:31:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-12-31 09:31:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 713. [2018-12-31 09:31:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-12-31 09:31:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1057 transitions. [2018-12-31 09:31:40,959 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1057 transitions. Word has length 59 [2018-12-31 09:31:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:40,959 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 1057 transitions. [2018-12-31 09:31:40,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:31:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1057 transitions. [2018-12-31 09:31:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 09:31:40,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:40,961 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] [2018-12-31 09:31:40,962 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:40,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1319274569, now seen corresponding path program 1 times [2018-12-31 09:31:40,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:40,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:40,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:40,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:31:41,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:41,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:31:41,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:31:41,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:31:41,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:41,044 INFO L87 Difference]: Start difference. First operand 713 states and 1057 transitions. Second operand 3 states. [2018-12-31 09:31:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:41,339 INFO L93 Difference]: Finished difference Result 2093 states and 3111 transitions. [2018-12-31 09:31:41,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:31:41,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-31 09:31:41,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:41,346 INFO L225 Difference]: With dead ends: 2093 [2018-12-31 09:31:41,346 INFO L226 Difference]: Without dead ends: 1399 [2018-12-31 09:31:41,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2018-12-31 09:31:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 945. [2018-12-31 09:31:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-12-31 09:31:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1477 transitions. [2018-12-31 09:31:41,511 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1477 transitions. Word has length 59 [2018-12-31 09:31:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:41,511 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 1477 transitions. [2018-12-31 09:31:41,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:31:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1477 transitions. [2018-12-31 09:31:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 09:31:41,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:41,513 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] [2018-12-31 09:31:41,514 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:41,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:41,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1887492868, now seen corresponding path program 1 times [2018-12-31 09:31:41,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:41,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:41,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:41,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:41,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:31:41,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:41,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:31:41,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:31:41,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:31:41,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:41,596 INFO L87 Difference]: Start difference. First operand 945 states and 1477 transitions. Second operand 3 states. [2018-12-31 09:31:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:42,050 INFO L93 Difference]: Finished difference Result 2781 states and 4355 transitions. [2018-12-31 09:31:42,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:31:42,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-31 09:31:42,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:42,058 INFO L225 Difference]: With dead ends: 2781 [2018-12-31 09:31:42,058 INFO L226 Difference]: Without dead ends: 1855 [2018-12-31 09:31:42,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2018-12-31 09:31:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1401. [2018-12-31 09:31:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2018-12-31 09:31:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2293 transitions. [2018-12-31 09:31:42,238 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2293 transitions. Word has length 60 [2018-12-31 09:31:42,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:42,238 INFO L480 AbstractCegarLoop]: Abstraction has 1401 states and 2293 transitions. [2018-12-31 09:31:42,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:31:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2293 transitions. [2018-12-31 09:31:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 09:31:42,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:42,241 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] [2018-12-31 09:31:42,242 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:42,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:42,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1583078645, now seen corresponding path program 1 times [2018-12-31 09:31:42,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:42,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:42,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:42,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:31:42,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:42,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:31:42,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:31:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:31:42,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:42,333 INFO L87 Difference]: Start difference. First operand 1401 states and 2293 transitions. Second operand 3 states. [2018-12-31 09:31:42,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:42,761 INFO L93 Difference]: Finished difference Result 4133 states and 6771 transitions. [2018-12-31 09:31:42,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:31:42,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-12-31 09:31:42,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:42,770 INFO L225 Difference]: With dead ends: 4133 [2018-12-31 09:31:42,770 INFO L226 Difference]: Without dead ends: 2751 [2018-12-31 09:31:42,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:31:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2018-12-31 09:31:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2297. [2018-12-31 09:31:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2297 states. [2018-12-31 09:31:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 3877 transitions. [2018-12-31 09:31:42,966 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 3877 transitions. Word has length 61 [2018-12-31 09:31:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:42,966 INFO L480 AbstractCegarLoop]: Abstraction has 2297 states and 3877 transitions. [2018-12-31 09:31:42,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:31:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 3877 transitions. [2018-12-31 09:31:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-31 09:31:42,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:31:42,970 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] [2018-12-31 09:31:42,970 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:31:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:31:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1787678266, now seen corresponding path program 1 times [2018-12-31 09:31:42,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:31:42,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:31:42,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:42,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:31:42,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:31:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:31:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:31:43,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:31:43,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:31:43,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:31:43,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:31:43,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:31:43,130 INFO L87 Difference]: Start difference. First operand 2297 states and 3877 transitions. Second operand 4 states. [2018-12-31 09:31:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:31:43,407 INFO L93 Difference]: Finished difference Result 2462 states and 4098 transitions. [2018-12-31 09:31:43,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:31:43,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-31 09:31:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:31:43,408 INFO L225 Difference]: With dead ends: 2462 [2018-12-31 09:31:43,408 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 09:31:43,410 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 [2018-12-31 09:31:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 09:31:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 09:31:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 09:31:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 09:31:43,411 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-12-31 09:31:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:31:43,411 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 09:31:43,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:31:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 09:31:43,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 09:31:43,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 09:31:43,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,630 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 111 [2018-12-31 09:31:43,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:43,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,768 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 371 DAG size of output: 270 [2018-12-31 09:31:44,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:44,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:45,072 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 172 [2018-12-31 09:31:45,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:45,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:45,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:45,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:45,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:45,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:45,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:45,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:46,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:46,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:46,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:46,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:48,164 WARN L181 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 657 DAG size of output: 561 [2018-12-31 09:31:48,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:48,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:48,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:48,644 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 356 DAG size of output: 309 [2018-12-31 09:31:48,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:48,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:48,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:48,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:48,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:48,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:49,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:50,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,309 WARN L181 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 740 DAG size of output: 624 [2018-12-31 09:31:51,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:51,904 WARN L181 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 270 [2018-12-31 09:31:51,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,090 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 159 [2018-12-31 09:31:52,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,275 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 196 [2018-12-31 09:31:52,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,432 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 160 [2018-12-31 09:31:52,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,592 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 168 [2018-12-31 09:31:52,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,904 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 217 [2018-12-31 09:31:52,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:52,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:53,807 WARN L181 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 336 [2018-12-31 09:31:53,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:54,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:54,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:54,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:54,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:54,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:54,509 WARN L181 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 283 [2018-12-31 09:31:54,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:54,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:54,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:54,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:54,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:54,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:55,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:55,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:55,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:55,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:57,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:58,721 WARN L181 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 776 DAG size of output: 685 [2018-12-31 09:31:58,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:58,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:58,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:58,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:58,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:58,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:58,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:58,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:58,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,089 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 302 DAG size of output: 237 [2018-12-31 09:31:59,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,288 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 172 [2018-12-31 09:31:59,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,590 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 174 [2018-12-31 09:31:59,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:59,886 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 172 [2018-12-31 09:31:59,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,101 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 156 [2018-12-31 09:32:00,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,722 WARN L181 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 270 [2018-12-31 09:32:00,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:00,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:01,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,143 WARN L181 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 555 DAG size of output: 494 [2018-12-31 09:32:02,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,287 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 168 [2018-12-31 09:32:02,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,555 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 144 [2018-12-31 09:32:02,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:02,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,226 WARN L181 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 270 [2018-12-31 09:32:03,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,384 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 175 [2018-12-31 09:32:03,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,524 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 168 [2018-12-31 09:32:03,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:03,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:05,076 WARN L181 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 488 DAG size of output: 433 [2018-12-31 09:32:05,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:05,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:05,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:05,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:05,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:05,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:05,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:32:05,228 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 166 [2018-12-31 09:32:05,357 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 11 [2018-12-31 09:32:06,435 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2018-12-31 09:32:08,551 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 261 DAG size of output: 55 [2018-12-31 09:32:09,538 WARN L181 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 57 [2018-12-31 09:32:17,512 WARN L181 SmtUtils]: Spent 7.95 s on a formula simplification. DAG size of input: 547 DAG size of output: 82 [2018-12-31 09:32:19,961 WARN L181 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 304 DAG size of output: 47 [2018-12-31 09:32:28,618 WARN L181 SmtUtils]: Spent 8.65 s on a formula simplification. DAG size of input: 595 DAG size of output: 73 [2018-12-31 09:32:30,583 WARN L181 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 261 DAG size of output: 55 [2018-12-31 09:32:31,511 WARN L181 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 26 [2018-12-31 09:32:33,292 WARN L181 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 191 DAG size of output: 77 [2018-12-31 09:32:33,408 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2018-12-31 09:32:33,582 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2018-12-31 09:32:34,375 WARN L181 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 53 [2018-12-31 09:32:34,688 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 25 [2018-12-31 09:32:35,531 WARN L181 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 59 [2018-12-31 09:32:37,054 WARN L181 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 205 DAG size of output: 77 [2018-12-31 09:32:37,210 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 21 [2018-12-31 09:32:37,347 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 26 [2018-12-31 09:32:40,362 WARN L181 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 331 DAG size of output: 45 [2018-12-31 09:32:42,976 WARN L181 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 277 DAG size of output: 49 [2018-12-31 09:32:55,632 WARN L181 SmtUtils]: Spent 12.65 s on a formula simplification. DAG size of input: 680 DAG size of output: 77 [2018-12-31 09:32:57,619 WARN L181 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 227 DAG size of output: 62 [2018-12-31 09:32:58,611 WARN L181 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 57 [2018-12-31 09:32:59,941 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 173 DAG size of output: 34 [2018-12-31 09:33:00,563 WARN L181 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 51 [2018-12-31 09:33:01,592 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 164 DAG size of output: 57 [2018-12-31 09:33:02,396 WARN L181 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 29 [2018-12-31 09:33:04,295 WARN L181 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 261 DAG size of output: 55 [2018-12-31 09:33:09,950 WARN L181 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 489 DAG size of output: 85 [2018-12-31 09:33:10,802 WARN L181 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 59 [2018-12-31 09:33:11,946 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 128 DAG size of output: 57 [2018-12-31 09:33:13,873 WARN L181 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 261 DAG size of output: 55 [2018-12-31 09:33:14,999 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 168 DAG size of output: 71 [2018-12-31 09:33:15,787 WARN L181 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 59 [2018-12-31 09:33:20,734 WARN L181 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 429 DAG size of output: 70 [2018-12-31 09:33:21,544 WARN L181 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 57 [2018-12-31 09:33:21,549 INFO L448 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2018-12-31 09:33:21,550 INFO L444 ceAbstractionStarter]: At program point L2514(lines 2497 2520) the Hoare annotation is: (let ((.cse4 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse6 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= 2 ~rjh~0)) (.cse9 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse10 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse11 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse2 (not (= ULTIMATE.start_mail_~msg 2))) (.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse1 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse3 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse0 .cse1 .cse2 .cse3 (and .cse4 (and (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_setEmailFrom_~handle 2)) .cse8 (= ULTIMATE.start_setEmailTo_~handle 1) .cse9 .cse10 .cse11) (not (= ULTIMATE.start_getEmailFrom_~handle 2)))) (and (and (and .cse4 (and (and .cse5 .cse6 .cse7 (= 2 ~__ste_email_to0~0) .cse9 .cse8 .cse10) .cse11)) (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse2 (not (= ULTIMATE.start_outgoing_~msg 2))) .cse0 .cse1 .cse3))) [2018-12-31 09:33:21,552 INFO L444 ceAbstractionStarter]: At program point L2514-1(lines 2497 2520) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)))) (or (and .cse0 (= 0 |ULTIMATE.start_getClientForwardReceiver_#res|)) (and (and (= 2 ~rjh~0) (= 2 ULTIMATE.start_createEmail_~to) (and (= 1 |ULTIMATE.start_createEmail_#res|) .cse0 (= 1 ULTIMATE.start_createEmail_~msg~0))) (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)))) [2018-12-31 09:33:21,552 INFO L448 ceAbstractionStarter]: For program point L599(lines 599 606) no Hoare annotation was computed. [2018-12-31 09:33:21,553 INFO L444 ceAbstractionStarter]: At program point L599-1(lines 1 2587) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse9 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse10 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse1 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse4 (= 2 ~rjh~0)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse2 (not (= ULTIMATE.start_mail_~msg 2)))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) .cse5 .cse6 .cse7 .cse8)) .cse9 .cse10) (and .cse0 .cse9 .cse10 (let ((.cse11 (and .cse1 (and (and (and .cse5 (and .cse3 .cse7)) .cse4 .cse6) .cse8) .cse2)) (.cse12 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse11 (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse12) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse11 .cse12)))))) [2018-12-31 09:33:21,553 INFO L448 ceAbstractionStarter]: For program point L2548(lines 2548 2564) no Hoare annotation was computed. [2018-12-31 09:33:21,553 INFO L448 ceAbstractionStarter]: For program point L599-2(lines 599 606) no Hoare annotation was computed. [2018-12-31 09:33:21,553 INFO L448 ceAbstractionStarter]: For program point L2548-1(lines 2548 2564) no Hoare annotation was computed. [2018-12-31 09:33:21,553 INFO L448 ceAbstractionStarter]: For program point L1425(lines 1425 1429) no Hoare annotation was computed. [2018-12-31 09:33:21,553 INFO L448 ceAbstractionStarter]: For program point L1392(lines 1392 1396) no Hoare annotation was computed. [2018-12-31 09:33:21,553 INFO L444 ceAbstractionStarter]: At program point L1425-1(lines 1297 1443) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,553 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 974) no Hoare annotation was computed. [2018-12-31 09:33:21,553 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-12-31 09:33:21,553 INFO L448 ceAbstractionStarter]: For program point L963-1(lines 963 974) no Hoare annotation was computed. [2018-12-31 09:33:21,558 INFO L448 ceAbstractionStarter]: For program point L930-1(lines 930 936) no Hoare annotation was computed. [2018-12-31 09:33:21,558 INFO L448 ceAbstractionStarter]: For program point L963-2(lines 963 974) no Hoare annotation was computed. [2018-12-31 09:33:21,558 INFO L448 ceAbstractionStarter]: For program point L930-2(lines 930 936) no Hoare annotation was computed. [2018-12-31 09:33:21,558 INFO L448 ceAbstractionStarter]: For program point L963-3(lines 963 974) no Hoare annotation was computed. [2018-12-31 09:33:21,558 INFO L448 ceAbstractionStarter]: For program point L930-3(lines 930 936) no Hoare annotation was computed. [2018-12-31 09:33:21,559 INFO L444 ceAbstractionStarter]: At program point L898(lines 885 903) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse12 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse13 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse2 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse3 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse4 (= ULTIMATE.start_setClientId_~handle 3)) (.cse5 (= 2 ~rjh~0)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (not (= ULTIMATE.start_mail_~msg 2))) (.cse11 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse14 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and (and .cse2 (and .cse3 .cse4 .cse5 (= 2 ~__ste_email_to0~0) .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) .cse12 .cse13 .cse14)) (and .cse0 .cse1 (and .cse12 .cse13 (let ((.cse15 (and .cse2 (and .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9) .cse10 .cse11))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse15) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse15))) .cse14)))) [2018-12-31 09:33:21,559 INFO L451 ceAbstractionStarter]: At program point L898-1(lines 885 903) the Hoare annotation is: true [2018-12-31 09:33:21,559 INFO L444 ceAbstractionStarter]: At program point L1362(lines 1352 1438) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,559 INFO L444 ceAbstractionStarter]: At program point L1329(lines 1316 1441) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,559 INFO L448 ceAbstractionStarter]: For program point L2552(lines 2552 2563) no Hoare annotation was computed. [2018-12-31 09:33:21,559 INFO L448 ceAbstractionStarter]: For program point L2552-1(lines 2552 2563) no Hoare annotation was computed. [2018-12-31 09:33:21,559 INFO L448 ceAbstractionStarter]: For program point L2090(lines 2090 2102) no Hoare annotation was computed. [2018-12-31 09:33:21,559 INFO L448 ceAbstractionStarter]: For program point L967(lines 967 973) no Hoare annotation was computed. [2018-12-31 09:33:21,559 INFO L448 ceAbstractionStarter]: For program point L967-1(lines 967 973) no Hoare annotation was computed. [2018-12-31 09:33:21,560 INFO L448 ceAbstractionStarter]: For program point L967-2(lines 967 973) no Hoare annotation was computed. [2018-12-31 09:33:21,560 INFO L448 ceAbstractionStarter]: For program point L967-3(lines 967 973) no Hoare annotation was computed. [2018-12-31 09:33:21,560 INFO L448 ceAbstractionStarter]: For program point L1298(lines 1297 1443) no Hoare annotation was computed. [2018-12-31 09:33:21,560 INFO L444 ceAbstractionStarter]: At program point L935(lines 922 940) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse13 (not (= ULTIMATE.start_autoRespond_~msg 2))) (.cse15 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse6 (not (= ULTIMATE.start_mail_~msg 2))) (.cse1 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse9 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0))) (.cse10 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse11 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse14 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse16 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse12 (not (= ULTIMATE.start_getEmailFrom_~handle 2))) (.cse4 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse6 .cse7 (not (= ULTIMATE.start_mail_~msg 1)) .cse8 (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse9 (not (= ULTIMATE.start_autoRespond_~msg 1)) .cse10 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse11 (not (= |ULTIMATE.start_getClientAutoResponse_#res| 0)) .cse12 (not (= ULTIMATE.start_getEmailFrom_~handle 1)) .cse13 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) .cse14 .cse15 (= 0 ULTIMATE.start_getClientAutoResponse_~handle) .cse16) (and .cse0 .cse13 .cse15 .cse6 (and .cse1 .cse9 .cse10 .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse3 .cse11 .cse5 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse14 .cse7 .cse8 .cse16) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client) .cse12 .cse4))) [2018-12-31 09:33:21,560 INFO L444 ceAbstractionStarter]: At program point L935-1(lines 922 940) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse12 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse13 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse2 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse3 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse4 (= ULTIMATE.start_setClientId_~handle 3)) (.cse5 (= 2 ~rjh~0)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (not (= ULTIMATE.start_mail_~msg 2))) (.cse11 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse14 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and (and .cse2 (and .cse3 .cse4 .cse5 (= 2 ~__ste_email_to0~0) .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) .cse12 .cse13 .cse14)) (and .cse0 .cse1 (and .cse12 .cse13 (let ((.cse15 (and .cse2 (and .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9) .cse10 .cse11))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse15) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse15))) .cse14)))) [2018-12-31 09:33:21,561 INFO L444 ceAbstractionStarter]: At program point L935-2(lines 922 940) the Hoare annotation is: (let ((.cse7 (= 2 ~rjh~0)) (.cse8 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle))) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (let ((.cse1 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse2 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse3 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse0 (and (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0)) (and (and .cse7 .cse8 (and .cse4 .cse5)) .cse6)))) (or (and (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2)) (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_mail_~msg 2)) .cse3 (not (= ULTIMATE.start_outgoing_~msg 2))) (and .cse1 .cse2 .cse3 (and (not (= ULTIMATE.start_autoRespond_~msg 1)) (not (= ULTIMATE.start_outgoing_~msg 1)) (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) .cse0 (not (= ULTIMATE.start_mail_~msg 1)))) (and (and (not (= ULTIMATE.start_getEmailTo_~handle 2)) (and (and (= 0 ~__ste_client_forwardReceiver1~0) .cse4) .cse5 .cse6)) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse7 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse8)))) [2018-12-31 09:33:21,564 INFO L451 ceAbstractionStarter]: At program point L935-3(lines 922 940) the Hoare annotation is: true [2018-12-31 09:33:21,564 INFO L444 ceAbstractionStarter]: At program point L671(lines 666 674) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse9 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse10 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse1 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse4 (= 2 ~rjh~0)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse2 (not (= ULTIMATE.start_mail_~msg 2)))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) .cse5 .cse6 .cse7 .cse8)) .cse9 .cse10) (and .cse0 .cse9 .cse10 (let ((.cse11 (and .cse1 (and (and (and .cse5 (and .cse3 .cse7)) .cse4 .cse6) .cse8) .cse2)) (.cse12 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse11 (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse12) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse11 .cse12)))))) [2018-12-31 09:33:21,564 INFO L444 ceAbstractionStarter]: At program point L1398(lines 1388 1435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,564 INFO L448 ceAbstractionStarter]: For program point L1299(lines 1299 1303) no Hoare annotation was computed. [2018-12-31 09:33:21,564 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-12-31 09:33:21,564 INFO L448 ceAbstractionStarter]: For program point L110-1(line 110) no Hoare annotation was computed. [2018-12-31 09:33:21,565 INFO L444 ceAbstractionStarter]: At program point L111(lines 117 134) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse12 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse13 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse2 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse3 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse4 (= ULTIMATE.start_setClientId_~handle 3)) (.cse5 (= 2 ~rjh~0)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (not (= ULTIMATE.start_mail_~msg 2))) (.cse11 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse14 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and (and .cse2 (and .cse3 .cse4 .cse5 (= 2 ~__ste_email_to0~0) .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) .cse12 .cse13 .cse14)) (and .cse0 .cse1 (and .cse12 .cse13 (let ((.cse15 (and .cse2 (and .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9) .cse10 .cse11))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse15) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse15))) .cse14)))) [2018-12-31 09:33:21,565 INFO L451 ceAbstractionStarter]: At program point L111-1(lines 117 134) the Hoare annotation is: true [2018-12-31 09:33:21,565 INFO L448 ceAbstractionStarter]: For program point L2093(lines 2093 2101) no Hoare annotation was computed. [2018-12-31 09:33:21,565 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-12-31 09:33:21,565 INFO L444 ceAbstractionStarter]: At program point L805(lines 785 807) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,565 INFO L448 ceAbstractionStarter]: For program point L2556(lines 2556 2562) no Hoare annotation was computed. [2018-12-31 09:33:21,565 INFO L448 ceAbstractionStarter]: For program point L2556-1(lines 2556 2562) no Hoare annotation was computed. [2018-12-31 09:33:21,565 INFO L448 ceAbstractionStarter]: For program point L1367(lines 1367 1374) no Hoare annotation was computed. [2018-12-31 09:33:21,566 INFO L448 ceAbstractionStarter]: For program point L1334(lines 1334 1338) no Hoare annotation was computed. [2018-12-31 09:33:21,569 INFO L444 ceAbstractionStarter]: At program point L972(lines 959 977) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse6 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse7 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse8 (not (= ULTIMATE.start_mail_~msg 2))) (.cse9 (= 2 ULTIMATE.start_createEmail_~to)) (.cse10 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse11 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_mail_~msg 1)) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-31 09:33:21,569 INFO L444 ceAbstractionStarter]: At program point L972-1(lines 959 977) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse2 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse3 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse14 (not (= ULTIMATE.start_mail_~msg 2))) (.cse7 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse8 (= ULTIMATE.start_setClientId_~handle 3)) (.cse9 (= 2 ~rjh~0)) (.cse10 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse11 (= 2 ULTIMATE.start_createEmail_~to)) (.cse12 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse4 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (let ((.cse5 (and .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14))) (or (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse5 .cse6) (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse5 .cse6))))) (and .cse0 .cse1 (and .cse2 .cse3 (and .cse14 (and .cse7 (and .cse8 .cse9 (= 2 ~__ste_email_to0~0) .cse10 .cse11 .cse12 .cse13)) .cse6) .cse4)))) [2018-12-31 09:33:21,569 INFO L444 ceAbstractionStarter]: At program point L972-2(lines 959 977) the Hoare annotation is: (let ((.cse3 (= 2 ~rjh~0)) (.cse8 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse16 (= ULTIMATE.start_setClientId_~handle 3)) (.cse17 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle))) (let ((.cse2 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse4 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse6 (and .cse16 (not (= ~rjh~0 1)) (not (= |ULTIMATE.start_getEmailTo_#res| 1)) .cse17)) (.cse7 (= 2 ~__ste_email_to0~0)) (.cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse14 (and (and .cse3 .cse8 (and .cse5 (and .cse16 .cse17))) .cse9)) (.cse1 (not (= ULTIMATE.start_mail_~msg 2))) (.cse10 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse11 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse12 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse13 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and (and (and .cse0 .cse1 (and (and .cse2 .cse3 (and .cse4 (and .cse5 .cse6)) .cse7 .cse8) .cse9)) .cse10) .cse11 .cse12 .cse13) (and .cse11 (and (not (= ULTIMATE.start_mail_~msg 1)) (and .cse0 (and (not (= ULTIMATE.start_outgoing_~msg 1)) .cse14))) .cse12 .cse13) (and .cse2 .cse3 (and .cse4 (and (and .cse6 (= 0 ~__ste_client_forwardReceiver1~0)) .cse5 .cse9)) .cse7 .cse8) (and (let ((.cse15 (and .cse0 .cse14 .cse1 .cse10))) (or (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse15) (and .cse15 (not (= ULTIMATE.start_setEmailTo_~handle 2))))) .cse11 .cse12 .cse13)))) [2018-12-31 09:33:21,570 INFO L451 ceAbstractionStarter]: At program point L972-3(lines 959 977) the Hoare annotation is: true [2018-12-31 09:33:21,570 INFO L448 ceAbstractionStarter]: For program point L2525(lines 2525 2537) no Hoare annotation was computed. [2018-12-31 09:33:21,570 INFO L448 ceAbstractionStarter]: For program point L2096(lines 2096 2100) no Hoare annotation was computed. [2018-12-31 09:33:21,570 INFO L444 ceAbstractionStarter]: At program point L2096-2(lines 1 2587) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_test_~op2~0 0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,570 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1407) no Hoare annotation was computed. [2018-12-31 09:33:21,570 INFO L448 ceAbstractionStarter]: For program point L1305(lines 1305 1442) no Hoare annotation was computed. [2018-12-31 09:33:21,570 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-12-31 09:33:21,570 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 585) no Hoare annotation was computed. [2018-12-31 09:33:21,571 INFO L444 ceAbstractionStarter]: At program point L579-1(lines 571 588) the Hoare annotation is: (let ((.cse16 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse8 (= 2 ULTIMATE.start_incoming_~client)) (.cse10 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse1 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse4 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse7 (= 2 ~rjh~0)) (.cse18 (= 2 ~__ste_email_to0~0)) (.cse17 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse2 (not (= ULTIMATE.start_mail_~msg 2))) (.cse12 (= 2 ULTIMATE.start_createEmail_~to)) (.cse14 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse5 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0))) (.cse6 (= ULTIMATE.start_setClientId_~handle 3)) (.cse9 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (not (= ULTIMATE.start_getEmailFrom_~handle 2))) (.cse0 (not (= ULTIMATE.start_autoRespond_~msg 2))) (.cse11 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse19 (not (= ULTIMATE.start_setEmailTo_~handle 2))) (.cse15 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) .cse15 .cse16 .cse17) (and .cse15 .cse16 (and (and .cse1 (and .cse4 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse12 .cse14 .cse13)) .cse19 .cse2 .cse17)) (and .cse1 .cse4 .cse7 .cse18 .cse17 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse2 .cse12 (not (= ULTIMATE.start_mail_~msg 1)) .cse14 (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse5 (not (= ULTIMATE.start_autoRespond_~msg 1)) .cse6 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse9 (not (= |ULTIMATE.start_getClientAutoResponse_#res| 0)) .cse3 (not (= ULTIMATE.start_getEmailFrom_~handle 1)) .cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) (not .cse11) .cse19 .cse15 (= 0 ULTIMATE.start_getClientAutoResponse_~handle) .cse13))) [2018-12-31 09:33:21,571 INFO L448 ceAbstractionStarter]: For program point L2528(lines 2528 2536) no Hoare annotation was computed. [2018-12-31 09:33:21,571 INFO L444 ceAbstractionStarter]: At program point L2561-1(lines 2544 2567) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse10 (not (= ULTIMATE.start_mail_~msg 2))) (.cse3 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse8 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= 2 ~rjh~0)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse7 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse1 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse2 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 .cse2 (and .cse3 (and .cse4 (= 2 ~__ste_email_to0~0) .cse5 .cse6 .cse7 .cse8 .cse9) .cse10)) (and .cse0 (let ((.cse11 (and .cse3 (and (and .cse8 .cse4 .cse5 .cse6 .cse7) .cse9)))) (or (and .cse11 (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse10) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse11 .cse10))) .cse1 .cse2))) [2018-12-31 09:33:21,571 INFO L448 ceAbstractionStarter]: For program point L579-2(lines 579 585) no Hoare annotation was computed. [2018-12-31 09:33:21,571 INFO L444 ceAbstractionStarter]: At program point L2561(lines 2544 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_outgoing_~msg 2)) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:33:21,571 INFO L444 ceAbstractionStarter]: At program point L579-3(lines 571 588) the Hoare annotation is: (let ((.cse3 (= 2 ~rjh~0)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse2 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (not (= ULTIMATE.start_getEmailTo_~handle 2)) (and (and (= 0 ~__ste_client_forwardReceiver1~0) (and .cse0 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle))) .cse1 .cse2)) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse4) (and (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3)) (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client) (and (and (and .cse3 .cse4 (and .cse0 .cse1)) .cse2) (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg))))) [2018-12-31 09:33:21,572 INFO L448 ceAbstractionStarter]: For program point L2066(lines 2066 2082) no Hoare annotation was computed. [2018-12-31 09:33:21,577 INFO L448 ceAbstractionStarter]: For program point L2066-1(lines 2066 2082) no Hoare annotation was computed. [2018-12-31 09:33:21,577 INFO L444 ceAbstractionStarter]: At program point L1340(lines 1330 1440) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,577 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 09:33:21,577 INFO L448 ceAbstractionStarter]: For program point L945(lines 945 953) no Hoare annotation was computed. [2018-12-31 09:33:21,577 INFO L448 ceAbstractionStarter]: For program point L945-2(lines 945 953) no Hoare annotation was computed. [2018-12-31 09:33:21,577 INFO L448 ceAbstractionStarter]: For program point L945-4(lines 945 953) no Hoare annotation was computed. [2018-12-31 09:33:21,577 INFO L448 ceAbstractionStarter]: For program point L2531(lines 2531 2535) no Hoare annotation was computed. [2018-12-31 09:33:21,577 INFO L444 ceAbstractionStarter]: At program point L2531-2(lines 1 2587) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,577 INFO L448 ceAbstractionStarter]: For program point L1309(lines 1309 1313) no Hoare annotation was computed. [2018-12-31 09:33:21,578 INFO L444 ceAbstractionStarter]: At program point L1409(lines 1399 1434) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,578 INFO L444 ceAbstractionStarter]: At program point L1376(lines 1363 1437) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,578 INFO L448 ceAbstractionStarter]: For program point L2070(lines 2070 2081) no Hoare annotation was computed. [2018-12-31 09:33:21,578 INFO L448 ceAbstractionStarter]: For program point L2070-1(lines 2070 2081) no Hoare annotation was computed. [2018-12-31 09:33:21,578 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 952) no Hoare annotation was computed. [2018-12-31 09:33:21,578 INFO L444 ceAbstractionStarter]: At program point L948-2(lines 941 956) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:33:21,578 INFO L448 ceAbstractionStarter]: For program point L948-3(lines 948 952) no Hoare annotation was computed. [2018-12-31 09:33:21,578 INFO L444 ceAbstractionStarter]: At program point L948-5(lines 941 956) the Hoare annotation is: (and (= 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_outgoing_~msg 2)) (= 2 ULTIMATE.start_setEmailTo_~value) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:33:21,578 INFO L448 ceAbstractionStarter]: For program point L948-6(lines 948 952) no Hoare annotation was computed. [2018-12-31 09:33:21,579 INFO L444 ceAbstractionStarter]: At program point L948-8(lines 941 956) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_setClientId_~handle 3)) (.cse6 (= 1 |ULTIMATE.start_createEmail_#res|))) (let ((.cse1 (= 2 ~__ste_email_to0~0)) (.cse12 (and .cse4 .cse6)) (.cse13 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse8 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse9 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse17 (not (= ULTIMATE.start_setEmailTo_~handle 2))) (.cse15 (not (= ULTIMATE.start_autoRespond_~msg 2))) (.cse14 (not (= ULTIMATE.start_mail_~msg 2))) (.cse11 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse0 (= 2 ~rjh~0)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 .cse2 (and (and .cse3 .cse4 (= 0 ~__ste_client_forwardReceiver1~0) .cse5) .cse6 .cse7)) (and .cse8 .cse9 .cse10 (and (and .cse11 (and (and .cse12 .cse0 .cse1 .cse2) .cse7)) .cse13 .cse14)) (and .cse8 .cse9 .cse10 (let ((.cse16 (and .cse11 (and (and (and .cse0 (and .cse12 .cse13) .cse2) .cse7) (not (= ULTIMATE.start_outgoing_~msg 1))) .cse14))) (or (and .cse15 .cse16) (and .cse17 .cse16)))) (and .cse8 .cse9 (let ((.cse18 (and .cse11 (and (and (and (and .cse3 .cse4 .cse5) .cse6) .cse0 .cse2) .cse7)))) (or (and .cse17 .cse14 .cse18) (and .cse15 .cse14 .cse18))) .cse10)))) [2018-12-31 09:33:21,579 INFO L448 ceAbstractionStarter]: For program point L2501-1(lines 2501 2517) no Hoare annotation was computed. [2018-12-31 09:33:21,579 INFO L444 ceAbstractionStarter]: At program point L1444(lines 1296 1445) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,579 INFO L448 ceAbstractionStarter]: For program point L2501(lines 2501 2517) no Hoare annotation was computed. [2018-12-31 09:33:21,579 INFO L448 ceAbstractionStarter]: For program point L1345(lines 1345 1349) no Hoare annotation was computed. [2018-12-31 09:33:21,579 INFO L448 ceAbstractionStarter]: For program point L982(lines 982 990) no Hoare annotation was computed. [2018-12-31 09:33:21,579 INFO L448 ceAbstractionStarter]: For program point L982-2(lines 982 990) no Hoare annotation was computed. [2018-12-31 09:33:21,579 INFO L448 ceAbstractionStarter]: For program point L982-4(lines 982 990) no Hoare annotation was computed. [2018-12-31 09:33:21,579 INFO L448 ceAbstractionStarter]: For program point L982-6(lines 982 990) no Hoare annotation was computed. [2018-12-31 09:33:21,579 INFO L448 ceAbstractionStarter]: For program point L982-8(lines 982 990) no Hoare annotation was computed. [2018-12-31 09:33:21,580 INFO L444 ceAbstractionStarter]: At program point L1511(lines 1500 1514) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:33:21,580 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 09:33:21,580 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 825) no Hoare annotation was computed. [2018-12-31 09:33:21,580 INFO L451 ceAbstractionStarter]: At program point L818-1(lines 818 825) the Hoare annotation is: true [2018-12-31 09:33:21,580 INFO L444 ceAbstractionStarter]: At program point L653(lines 648 656) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse9 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse10 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse1 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse4 (= 2 ~rjh~0)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse2 (not (= ULTIMATE.start_mail_~msg 2)))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) .cse5 .cse6 .cse7 .cse8)) .cse9 .cse10) (and .cse0 .cse9 .cse10 (let ((.cse11 (and .cse1 (and (and (and .cse5 (and .cse3 .cse7)) .cse4 .cse6) .cse8) .cse2)) (.cse12 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse11 (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse12) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse11 .cse12)))))) [2018-12-31 09:33:21,580 INFO L444 ceAbstractionStarter]: At program point L1479(lines 1454 1481) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse2 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse3 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse14 (not (= ULTIMATE.start_mail_~msg 2))) (.cse7 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse8 (= ULTIMATE.start_setClientId_~handle 3)) (.cse9 (= 2 ~rjh~0)) (.cse10 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse11 (= 2 ULTIMATE.start_createEmail_~to)) (.cse12 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse4 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (let ((.cse5 (and .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14))) (or (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse5 .cse6) (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse5 .cse6))))) (and .cse0 .cse1 (and .cse2 .cse3 (and .cse14 (and .cse7 (and .cse8 .cse9 (= 2 ~__ste_email_to0~0) .cse10 .cse11 .cse12 .cse13)) .cse6) .cse4)))) [2018-12-31 09:33:21,580 INFO L451 ceAbstractionStarter]: At program point L1479-1(lines 1454 1481) the Hoare annotation is: true [2018-12-31 09:33:21,580 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 131) no Hoare annotation was computed. [2018-12-31 09:33:21,581 INFO L448 ceAbstractionStarter]: For program point L125-2(lines 125 131) no Hoare annotation was computed. [2018-12-31 09:33:21,581 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2080) no Hoare annotation was computed. [2018-12-31 09:33:21,581 INFO L448 ceAbstractionStarter]: For program point L2074-1(lines 2074 2080) no Hoare annotation was computed. [2018-12-31 09:33:21,581 INFO L448 ceAbstractionStarter]: For program point L1414(lines 1414 1418) no Hoare annotation was computed. [2018-12-31 09:33:21,581 INFO L448 ceAbstractionStarter]: For program point L1381(lines 1381 1385) no Hoare annotation was computed. [2018-12-31 09:33:21,581 INFO L444 ceAbstractionStarter]: At program point L1315(lines 1305 1442) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,581 INFO L444 ceAbstractionStarter]: At program point L93(lines 1 2587) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,581 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 989) no Hoare annotation was computed. [2018-12-31 09:33:21,581 INFO L444 ceAbstractionStarter]: At program point L985-2(lines 978 993) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:33:21,581 INFO L448 ceAbstractionStarter]: For program point L985-3(lines 985 989) no Hoare annotation was computed. [2018-12-31 09:33:21,585 INFO L444 ceAbstractionStarter]: At program point L985-5(lines 978 993) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_setEmailTo_~handle 2))) (.cse6 (= 2 ~__ste_email_to0~0)) (.cse0 (not (= ULTIMATE.start_autoRespond_~msg 2))) (.cse3 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse2 (not (= ULTIMATE.start_mail_~msg 2))) (.cse12 (not (= ULTIMATE.start_getEmailFrom_~handle 2))) (.cse4 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse9 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0))) (.cse10 (= ULTIMATE.start_setClientId_~handle 3)) (.cse5 (= 2 ~rjh~0)) (.cse18 (= 2 ULTIMATE.start_incoming_~client)) (.cse11 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse19 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse13 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse14 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse17 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse15 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse16 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_outgoing_~msg 1)) (not (= ULTIMATE.start_mail_~msg 1)) .cse7 .cse8 (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse9 (not (= ULTIMATE.start_autoRespond_~msg 1)) .cse10 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse11 (not (= |ULTIMATE.start_getClientAutoResponse_#res| 0)) .cse12 (not (= ULTIMATE.start_getEmailFrom_~handle 1)) (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) (not .cse13) (= 0 ULTIMATE.start_getClientAutoResponse_~handle) .cse14) .cse15 .cse16) (and .cse0 .cse1 .cse17 .cse2 (and .cse3 .cse12 (and .cse4 .cse9 .cse10 .cse5 .cse18 .cse6 .cse11 .cse19 .cse7 .cse8 .cse14)) .cse15 .cse16) (and .cse0 (and .cse3 .cse2 .cse12 (and .cse4 .cse9 .cse10 .cse5 .cse18 .cse11 .cse19 .cse13 .cse7 .cse14 .cse8)) .cse17 .cse15 .cse16))) [2018-12-31 09:33:21,585 INFO L448 ceAbstractionStarter]: For program point L985-6(lines 985 989) no Hoare annotation was computed. [2018-12-31 09:33:21,585 INFO L444 ceAbstractionStarter]: At program point L985-8(lines 978 993) the Hoare annotation is: (let ((.cse10 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse11 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse1 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= 2 ~rjh~0)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (not (= ULTIMATE.start_mail_~msg 2))) (.cse9 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse12 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 (= 2 ~__ste_email_to0~0) .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) .cse10 .cse11 .cse12) (and .cse10 .cse11 (let ((.cse13 (and .cse0 (and .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7) .cse8 .cse9))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse13) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse13))) .cse12))) [2018-12-31 09:33:21,585 INFO L448 ceAbstractionStarter]: For program point L985-9(lines 985 989) no Hoare annotation was computed. [2018-12-31 09:33:21,586 INFO L444 ceAbstractionStarter]: At program point L985-11(lines 978 993) the Hoare annotation is: (let ((.cse2 (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle))) (.cse0 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= 2 ~rjh~0)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse1 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (not (= ULTIMATE.start_getEmailTo_~handle 2)) (and .cse0 .cse1 (and .cse2 (= 0 ~__ste_client_forwardReceiver1~0)))) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse4) (and (and (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0)) (and (and (and .cse2 .cse0) .cse3 .cse4) .cse1)) (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3)) (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)))) [2018-12-31 09:33:21,586 INFO L448 ceAbstractionStarter]: For program point L985-12(lines 985 989) no Hoare annotation was computed. [2018-12-31 09:33:21,586 INFO L444 ceAbstractionStarter]: At program point L985-14(lines 978 993) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:33:21,586 INFO L448 ceAbstractionStarter]: For program point L2505-1(lines 2505 2516) no Hoare annotation was computed. [2018-12-31 09:33:21,586 INFO L448 ceAbstractionStarter]: For program point L2505(lines 2505 2516) no Hoare annotation was computed. [2018-12-31 09:33:21,586 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 09:33:21,586 INFO L448 ceAbstractionStarter]: For program point L2572(lines 2572 2584) no Hoare annotation was computed. [2018-12-31 09:33:21,586 INFO L448 ceAbstractionStarter]: For program point L2572-2(lines 2572 2584) no Hoare annotation was computed. [2018-12-31 09:33:21,586 INFO L448 ceAbstractionStarter]: For program point L2572-4(lines 2572 2584) no Hoare annotation was computed. [2018-12-31 09:33:21,587 INFO L444 ceAbstractionStarter]: At program point L558(lines 1 2587) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse1 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse4 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse5 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse6 (not (= ULTIMATE.start_mail_~msg 2))) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse9 (= ULTIMATE.start_setClientId_~handle 3)) (.cse10 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse11 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse12 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client) .cse10 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse6 .cse7 (not (= ULTIMATE.start_mail_~msg 1)) .cse8 (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse9 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse10 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) .cse11 .cse12 .cse13))) [2018-12-31 09:33:21,587 INFO L444 ceAbstractionStarter]: At program point L558-1(lines 1 2587) the Hoare annotation is: (let ((.cse16 (= ULTIMATE.start_setClientId_~handle 3)) (.cse17 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse12 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= 2 ~rjh~0)) (.cse15 (= 2 ULTIMATE.start_createEmail_~to)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0))) (let ((.cse6 (and (and (and (and .cse16 .cse17) .cse12) .cse8 .cse15) .cse13)) (.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse1 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse5 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse3 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse10 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse11 (and .cse16 (not (= ~rjh~0 1)) (not (= |ULTIMATE.start_getEmailTo_#res| 1)) (not (= ULTIMATE.start_incoming_~client 1)) .cse17 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~client 1)))) (.cse7 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse9 (= 2 ULTIMATE.start_incoming_~client)) (.cse14 (= 2 ~__ste_email_to0~0)) (.cse4 (not (= ULTIMATE.start_mail_~msg 2)))) (or (and .cse0 .cse1 (let ((.cse2 (and .cse3 .cse4 .cse5 .cse6))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse2) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse2)))) (and (and (and .cse6 (not (= ULTIMATE.start_outgoing_~msg 1)) (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1))) (not (= ULTIMATE.start_mail_~msg 1))) .cse0 .cse1) (and .cse7 .cse8 .cse9 (and .cse10 (and (and .cse11 (= 0 ~__ste_client_forwardReceiver1~0)) .cse12 .cse13)) .cse14 .cse15) (and .cse0 .cse1 .cse5 (and .cse3 (and (and (and .cse10 (and .cse11 .cse12)) .cse7 .cse8 .cse9 .cse14 .cse15) .cse13) .cse4))))) [2018-12-31 09:33:21,587 INFO L444 ceAbstractionStarter]: At program point L1351(lines 1341 1439) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,587 INFO L448 ceAbstractionStarter]: For program point L889(lines 889 900) no Hoare annotation was computed. [2018-12-31 09:33:21,587 INFO L448 ceAbstractionStarter]: For program point L889-1(lines 889 900) no Hoare annotation was computed. [2018-12-31 09:33:21,587 INFO L444 ceAbstractionStarter]: At program point L2079(lines 2062 2085) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse1 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse4 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse5 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse6 (not (= ULTIMATE.start_mail_~msg 2))) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse9 (= ULTIMATE.start_setClientId_~handle 3)) (.cse10 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse11 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse12 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse6 .cse7 (not (= ULTIMATE.start_mail_~msg 1)) .cse8 (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse9 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse10 (not (= |ULTIMATE.start_getClientAutoResponse_#res| 0)) (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) .cse11 .cse12 (= 0 ULTIMATE.start_getClientAutoResponse_~handle) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client) .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client) .cse10 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse11 .cse12 .cse13))) [2018-12-31 09:33:21,588 INFO L444 ceAbstractionStarter]: At program point L2079-1(lines 2062 2085) the Hoare annotation is: (let ((.cse5 (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle))) (.cse6 (= 1 |ULTIMATE.start_createEmail_#res|))) (let ((.cse17 (and .cse5 .cse6)) (.cse9 (= 2 ~rjh~0)) (.cse12 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0))) (let ((.cse3 (and (and .cse17 .cse9 .cse12) .cse7)) (.cse16 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse4 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse8 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse10 (= 2 ULTIMATE.start_incoming_~client)) (.cse11 (= 2 ~__ste_email_to0~0)) (.cse13 (not (= ULTIMATE.start_mail_~msg 2))) (.cse14 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse1 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse2 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 .cse2 (and (not (= ULTIMATE.start_outgoing_~msg 1)) (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) (not (= ULTIMATE.start_mail_~msg 1)) .cse3)) (and (and .cse4 (and (and (= 0 ~__ste_client_forwardReceiver1~0) .cse5) .cse6 .cse7)) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (let ((.cse15 (and .cse16 .cse3))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse13 .cse14 .cse15) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse13 .cse14 .cse15))) .cse2) (and (and (and .cse16 (and (and (and .cse4 .cse17) .cse8 .cse9 .cse10 .cse11 .cse12) .cse7)) .cse13 .cse14) .cse0 .cse1 .cse2))))) [2018-12-31 09:33:21,588 INFO L448 ceAbstractionStarter]: For program point L2575(lines 2575 2583) no Hoare annotation was computed. [2018-12-31 09:33:21,588 INFO L448 ceAbstractionStarter]: For program point L2509-1(lines 2509 2515) no Hoare annotation was computed. [2018-12-31 09:33:21,588 INFO L448 ceAbstractionStarter]: For program point L2575-2(lines 2575 2583) no Hoare annotation was computed. [2018-12-31 09:33:21,588 INFO L448 ceAbstractionStarter]: For program point L2509(lines 2509 2515) no Hoare annotation was computed. [2018-12-31 09:33:21,588 INFO L448 ceAbstractionStarter]: For program point L2575-4(lines 2575 2583) no Hoare annotation was computed. [2018-12-31 09:33:21,588 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1327) no Hoare annotation was computed. [2018-12-31 09:33:21,588 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 09:33:21,588 INFO L444 ceAbstractionStarter]: At program point L1420(lines 1410 1433) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,589 INFO L444 ceAbstractionStarter]: At program point L1387(lines 1377 1436) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,589 INFO L451 ceAbstractionStarter]: At program point L826(lines 808 828) the Hoare annotation is: true [2018-12-31 09:33:21,589 INFO L444 ceAbstractionStarter]: At program point L1487(lines 1482 1490) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse4 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse6 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= 2 ~rjh~0)) (.cse9 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= 2 ULTIMATE.start_createEmail_~to)) (.cse10 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse11 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse12 (not (= ULTIMATE.start_mail_~msg 2))) (.cse13 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse1 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse2 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse14 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 (and .cse1 .cse2 (let ((.cse3 (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse3) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse3))) .cse14)) (and .cse0 (and (and .cse4 (and .cse5 .cse6 .cse7 (= 2 ~__ste_email_to0~0) .cse9 .cse8 .cse10 .cse11) .cse12 .cse13) .cse1 .cse2 .cse14)))) [2018-12-31 09:33:21,589 INFO L444 ceAbstractionStarter]: At program point L1487-1(lines 1482 1490) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse2 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse3 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse14 (not (= ULTIMATE.start_mail_~msg 2))) (.cse7 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse8 (= ULTIMATE.start_setClientId_~handle 3)) (.cse9 (= 2 ~rjh~0)) (.cse10 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse11 (= 2 ULTIMATE.start_createEmail_~to)) (.cse12 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse4 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (let ((.cse5 (and .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14))) (or (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse5 .cse6) (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse5 .cse6))))) (and .cse0 .cse1 (and .cse2 .cse3 (and .cse14 (and .cse7 (and .cse8 .cse9 (= 2 ~__ste_email_to0~0) .cse10 .cse11 .cse12 .cse13)) .cse6) .cse4)))) [2018-12-31 09:33:21,589 INFO L444 ceAbstractionStarter]: At program point L1487-2(lines 1482 1490) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 1 |ULTIMATE.start_isReadable_#res|) (= 2 ~rjh~0) (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:33:21,589 INFO L451 ceAbstractionStarter]: At program point L1487-3(lines 1482 1490) the Hoare annotation is: true [2018-12-31 09:33:21,589 INFO L448 ceAbstractionStarter]: For program point L926(lines 926 937) no Hoare annotation was computed. [2018-12-31 09:33:21,590 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 899) no Hoare annotation was computed. [2018-12-31 09:33:21,593 INFO L448 ceAbstractionStarter]: For program point L926-1(lines 926 937) no Hoare annotation was computed. [2018-12-31 09:33:21,593 INFO L448 ceAbstractionStarter]: For program point L926-2(lines 926 937) no Hoare annotation was computed. [2018-12-31 09:33:21,593 INFO L448 ceAbstractionStarter]: For program point L893-1(lines 893 899) no Hoare annotation was computed. [2018-12-31 09:33:21,593 INFO L448 ceAbstractionStarter]: For program point L926-3(lines 926 937) no Hoare annotation was computed. [2018-12-31 09:33:21,593 INFO L444 ceAbstractionStarter]: At program point L662(lines 657 665) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse9 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse10 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse1 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse4 (= 2 ~rjh~0)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse2 (not (= ULTIMATE.start_mail_~msg 2)))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) .cse5 .cse6 .cse7 .cse8)) .cse9 .cse10) (and .cse0 .cse9 .cse10 (let ((.cse11 (and .cse1 (and (and (and .cse5 (and .cse3 .cse7)) .cse4 .cse6) .cse8) .cse2)) (.cse12 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse11 (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse12) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse11 .cse12)))))) [2018-12-31 09:33:21,593 INFO L448 ceAbstractionStarter]: For program point L2578(lines 2578 2582) no Hoare annotation was computed. [2018-12-31 09:33:21,593 INFO L444 ceAbstractionStarter]: At program point L2578-2(lines 1 2587) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,594 INFO L448 ceAbstractionStarter]: For program point L2578-3(lines 2578 2582) no Hoare annotation was computed. [2018-12-31 09:33:21,594 INFO L448 ceAbstractionStarter]: For program point L2578-6(lines 2578 2582) no Hoare annotation was computed. [2018-12-31 09:33:21,594 INFO L444 ceAbstractionStarter]: At program point L2578-5(lines 1 2587) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 2) (= 0 ~__ste_client_forwardReceiver1~0) (= ULTIMATE.start_setClientId_~handle ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,594 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1360) no Hoare annotation was computed. [2018-12-31 09:33:21,594 INFO L444 ceAbstractionStarter]: At program point L2578-8(lines 1 2587) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,594 INFO L444 ceAbstractionStarter]: At program point L101(lines 96 104) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:33:21,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:33:21 BoogieIcfgContainer [2018-12-31 09:33:21,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:33:21,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:33:21,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:33:21,738 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:33:21,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:31:19" (3/4) ... [2018-12-31 09:33:21,748 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 09:33:21,791 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 82 nodes and edges [2018-12-31 09:33:21,794 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2018-12-31 09:33:21,797 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-31 09:33:21,799 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 09:33:21,845 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2018-12-31 09:33:21,848 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && !(msg == 2)) && 2 == value) && 1 == msg [2018-12-31 09:33:21,849 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && !(msg == 2)) && 2 == value) && msg == handle) && 1 == msg [2018-12-31 09:33:21,849 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 0 == \result) && 2 == __ste_email_to0) && 1 == \result) && !(msg == 2)) && 2 == value) && !(msg == 1)) && handle == 1) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 1 == msg) || ((((((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && !(msg == 2)) && 2 == value) && 2 == \result) && handle == 1) && !(msg == 2)) && 2 == to) && msg == handle) && 1 == msg) [2018-12-31 09:33:21,850 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 2)) && 2 == to) && msg == handle) && handle == 3) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && client == client) && 1 == msg) || ((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && handle == 3) && 0 == \result) && 1 == \result) && !(msg == 1)) && handle == 1) && client == client) && 1 == msg) [2018-12-31 09:33:21,850 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(msg == 1)) && handle == 1) && client == client) && 0 == handle) && 1 == msg) || ((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 2)) && 2 == to) && handle == client) && msg == handle) && handle == 3) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && client == client) && 1 == msg) [2018-12-31 09:33:21,850 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) && msg == handle) && client == client) && handle == client) && !(msg == 2)) || ((client == client && handle == client) && (((!(msg == 2) && ((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(handle == 2)) && !(msg == 2)) && !(msg == 2))) || (((((((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 2)) && !(msg == 1)) && !(handle == 1)) && !(handle == 2)) && client == client) && 0 == handle) && 1 == msg) [2018-12-31 09:33:21,850 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(msg == 2) && !(handle == 3)) && client == client) && !(msg == 2)) && handle == client) && (!(msg == 2) && ((((((((!(tmp == 0) && !(handle == 2)) && handle == 3) && 2 == rjh) && !(handle == 2)) && 1 == \result) && handle == 1) && 2 == to) && msg == handle) && 1 == msg) && !(handle == 2)) || (((((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(handle == 2)) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) [2018-12-31 09:33:21,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) [2018-12-31 09:33:21,858 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 2)) && !(msg == 1)) && handle == 1) && client == client) && 0 == handle) && 1 == msg) || (((((((!(msg == 2) && !(msg == 2)) && client == client) && !(msg == 2)) && (((((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 2 == \result) && handle == 1) && 2 == to) && msg == handle) && 1 == msg) && handle == client) && !(handle == 2)) && !(msg == 2)) [2018-12-31 09:33:21,859 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || (((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) [2018-12-31 09:33:21,860 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) [2018-12-31 09:33:21,860 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(msg == 2) && !(handle == 2)) && !(msg == 2)) && (((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 1)) && !(msg == 1)) && 2 == to) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 1)) && !(handle == 1)) && 0 == handle) && 1 == msg) && handle == client) && !(msg == 2)) || ((((((!(msg == 2) && !(handle == 2)) && client == client) && !(msg == 2)) && (!(msg == 2) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == \result) && 2 == to) && msg == handle) && 1 == msg) && handle == client) && !(msg == 2))) || ((((!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) && msg == handle) && client == client) && handle == client) && !(msg == 2)) [2018-12-31 09:33:21,860 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) [2018-12-31 09:33:21,860 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 == \result && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) || (1 == \result && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) [2018-12-31 09:33:21,861 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) [2018-12-31 09:33:21,861 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) [2018-12-31 09:33:21,861 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(handle == 3) && client == client) && handle == client) && (!(msg == 2) && (((((2 == rjh && 2 == __ste_email_to0) && 2 == to) && !(handle == 2)) && 1 == \result) && handle == 3) && 1 == msg) && !(msg == 2)) || (((!(handle == 3) && ((((!(msg == 2) && ((((handle == 3 && 2 == rjh) && 2 == to) && !(handle == 2)) && 1 == \result) && 1 == msg) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && !(msg == 2) && ((((handle == 3 && 2 == rjh) && 2 == to) && !(handle == 2)) && 1 == \result) && 1 == msg) && !(msg == 2)))) && client == client) && handle == client) [2018-12-31 09:33:21,861 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) [2018-12-31 09:33:21,862 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 == rjh && 2 == __ste_email_to0) && 2 == to) && ((((1 == msg && handle == 3) && 0 == __ste_client_forwardReceiver1) && msg == handle) && 1 == \result) && 1 == msg) || (((!(handle == 3) && client == client) && handle == client) && ((!(msg == 2) && ((((handle == 3 && 1 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && handle == msg) && !(msg == 2))) || (((!(handle == 3) && client == client) && handle == client) && ((!(msg == 2) && (!(msg == 2) && (((2 == rjh && (handle == 3 && 1 == \result) && handle == msg) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 2)) || (!(handle == 2) && (!(msg == 2) && (((2 == rjh && (handle == 3 && 1 == \result) && handle == msg) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 2))))) || (((!(handle == 3) && client == client) && (((!(handle == 2) && !(msg == 2)) && !(msg == 2) && (((((1 == msg && handle == 3) && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || ((!(msg == 2) && !(msg == 2)) && !(msg == 2) && (((((1 == msg && handle == 3) && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) && handle == client) [2018-12-31 09:33:21,870 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) [2018-12-31 09:33:21,870 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(msg == 2) && !(msg == 2)) && ((((2 == \result && 2 == rjh) && !(handle == 2) && 1 == \result && ((handle == 3 && !(rjh == 1)) && !(\result == 1)) && msg == handle) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || (((!(handle == 3) && !(msg == 1) && !(msg == 2) && !(msg == 1) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && client == client) && handle == client)) || ((((2 == \result && 2 == rjh) && !(handle == 2) && (((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && msg == handle) && 0 == __ste_client_forwardReceiver1) && 1 == \result) && 1 == msg) && 2 == __ste_email_to0) && 2 == to)) || (((((!(msg == 2) && ((!(msg == 2) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((((!(msg == 2) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 2))) && !(handle == 3)) && client == client) && handle == client) [2018-12-31 09:33:21,871 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) [2018-12-31 09:33:21,871 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || (!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) || ((((((((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 1)) && !(msg == 1)) && !(handle == 3)) && client == client)) || (((((2 == \result && 2 == rjh) && 2 == client) && !(handle == 2) && (((((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && !(client == 1)) && msg == handle) && !(client == 1)) && 0 == __ste_client_forwardReceiver1) && 1 == \result) && 1 == msg) && 2 == __ste_email_to0) && 2 == to)) || (((!(handle == 3) && client == client) && !(msg == 2)) && (!(msg == 2) && ((((((!(handle == 2) && (((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && !(client == 1)) && msg == handle) && !(client == 1)) && 1 == \result) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) [2018-12-31 09:33:21,871 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) [2018-12-31 09:33:21,871 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(handle == 3) && client == client) && handle == client) && ((!(msg == 1) && !(msg == 1)) && !(msg == 1)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || ((((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to)) || (((!(handle == 3) && client == client) && ((((!(handle == 2) && !(msg == 2)) && !(msg == 2)) && !(msg == 2) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || (((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && !(msg == 2) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) && handle == client)) || ((((((!(msg == 2) && ((((((!(handle == 2) && (handle == 3 && msg == handle) && 1 == \result) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) [2018-12-31 09:33:21,871 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) [2018-12-31 09:33:21,871 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == to) || (((!(handle == 3) && client == client) && handle == client) && (((2 == rjh && 2 == to) && handle == 3 && 1 == \result) && 1 == msg) && handle == msg) [2018-12-31 09:33:21,878 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && !(to == 1)) && !(rjh == 1)) && msg == handle) && 0 == \result) || ((((2 == rjh && 2 == to) && (1 == \result && ((handle == 3 && !(to == 1)) && !(rjh == 1)) && msg == handle) && 1 == msg) && client == client) && handle == client) [2018-12-31 09:33:21,878 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(msg == 2) && !(msg == 2)) && !(tmp == 0) && ((2 == rjh && 2 == to) && (handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && !(handle == 3)) && client == client) && !(msg == 2)) && handle == client) && !(msg == 2)) || (((!(handle == 3) && client == client) && handle == client) && (((!(msg == 1) && !(msg == 1)) && !(msg == 1)) && !(tmp == 0) && ((2 == rjh && 2 == to) && (handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && !(msg == 1))) || ((((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) [2018-12-31 09:33:21,878 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && 2 == rjh) && client == client) && 1 == \result) && 2 == to) && handle == client) && msg == handle) && 1 == msg [2018-12-31 09:33:21,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(handle == 2) && (1 == \result && 1 == msg) && (handle == 3 && msg == handle) && 0 == __ste_client_forwardReceiver1) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == to) || ((((!(tmp == 0) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && !(handle == 3)) && client == client) && handle == client) [2018-12-31 09:33:21,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && 1 == \result) && 2 == rjh) && client == client) && 1 == \result) && 2 == to) && handle == client) && msg == handle) && 1 == msg [2018-12-31 09:33:22,028 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:33:22,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:33:22,029 INFO L168 Benchmark]: Toolchain (without parser) took 126255.32 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-31 09:33:22,030 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:33:22,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1122.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -102.7 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:33:22,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:33:22,034 INFO L168 Benchmark]: Boogie Preprocessor took 103.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:33:22,035 INFO L168 Benchmark]: RCFGBuilder took 2229.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 939.3 MB in the end (delta: 102.5 MB). Peak memory consumption was 102.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:33:22,035 INFO L168 Benchmark]: TraceAbstraction took 122388.53 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 932.3 MB in the beginning and 1.1 GB in the end (delta: -206.2 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-31 09:33:22,035 INFO L168 Benchmark]: Witness Printer took 290.42 ms. Allocated memory is still 3.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-31 09:33:22,041 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.15 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 1122.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -102.7 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 113.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2229.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 939.3 MB in the end (delta: 102.5 MB). Peak memory consumption was 102.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 122388.53 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 932.3 MB in the beginning and 1.1 GB in the end (delta: -206.2 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 290.42 ms. Allocated memory is still 3.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: 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: 1296]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((handle == 2 && 0 == __ste_client_forwardReceiver1) && handle == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 959]: Loop Invariant Derived loop invariant: ((((((((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 0 == \result) && 2 == __ste_email_to0) && 1 == \result) && !(msg == 2)) && 2 == value) && !(msg == 1)) && handle == 1) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 1 == msg) || ((((((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && !(msg == 2)) && 2 == value) && 2 == \result) && handle == 1) && !(msg == 2)) && 2 == to) && msg == handle) && 1 == msg) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) - InvariantResult [Line: 959]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((handle == 3 && 2 == rjh) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 959]: Loop Invariant Derived loop invariant: ((((((((!(msg == 2) && !(msg == 2)) && ((((2 == \result && 2 == rjh) && !(handle == 2) && 1 == \result && ((handle == 3 && !(rjh == 1)) && !(\result == 1)) && msg == handle) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || (((!(handle == 3) && !(msg == 1) && !(msg == 2) && !(msg == 1) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && client == client) && handle == client)) || ((((2 == \result && 2 == rjh) && !(handle == 2) && (((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && msg == handle) && 0 == __ste_client_forwardReceiver1) && 1 == \result) && 1 == msg) && 2 == __ste_email_to0) && 2 == to)) || (((((!(msg == 2) && ((!(msg == 2) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((((!(msg == 2) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 2))) && !(handle == 3)) && client == client) && handle == client) - InvariantResult [Line: 808]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((handle == 3 && 2 == rjh) && op2 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: (((((!(handle == 2) && (1 == \result && 1 == msg) && (handle == 3 && msg == handle) && 0 == __ste_client_forwardReceiver1) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == to) || ((((!(tmp == 0) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && !(handle == 3)) && client == client) && handle == client) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((2 == rjh && 2 == __ste_email_to0) && 2 == to) && ((((1 == msg && handle == 3) && 0 == __ste_client_forwardReceiver1) && msg == handle) && 1 == \result) && 1 == msg) || (((!(handle == 3) && client == client) && handle == client) && ((!(msg == 2) && ((((handle == 3 && 1 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && handle == msg) && !(msg == 2))) || (((!(handle == 3) && client == client) && handle == client) && ((!(msg == 2) && (!(msg == 2) && (((2 == rjh && (handle == 3 && 1 == \result) && handle == msg) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 2)) || (!(handle == 2) && (!(msg == 2) && (((2 == rjh && (handle == 3 && 1 == \result) && handle == msg) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 2))))) || (((!(handle == 3) && client == client) && (((!(handle == 2) && !(msg == 2)) && !(msg == 2) && (((((1 == msg && handle == 3) && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || ((!(msg == 2) && !(msg == 2)) && !(msg == 2) && (((((1 == msg && handle == 3) && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) && handle == client) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 657]: Loop Invariant Derived loop invariant: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: ((((((handle == 3 && 2 == rjh) && client == client) && 1 == \result) && 2 == to) && handle == client) && msg == handle) && 1 == msg - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: ((((((!(msg == 2) && !(handle == 2)) && !(msg == 2)) && (((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 1)) && !(msg == 1)) && 2 == to) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 1)) && !(handle == 1)) && 0 == handle) && 1 == msg) && handle == client) && !(msg == 2)) || ((((((!(msg == 2) && !(handle == 2)) && client == client) && !(msg == 2)) && (!(msg == 2) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == \result) && 2 == to) && msg == handle) && 1 == msg) && handle == client) && !(msg == 2))) || ((((!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) && msg == handle) && client == client) && handle == client) && !(msg == 2)) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((handle == 3 && 2 == rjh) && !(handle == 2)) && 2 == to) && !(__ste_email_to0 == 1)) && 1 == msg - InvariantResult [Line: 1500]: Loop Invariant Derived loop invariant: (((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: ((((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || (((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) - InvariantResult [Line: 785]: Loop Invariant Derived loop invariant: ((handle == 3 && 2 == rjh) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && !(msg == 2)) && 2 == value) && msg == handle) && 1 == msg - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) - InvariantResult [Line: 571]: Loop Invariant Derived loop invariant: (((((!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) && msg == handle) && client == client) && handle == client) && !(msg == 2)) || ((client == client && handle == client) && (((!(msg == 2) && ((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(handle == 2)) && !(msg == 2)) && !(msg == 2))) || (((((((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 2)) && !(msg == 1)) && !(handle == 1)) && !(handle == 2)) && client == client) && 0 == handle) && 1 == msg) - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: ((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(handle == 2)) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 1399]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1410]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2544]: Loop Invariant Derived loop invariant: ((((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && !(msg == 2)) && 2 == value) && 1 == msg - InvariantResult [Line: 1377]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1388]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 571]: Loop Invariant Derived loop invariant: (((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == to) || (((!(handle == 3) && client == client) && handle == client) && (((2 == rjh && 2 == to) && handle == 3 && 1 == \result) && 1 == msg) && handle == msg) - InvariantResult [Line: 1363]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2544]: Loop Invariant Derived loop invariant: (((!(handle == 3) && client == client) && handle == client) && (!(msg == 2) && (((((2 == rjh && 2 == __ste_email_to0) && 2 == to) && !(handle == 2)) && 1 == \result) && handle == 3) && 1 == msg) && !(msg == 2)) || (((!(handle == 3) && ((((!(msg == 2) && ((((handle == 3 && 2 == rjh) && 2 == to) && !(handle == 2)) && 1 == \result) && 1 == msg) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && !(msg == 2) && ((((handle == 3 && 2 == rjh) && 2 == to) && !(handle == 2)) && 1 == \result) && 1 == msg) && !(msg == 2)))) && client == client) && handle == client) - InvariantResult [Line: 2062]: Loop Invariant Derived loop invariant: (((((!(handle == 3) && client == client) && handle == client) && ((!(msg == 1) && !(msg == 1)) && !(msg == 1)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || ((((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to)) || (((!(handle == 3) && client == client) && ((((!(handle == 2) && !(msg == 2)) && !(msg == 2)) && !(msg == 2) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || (((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && !(msg == 2) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) && handle == client)) || ((((((!(msg == 2) && ((((((!(handle == 2) && (handle == 3 && msg == handle) && 1 == \result) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((!(msg == 2) && !(handle == 3)) && client == client) && !(msg == 2)) && handle == client) && (!(msg == 2) && ((((((((!(tmp == 0) && !(handle == 2)) && handle == 3) && 2 == rjh) && !(handle == 2)) && 1 == \result) && handle == 1) && 2 == to) && msg == handle) && 1 == msg) && !(handle == 2)) || (((((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(handle == 2)) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) - InvariantResult [Line: 1341]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1454]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) - InvariantResult [Line: 1352]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1316]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1330]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: ((((handle == 3 && !(to == 1)) && !(rjh == 1)) && msg == handle) && 0 == \result) || ((((2 == rjh && 2 == to) && (1 == \result && ((handle == 3 && !(to == 1)) && !(rjh == 1)) && msg == handle) && 1 == msg) && client == client) && handle == client) - InvariantResult [Line: 1454]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (!(rjh == 1) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1305]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 2)) && 2 == to) && msg == handle) && handle == 3) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && client == client) && 1 == msg) || ((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && handle == 3) && 0 == \result) && 1 == \result) && !(msg == 1)) && handle == 1) && client == client) && 1 == msg) - InvariantResult [Line: 1482]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) - InvariantResult [Line: 1482]: Loop Invariant Derived loop invariant: (((((((handle == 3 && 1 == \result) && 2 == rjh) && client == client) && 1 == \result) && 2 == to) && handle == client) && msg == handle) && 1 == msg - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || (!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) || ((((((((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 1)) && !(msg == 1)) && !(handle == 3)) && client == client)) || (((((2 == \result && 2 == rjh) && 2 == client) && !(handle == 2) && (((((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && !(client == 1)) && msg == handle) && !(client == 1)) && 0 == __ste_client_forwardReceiver1) && 1 == \result) && 1 == msg) && 2 == __ste_email_to0) && 2 == to)) || (((!(handle == 3) && client == client) && !(msg == 2)) && (!(msg == 2) && ((((((!(handle == 2) && (((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && !(client == 1)) && msg == handle) && !(client == 1)) && 1 == \result) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) - InvariantResult [Line: 885]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) - InvariantResult [Line: 885]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1482]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2062]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(msg == 1)) && handle == 1) && client == client) && 0 == handle) && 1 == msg) || ((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 2)) && 2 == to) && handle == client) && msg == handle) && handle == 3) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && client == client) && 1 == msg) - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) - InvariantResult [Line: 959]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 2)) && !(msg == 1)) && handle == 1) && client == client) && 0 == handle) && 1 == msg) || (((((((!(msg == 2) && !(msg == 2)) && client == client) && !(msg == 2)) && (((((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 2 == \result) && handle == 1) && 2 == to) && msg == handle) && 1 == msg) && handle == client) && !(handle == 2)) && !(msg == 2)) - InvariantResult [Line: 818]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: ((((((((!(msg == 2) && !(msg == 2)) && !(tmp == 0) && ((2 == rjh && 2 == to) && (handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && !(handle == 3)) && client == client) && !(msg == 2)) && handle == client) && !(msg == 2)) || (((!(handle == 3) && client == client) && handle == client) && (((!(msg == 1) && !(msg == 1)) && !(msg == 1)) && !(tmp == 0) && ((2 == rjh && 2 == to) && (handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && !(msg == 1))) || ((((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) - InvariantResult [Line: 1297]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1482]: Loop Invariant Derived loop invariant: (1 == \result && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) || (1 == \result && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 162 locations, 2 error locations. SAFE Result, 122.1s OverallTime, 25 OverallIterations, 2 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 98.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 6762 SDtfs, 14330 SDslu, 16221 SDs, 0 SdLazy, 1684 SolverSat, 327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2297occurred in iteration=24, 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: 2.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 8378 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 63 PreInvPairs, 1169 NumberOfFragments, 4777 HoareAnnotationTreeSize, 63 FomulaSimplifications, 6457476240584 FormulaSimplificationTreeSizeReduction, 21.8s HoareSimplificationTime, 63 FomulaSimplificationsInter, 24604585247 FormulaSimplificationTreeSizeReductionInter, 76.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1303 NumberOfCodeBlocks, 1303 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1278 ConstructedInterpolants, 0 QuantifiedInterpolants, 103546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...