./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/product-lines/email_spec11_product03.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 cdb705451c6fea738760a6b9963fc72ac4c0d764 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:13:00,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:13:00,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:13:00,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:13:00,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:13:00,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:13:00,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:13:00,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:13:00,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:13:00,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:13:00,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:13:00,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:13:00,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:13:00,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:13:00,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:13:00,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:13:00,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:13:00,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:13:00,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:13:00,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:13:00,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:13:00,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:13:00,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:13:00,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:13:00,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:13:00,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:13:00,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:13:00,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:13:00,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:13:00,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:13:00,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:13:00,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:13:00,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:13:00,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:13:00,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:13:00,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:13:00,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:13:00,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:13:00,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:13:00,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:13:00,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:13:00,907 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:13:00,931 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:13:00,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:13:00,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:13:00,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:13:00,934 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:13:00,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:13:00,935 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:13:00,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:13:00,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:13:00,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:13:00,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:13:00,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:13:00,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:13:00,938 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:13:00,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:13:00,939 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:13:00,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:13:00,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:13:00,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:13:00,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:13:00,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:13:00,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:13:00,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:13:00,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:13:00,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:13:00,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:13:00,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:13:00,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:13:00,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> cdb705451c6fea738760a6b9963fc72ac4c0d764 [2019-11-28 00:13:01,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:13:01,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:13:01,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:13:01,292 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:13:01,293 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:13:01,293 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product03.cil.c [2019-11-28 00:13:01,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d2bbd65/cb12134b49de45b4bfeda17bcedaf7c9/FLAG00d7267fa [2019-11-28 00:13:01,995 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:13:01,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product03.cil.c [2019-11-28 00:13:02,027 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d2bbd65/cb12134b49de45b4bfeda17bcedaf7c9/FLAG00d7267fa [2019-11-28 00:13:02,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d2bbd65/cb12134b49de45b4bfeda17bcedaf7c9 [2019-11-28 00:13:02,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:13:02,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:13:02,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:13:02,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:13:02,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:13:02,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:13:02" (1/1) ... [2019-11-28 00:13:02,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4f4d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:02, skipping insertion in model container [2019-11-28 00:13:02,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:13:02" (1/1) ... [2019-11-28 00:13:02,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:13:02,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:13:03,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:13:03,046 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:13:03,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:13:03,271 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:13:03,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03 WrapperNode [2019-11-28 00:13:03,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:13:03,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:13:03,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:13:03,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:13:03,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03" (1/1) ... [2019-11-28 00:13:03,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03" (1/1) ... [2019-11-28 00:13:03,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:13:03,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:13:03,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:13:03,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:13:03,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03" (1/1) ... [2019-11-28 00:13:03,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03" (1/1) ... [2019-11-28 00:13:03,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03" (1/1) ... [2019-11-28 00:13:03,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03" (1/1) ... [2019-11-28 00:13:03,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03" (1/1) ... [2019-11-28 00:13:03,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03" (1/1) ... [2019-11-28 00:13:03,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03" (1/1) ... [2019-11-28 00:13:03,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:13:03,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:13:03,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:13:03,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:13:03,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:13:03,574 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-28 00:13:03,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:13:03,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:13:03,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:13:03,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:13:04,638 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:13:04,639 INFO L297 CfgBuilder]: Removed 111 assume(true) statements. [2019-11-28 00:13:04,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:13:04 BoogieIcfgContainer [2019-11-28 00:13:04,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:13:04,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:13:04,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:13:04,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:13:04,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:13:02" (1/3) ... [2019-11-28 00:13:04,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e9c146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:13:04, skipping insertion in model container [2019-11-28 00:13:04,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:03" (2/3) ... [2019-11-28 00:13:04,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e9c146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:13:04, skipping insertion in model container [2019-11-28 00:13:04,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:13:04" (3/3) ... [2019-11-28 00:13:04,650 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product03.cil.c [2019-11-28 00:13:04,661 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:13:04,670 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 00:13:04,683 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-28 00:13:04,706 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:13:04,706 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:13:04,707 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:13:04,707 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:13:04,707 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:13:04,707 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:13:04,707 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:13:04,708 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:13:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2019-11-28 00:13:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:13:04,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:04,736 INFO L410 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] [2019-11-28 00:13:04,737 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:04,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1526697543, now seen corresponding path program 1 times [2019-11-28 00:13:04,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:04,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167277404] [2019-11-28 00:13:04,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:13:05,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167277404] [2019-11-28 00:13:05,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:05,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:13:05,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249335038] [2019-11-28 00:13:05,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:13:05,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:05,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:13:05,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:13:05,211 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 2 states. [2019-11-28 00:13:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:05,247 INFO L93 Difference]: Finished difference Result 189 states and 299 transitions. [2019-11-28 00:13:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:13:05,249 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-11-28 00:13:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:05,264 INFO L225 Difference]: With dead ends: 189 [2019-11-28 00:13:05,264 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 00:13:05,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:13:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 00:13:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-28 00:13:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 00:13:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 170 transitions. [2019-11-28 00:13:05,323 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 170 transitions. Word has length 32 [2019-11-28 00:13:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:05,324 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 170 transitions. [2019-11-28 00:13:05,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:13:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 170 transitions. [2019-11-28 00:13:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:13:05,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:05,327 INFO L410 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] [2019-11-28 00:13:05,327 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:05,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:05,328 INFO L82 PathProgramCache]: Analyzing trace with hash -380016211, now seen corresponding path program 1 times [2019-11-28 00:13:05,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:05,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715304545] [2019-11-28 00:13:05,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:13:05,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715304545] [2019-11-28 00:13:05,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:05,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:13:05,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008670843] [2019-11-28 00:13:05,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:13:05,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:05,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:13:05,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:05,490 INFO L87 Difference]: Start difference. First operand 107 states and 170 transitions. Second operand 3 states. [2019-11-28 00:13:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:05,568 INFO L93 Difference]: Finished difference Result 294 states and 468 transitions. [2019-11-28 00:13:05,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:13:05,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 00:13:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:05,571 INFO L225 Difference]: With dead ends: 294 [2019-11-28 00:13:05,572 INFO L226 Difference]: Without dead ends: 198 [2019-11-28 00:13:05,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-28 00:13:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 106. [2019-11-28 00:13:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 00:13:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 166 transitions. [2019-11-28 00:13:05,589 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 166 transitions. Word has length 33 [2019-11-28 00:13:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:05,590 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 166 transitions. [2019-11-28 00:13:05,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:13:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 166 transitions. [2019-11-28 00:13:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 00:13:05,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:05,592 INFO L410 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] [2019-11-28 00:13:05,593 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2080487648, now seen corresponding path program 1 times [2019-11-28 00:13:05,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:05,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609090702] [2019-11-28 00:13:05,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:13:05,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609090702] [2019-11-28 00:13:05,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:05,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:13:05,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243781166] [2019-11-28 00:13:05,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:13:05,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:05,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:13:05,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:05,704 INFO L87 Difference]: Start difference. First operand 106 states and 166 transitions. Second operand 3 states. [2019-11-28 00:13:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:05,748 INFO L93 Difference]: Finished difference Result 198 states and 312 transitions. [2019-11-28 00:13:05,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:13:05,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-28 00:13:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:05,751 INFO L225 Difference]: With dead ends: 198 [2019-11-28 00:13:05,751 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 00:13:05,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 00:13:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-11-28 00:13:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 00:13:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 163 transitions. [2019-11-28 00:13:05,769 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 163 transitions. Word has length 34 [2019-11-28 00:13:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:05,770 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 163 transitions. [2019-11-28 00:13:05,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:13:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 163 transitions. [2019-11-28 00:13:05,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:13:05,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:05,772 INFO L410 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] [2019-11-28 00:13:05,773 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:05,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:05,773 INFO L82 PathProgramCache]: Analyzing trace with hash 77051259, now seen corresponding path program 1 times [2019-11-28 00:13:05,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:05,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975887436] [2019-11-28 00:13:05,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:13:05,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975887436] [2019-11-28 00:13:05,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:05,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:13:05,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719561255] [2019-11-28 00:13:05,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:13:05,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:13:05,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:05,871 INFO L87 Difference]: Start difference. First operand 106 states and 163 transitions. Second operand 3 states. [2019-11-28 00:13:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:05,891 INFO L93 Difference]: Finished difference Result 169 states and 255 transitions. [2019-11-28 00:13:05,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:13:05,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 00:13:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:05,893 INFO L225 Difference]: With dead ends: 169 [2019-11-28 00:13:05,894 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 00:13:05,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 00:13:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-11-28 00:13:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 00:13:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 165 transitions. [2019-11-28 00:13:05,913 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 165 transitions. Word has length 36 [2019-11-28 00:13:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:05,913 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 165 transitions. [2019-11-28 00:13:05,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:13:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 165 transitions. [2019-11-28 00:13:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 00:13:05,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:05,918 INFO L410 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] [2019-11-28 00:13:05,919 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:05,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:05,919 INFO L82 PathProgramCache]: Analyzing trace with hash -382569238, now seen corresponding path program 1 times [2019-11-28 00:13:05,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:05,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260123556] [2019-11-28 00:13:05,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:06,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260123556] [2019-11-28 00:13:06,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:06,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 00:13:06,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320282254] [2019-11-28 00:13:06,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:13:06,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:13:06,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:13:06,114 INFO L87 Difference]: Start difference. First operand 108 states and 165 transitions. Second operand 10 states. [2019-11-28 00:13:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:07,023 INFO L93 Difference]: Finished difference Result 383 states and 530 transitions. [2019-11-28 00:13:07,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 00:13:07,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-11-28 00:13:07,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:07,026 INFO L225 Difference]: With dead ends: 383 [2019-11-28 00:13:07,026 INFO L226 Difference]: Without dead ends: 345 [2019-11-28 00:13:07,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 00:13:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-28 00:13:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 128. [2019-11-28 00:13:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 00:13:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2019-11-28 00:13:07,043 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 41 [2019-11-28 00:13:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:07,043 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2019-11-28 00:13:07,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:13:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2019-11-28 00:13:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 00:13:07,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:07,045 INFO L410 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] [2019-11-28 00:13:07,045 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash -432538479, now seen corresponding path program 1 times [2019-11-28 00:13:07,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:07,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000132487] [2019-11-28 00:13:07,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:07,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000132487] [2019-11-28 00:13:07,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:07,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:13:07,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219690936] [2019-11-28 00:13:07,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:13:07,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:07,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:13:07,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:13:07,135 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand 6 states. [2019-11-28 00:13:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:07,247 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2019-11-28 00:13:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:13:07,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-28 00:13:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:07,249 INFO L225 Difference]: With dead ends: 202 [2019-11-28 00:13:07,249 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 00:13:07,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:13:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 00:13:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2019-11-28 00:13:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 00:13:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2019-11-28 00:13:07,269 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 42 [2019-11-28 00:13:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:07,269 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2019-11-28 00:13:07,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:13:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2019-11-28 00:13:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 00:13:07,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:07,276 INFO L410 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] [2019-11-28 00:13:07,276 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:07,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:07,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1755201452, now seen corresponding path program 1 times [2019-11-28 00:13:07,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:07,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886315558] [2019-11-28 00:13:07,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:07,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886315558] [2019-11-28 00:13:07,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:07,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:13:07,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674872696] [2019-11-28 00:13:07,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:13:07,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:07,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:13:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:13:07,424 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand 5 states. [2019-11-28 00:13:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:07,529 INFO L93 Difference]: Finished difference Result 336 states and 494 transitions. [2019-11-28 00:13:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:13:07,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-28 00:13:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:07,532 INFO L225 Difference]: With dead ends: 336 [2019-11-28 00:13:07,532 INFO L226 Difference]: Without dead ends: 281 [2019-11-28 00:13:07,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:13:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-28 00:13:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 222. [2019-11-28 00:13:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-28 00:13:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 339 transitions. [2019-11-28 00:13:07,553 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 339 transitions. Word has length 42 [2019-11-28 00:13:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:07,553 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 339 transitions. [2019-11-28 00:13:07,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:13:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 339 transitions. [2019-11-28 00:13:07,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 00:13:07,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:07,554 INFO L410 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] [2019-11-28 00:13:07,555 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:07,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:07,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1213981371, now seen corresponding path program 1 times [2019-11-28 00:13:07,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:07,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801815181] [2019-11-28 00:13:07,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:07,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801815181] [2019-11-28 00:13:07,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:07,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 00:13:07,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574821795] [2019-11-28 00:13:07,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 00:13:07,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 00:13:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:13:07,657 INFO L87 Difference]: Start difference. First operand 222 states and 339 transitions. Second operand 9 states. [2019-11-28 00:13:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:08,124 INFO L93 Difference]: Finished difference Result 640 states and 894 transitions. [2019-11-28 00:13:08,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 00:13:08,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-11-28 00:13:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:08,128 INFO L225 Difference]: With dead ends: 640 [2019-11-28 00:13:08,130 INFO L226 Difference]: Without dead ends: 533 [2019-11-28 00:13:08,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:13:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-11-28 00:13:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 293. [2019-11-28 00:13:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-28 00:13:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 437 transitions. [2019-11-28 00:13:08,169 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 437 transitions. Word has length 43 [2019-11-28 00:13:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:08,169 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 437 transitions. [2019-11-28 00:13:08,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 00:13:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 437 transitions. [2019-11-28 00:13:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 00:13:08,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:08,171 INFO L410 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] [2019-11-28 00:13:08,171 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash 405877855, now seen corresponding path program 1 times [2019-11-28 00:13:08,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:08,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968240967] [2019-11-28 00:13:08,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:08,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968240967] [2019-11-28 00:13:08,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:08,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:13:08,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553934263] [2019-11-28 00:13:08,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:13:08,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:08,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:13:08,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:13:08,233 INFO L87 Difference]: Start difference. First operand 293 states and 437 transitions. Second operand 4 states. [2019-11-28 00:13:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:08,278 INFO L93 Difference]: Finished difference Result 364 states and 527 transitions. [2019-11-28 00:13:08,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:13:08,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-28 00:13:08,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:08,281 INFO L225 Difference]: With dead ends: 364 [2019-11-28 00:13:08,281 INFO L226 Difference]: Without dead ends: 229 [2019-11-28 00:13:08,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:13:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-28 00:13:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 197. [2019-11-28 00:13:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-28 00:13:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 293 transitions. [2019-11-28 00:13:08,303 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 293 transitions. Word has length 44 [2019-11-28 00:13:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:08,303 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 293 transitions. [2019-11-28 00:13:08,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:13:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 293 transitions. [2019-11-28 00:13:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 00:13:08,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:08,306 INFO L410 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] [2019-11-28 00:13:08,306 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:08,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:08,307 INFO L82 PathProgramCache]: Analyzing trace with hash 495067749, now seen corresponding path program 1 times [2019-11-28 00:13:08,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:08,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460123161] [2019-11-28 00:13:08,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:13:08,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460123161] [2019-11-28 00:13:08,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:08,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:13:08,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798737547] [2019-11-28 00:13:08,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:13:08,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:08,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:13:08,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:08,380 INFO L87 Difference]: Start difference. First operand 197 states and 293 transitions. Second operand 3 states. [2019-11-28 00:13:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:08,424 INFO L93 Difference]: Finished difference Result 551 states and 831 transitions. [2019-11-28 00:13:08,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:13:08,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-28 00:13:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:08,427 INFO L225 Difference]: With dead ends: 551 [2019-11-28 00:13:08,430 INFO L226 Difference]: Without dead ends: 373 [2019-11-28 00:13:08,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-28 00:13:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 253. [2019-11-28 00:13:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-28 00:13:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 397 transitions. [2019-11-28 00:13:08,462 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 397 transitions. Word has length 46 [2019-11-28 00:13:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:08,462 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 397 transitions. [2019-11-28 00:13:08,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:13:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 397 transitions. [2019-11-28 00:13:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 00:13:08,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:08,464 INFO L410 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] [2019-11-28 00:13:08,464 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:08,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2020018879, now seen corresponding path program 1 times [2019-11-28 00:13:08,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:08,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862008065] [2019-11-28 00:13:08,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:08,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862008065] [2019-11-28 00:13:08,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:08,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:13:08,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551975624] [2019-11-28 00:13:08,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:13:08,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:08,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:13:08,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:13:08,535 INFO L87 Difference]: Start difference. First operand 253 states and 397 transitions. Second operand 4 states. [2019-11-28 00:13:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:08,588 INFO L93 Difference]: Finished difference Result 281 states and 435 transitions. [2019-11-28 00:13:08,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:13:08,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-28 00:13:08,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:08,589 INFO L225 Difference]: With dead ends: 281 [2019-11-28 00:13:08,589 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:13:08,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:13:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:13:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:13:08,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:13:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:13:08,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2019-11-28 00:13:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:08,592 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:13:08,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:13:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:13:08,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:13:08,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:13:08,875 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 117 [2019-11-28 00:13:09,197 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-11-28 00:13:09,421 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 81 [2019-11-28 00:13:10,291 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 16 [2019-11-28 00:13:10,754 WARN L192 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-11-28 00:13:10,983 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-11-28 00:13:11,166 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2019-11-28 00:13:11,454 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-11-28 00:13:11,860 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-11-28 00:13:12,204 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 14 [2019-11-28 00:13:12,520 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-11-28 00:13:12,764 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 26 [2019-11-28 00:13:12,954 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 19 [2019-11-28 00:13:13,230 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-11-28 00:13:13,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1019) no Hoare annotation was computed. [2019-11-28 00:13:13,370 INFO L246 CegarLoopResult]: For program point L234(lines 234 238) no Hoare annotation was computed. [2019-11-28 00:13:13,370 INFO L246 CegarLoopResult]: For program point L1986(lines 1986 1994) no Hoare annotation was computed. [2019-11-28 00:13:13,370 INFO L246 CegarLoopResult]: For program point L500(lines 500 511) no Hoare annotation was computed. [2019-11-28 00:13:13,370 INFO L246 CegarLoopResult]: For program point L500-1(lines 500 511) no Hoare annotation was computed. [2019-11-28 00:13:13,370 INFO L246 CegarLoopResult]: For program point L2449-1(lines 2449 2455) no Hoare annotation was computed. [2019-11-28 00:13:13,371 INFO L246 CegarLoopResult]: For program point L2449(lines 2449 2455) no Hoare annotation was computed. [2019-11-28 00:13:13,371 INFO L246 CegarLoopResult]: For program point L335(lines 335 339) no Hoare annotation was computed. [2019-11-28 00:13:13,371 INFO L246 CegarLoopResult]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-11-28 00:13:13,371 INFO L246 CegarLoopResult]: For program point L269(lines 269 273) no Hoare annotation was computed. [2019-11-28 00:13:13,371 INFO L246 CegarLoopResult]: For program point L897(lines 897 903) no Hoare annotation was computed. [2019-11-28 00:13:13,372 INFO L242 CegarLoopResult]: At program point L897-1(lines 1 2544) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and .cse0 (= 1 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9) .cse1 .cse2 (= |ULTIMATE.start_isReadable_#res| 1) .cse3 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse4 .cse5 .cse6) (and .cse0 (= ~__ste_email_to0~0 2) .cse1 .cse2 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse4 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse5 .cse6))) [2019-11-28 00:13:13,372 INFO L246 CegarLoopResult]: For program point L897-2(lines 897 903) no Hoare annotation was computed. [2019-11-28 00:13:13,372 INFO L246 CegarLoopResult]: For program point L171(lines 171 178) no Hoare annotation was computed. [2019-11-28 00:13:13,373 INFO L249 CegarLoopResult]: At program point L171-1(lines 171 178) the Hoare annotation is: true [2019-11-28 00:13:13,373 INFO L242 CegarLoopResult]: At program point L2517-1(lines 2512 2520) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= |ULTIMATE.start_isReadable_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,374 INFO L242 CegarLoopResult]: At program point L2517(lines 2512 2520) the Hoare annotation is: (and (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_incoming_~client) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_isReadable_#res| 1) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,374 INFO L246 CegarLoopResult]: For program point L1989(lines 1989 1993) no Hoare annotation was computed. [2019-11-28 00:13:13,374 INFO L242 CegarLoopResult]: At program point L1989-2(lines 1 2544) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,374 INFO L246 CegarLoopResult]: For program point L537(lines 537 548) no Hoare annotation was computed. [2019-11-28 00:13:13,374 INFO L246 CegarLoopResult]: For program point L504(lines 504 510) no Hoare annotation was computed. [2019-11-28 00:13:13,375 INFO L246 CegarLoopResult]: For program point L537-1(lines 537 548) no Hoare annotation was computed. [2019-11-28 00:13:13,375 INFO L246 CegarLoopResult]: For program point L504-1(lines 504 510) no Hoare annotation was computed. [2019-11-28 00:13:13,375 INFO L246 CegarLoopResult]: For program point L240(lines 240 374) no Hoare annotation was computed. [2019-11-28 00:13:13,375 INFO L242 CegarLoopResult]: At program point L2454(lines 2437 2460) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,376 INFO L242 CegarLoopResult]: At program point L2454-1(lines 2437 2460) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse5 (= ~rjh~0 2))) (or (and (= 1 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9) .cse0 .cse1 (= |ULTIMATE.start_isReadable_#res| 1) .cse2 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3 .cse4 .cse5) (and (= ~__ste_email_to0~0 2) .cse0 .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse3 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse4 .cse5))) [2019-11-28 00:13:13,376 INFO L242 CegarLoopResult]: At program point L968(lines 963 971) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and .cse0 (= 1 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9) .cse1 .cse2 (= |ULTIMATE.start_isReadable_#res| 1) .cse3 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse4 .cse5 .cse6) (and .cse0 (= ~__ste_email_to0~0 2) .cse1 .cse2 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse4 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse5 .cse6))) [2019-11-28 00:13:13,376 INFO L246 CegarLoopResult]: For program point L1959(lines 1959 1975) no Hoare annotation was computed. [2019-11-28 00:13:13,376 INFO L246 CegarLoopResult]: For program point L1959-1(lines 1959 1975) no Hoare annotation was computed. [2019-11-28 00:13:13,377 INFO L242 CegarLoopResult]: At program point L407(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-11-28 00:13:13,377 INFO L242 CegarLoopResult]: At program point L341(lines 331 366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,377 INFO L242 CegarLoopResult]: At program point L308(lines 298 369) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,377 INFO L242 CegarLoopResult]: At program point L275(lines 265 372) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,377 INFO L246 CegarLoopResult]: For program point L541(lines 541 547) no Hoare annotation was computed. [2019-11-28 00:13:13,378 INFO L246 CegarLoopResult]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2019-11-28 00:13:13,378 INFO L242 CegarLoopResult]: At program point L376(lines 231 377) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,378 INFO L246 CegarLoopResult]: For program point L244(lines 244 248) no Hoare annotation was computed. [2019-11-28 00:13:13,378 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1010) no Hoare annotation was computed. [2019-11-28 00:13:13,378 INFO L246 CegarLoopResult]: For program point L1004-2(lines 1004 1010) no Hoare annotation was computed. [2019-11-28 00:13:13,379 INFO L242 CegarLoopResult]: At program point L509(lines 496 514) the Hoare annotation is: (and (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_incoming_~client) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_outgoing_~msg) (= 1 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_isReadable_#res| 1) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,379 INFO L249 CegarLoopResult]: At program point L509-1(lines 496 514) the Hoare annotation is: true [2019-11-28 00:13:13,379 INFO L249 CegarLoopResult]: At program point L179(lines 161 181) the Hoare annotation is: true [2019-11-28 00:13:13,379 INFO L246 CegarLoopResult]: For program point L1963(lines 1963 1974) no Hoare annotation was computed. [2019-11-28 00:13:13,379 INFO L246 CegarLoopResult]: For program point L1963-1(lines 1963 1974) no Hoare annotation was computed. [2019-11-28 00:13:13,380 INFO L246 CegarLoopResult]: For program point L346(lines 346 350) no Hoare annotation was computed. [2019-11-28 00:13:13,380 INFO L246 CegarLoopResult]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-11-28 00:13:13,380 INFO L246 CegarLoopResult]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-11-28 00:13:13,380 INFO L246 CegarLoopResult]: For program point L115(lines 115 123) no Hoare annotation was computed. [2019-11-28 00:13:13,380 INFO L242 CegarLoopResult]: At program point L876(lines 1 2544) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= 2 ULTIMATE.start_incoming_~client) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,381 INFO L242 CegarLoopResult]: At program point L876-1(lines 1 2544) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,381 INFO L242 CegarLoopResult]: At program point L546(lines 533 551) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,381 INFO L242 CegarLoopResult]: At program point L546-1(lines 533 551) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,381 INFO L246 CegarLoopResult]: For program point L1967(lines 1967 1973) no Hoare annotation was computed. [2019-11-28 00:13:13,381 INFO L246 CegarLoopResult]: For program point L1967-1(lines 1967 1973) no Hoare annotation was computed. [2019-11-28 00:13:13,382 INFO L242 CegarLoopResult]: At program point L415(lines 410 418) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-11-28 00:13:13,382 INFO L242 CegarLoopResult]: At program point L250(lines 240 374) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,382 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:13:13,382 INFO L246 CegarLoopResult]: For program point L2465(lines 2465 2477) no Hoare annotation was computed. [2019-11-28 00:13:13,382 INFO L246 CegarLoopResult]: For program point L2465-2(lines 2465 2477) no Hoare annotation was computed. [2019-11-28 00:13:13,383 INFO L246 CegarLoopResult]: For program point L2465-4(lines 2465 2477) no Hoare annotation was computed. [2019-11-28 00:13:13,383 INFO L242 CegarLoopResult]: At program point L352(lines 342 365) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,383 INFO L242 CegarLoopResult]: At program point L319(lines 309 368) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,383 INFO L242 CegarLoopResult]: At program point L286(lines 276 371) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,384 INFO L242 CegarLoopResult]: At program point L1972(lines 1955 1978) the Hoare annotation is: (and (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_incoming_~client) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,384 INFO L242 CegarLoopResult]: At program point L1972-1(lines 1955 1978) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (not (= ~rjh~0 1))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= 1 ULTIMATE.start_createEmail_~to))) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_createEmail_~to) .cse3 .cse4 (= ~rjh~0 2)) (and (= 0 ~__ste_client_autoResponse1~0) .cse0 .cse1 (= 0 |ULTIMATE.start_getClientAutoResponse_#res|) .cse2 .cse3 .cse4))) [2019-11-28 00:13:13,384 INFO L246 CegarLoopResult]: For program point L519(lines 519 527) no Hoare annotation was computed. [2019-11-28 00:13:13,384 INFO L246 CegarLoopResult]: For program point L2468(lines 2468 2476) no Hoare annotation was computed. [2019-11-28 00:13:13,384 INFO L246 CegarLoopResult]: For program point L519-2(lines 519 527) no Hoare annotation was computed. [2019-11-28 00:13:13,385 INFO L246 CegarLoopResult]: For program point L2468-2(lines 2468 2476) no Hoare annotation was computed. [2019-11-28 00:13:13,385 INFO L246 CegarLoopResult]: For program point L519-4(lines 519 527) no Hoare annotation was computed. [2019-11-28 00:13:13,385 INFO L246 CegarLoopResult]: For program point L2468-4(lines 2468 2476) no Hoare annotation was computed. [2019-11-28 00:13:13,385 INFO L246 CegarLoopResult]: For program point L255(lines 255 262) no Hoare annotation was computed. [2019-11-28 00:13:13,385 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:13:13,386 INFO L242 CegarLoopResult]: At program point L950(lines 945 953) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and .cse0 (= 1 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9) .cse1 .cse2 (= |ULTIMATE.start_isReadable_#res| 1) .cse3 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse4 .cse5 .cse6) (and .cse0 (= ~__ste_email_to0~0 2) .cse1 .cse2 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse4 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse5 .cse6))) [2019-11-28 00:13:13,386 INFO L242 CegarLoopResult]: At program point L158(lines 138 160) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,386 INFO L246 CegarLoopResult]: For program point L522(lines 522 526) no Hoare annotation was computed. [2019-11-28 00:13:13,386 INFO L242 CegarLoopResult]: At program point L522-2(lines 515 530) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_createEmail_~to) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,386 INFO L246 CegarLoopResult]: For program point L522-3(lines 522 526) no Hoare annotation was computed. [2019-11-28 00:13:13,387 INFO L246 CegarLoopResult]: For program point L2471(lines 2471 2475) no Hoare annotation was computed. [2019-11-28 00:13:13,387 INFO L246 CegarLoopResult]: For program point L2471-3(lines 2471 2475) no Hoare annotation was computed. [2019-11-28 00:13:13,387 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-28 00:13:13,387 INFO L242 CegarLoopResult]: At program point L522-5(lines 515 530) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,387 INFO L242 CegarLoopResult]: At program point L2471-2(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-11-28 00:13:13,388 INFO L246 CegarLoopResult]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-11-28 00:13:13,388 INFO L242 CegarLoopResult]: At program point L357-1(lines 232 375) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,388 INFO L246 CegarLoopResult]: For program point L522-6(lines 522 526) no Hoare annotation was computed. [2019-11-28 00:13:13,388 INFO L242 CegarLoopResult]: At program point L2471-5(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,388 INFO L246 CegarLoopResult]: For program point L291(lines 291 295) no Hoare annotation was computed. [2019-11-28 00:13:13,389 INFO L242 CegarLoopResult]: At program point L522-8(lines 515 530) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse5 (= ~rjh~0 2))) (or (and (= 1 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9) .cse0 .cse1 (= |ULTIMATE.start_isReadable_#res| 1) .cse2 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3 .cse4 .cse5) (and (= ~__ste_email_to0~0 2) .cse0 .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse3 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse4 .cse5))) [2019-11-28 00:13:13,389 INFO L246 CegarLoopResult]: For program point L2471-6(lines 2471 2475) no Hoare annotation was computed. [2019-11-28 00:13:13,389 INFO L242 CegarLoopResult]: At program point L2471-8(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,389 INFO L246 CegarLoopResult]: For program point L556(lines 556 564) no Hoare annotation was computed. [2019-11-28 00:13:13,389 INFO L246 CegarLoopResult]: For program point L556-2(lines 556 564) no Hoare annotation was computed. [2019-11-28 00:13:13,389 INFO L246 CegarLoopResult]: For program point L556-4(lines 556 564) no Hoare annotation was computed. [2019-11-28 00:13:13,390 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:13:13,390 INFO L246 CegarLoopResult]: For program point L1019(line 1019) no Hoare annotation was computed. [2019-11-28 00:13:13,390 INFO L246 CegarLoopResult]: For program point L1019-1(line 1019) no Hoare annotation was computed. [2019-11-28 00:13:13,390 INFO L242 CegarLoopResult]: At program point L1020(lines 996 1013) the Hoare annotation is: (and (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_incoming_~client) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_outgoing_~msg) (= 1 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_isReadable_#res| 1) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,390 INFO L249 CegarLoopResult]: At program point L1020-1(lines 996 1013) the Hoare annotation is: true [2019-11-28 00:13:13,391 INFO L246 CegarLoopResult]: For program point L2441-1(lines 2441 2457) no Hoare annotation was computed. [2019-11-28 00:13:13,391 INFO L246 CegarLoopResult]: For program point L2441(lines 2441 2457) no Hoare annotation was computed. [2019-11-28 00:13:13,391 INFO L246 CegarLoopResult]: For program point L559(lines 559 563) no Hoare annotation was computed. [2019-11-28 00:13:13,391 INFO L242 CegarLoopResult]: At program point L559-2(lines 552 567) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,391 INFO L242 CegarLoopResult]: At program point L2541(lines 2530 2544) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:13,392 INFO L246 CegarLoopResult]: For program point L559-3(lines 559 563) no Hoare annotation was computed. [2019-11-28 00:13:13,392 INFO L242 CegarLoopResult]: At program point L559-5(lines 552 567) the Hoare annotation is: (let ((.cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= 1 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9)) (.cse5 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ~rjh~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse6 .cse7 .cse8) (and .cse2 .cse3 (= 2 ULTIMATE.start_incoming_~client) (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse0 (= ~__ste_email_to0~0 2) .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse5 .cse4 .cse6 .cse7 .cse8))) [2019-11-28 00:13:13,392 INFO L246 CegarLoopResult]: For program point L559-6(lines 559 563) no Hoare annotation was computed. [2019-11-28 00:13:13,392 INFO L249 CegarLoopResult]: At program point L559-8(lines 552 567) the Hoare annotation is: true [2019-11-28 00:13:13,392 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:13:13,393 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1019) no Hoare annotation was computed. [2019-11-28 00:13:13,393 INFO L242 CegarLoopResult]: At program point L330(lines 320 367) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,393 INFO L242 CegarLoopResult]: At program point L297(lines 287 370) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,393 INFO L242 CegarLoopResult]: At program point L264(lines 251 373) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:13,394 INFO L246 CegarLoopResult]: For program point L2445-1(lines 2445 2456) no Hoare annotation was computed. [2019-11-28 00:13:13,394 INFO L246 CegarLoopResult]: For program point L2445(lines 2445 2456) no Hoare annotation was computed. [2019-11-28 00:13:13,394 INFO L246 CegarLoopResult]: For program point L1983(lines 1983 1995) no Hoare annotation was computed. [2019-11-28 00:13:13,394 INFO L242 CegarLoopResult]: At program point L959(lines 954 962) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and .cse0 (= 1 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9) .cse1 .cse2 (= |ULTIMATE.start_isReadable_#res| 1) .cse3 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse4 .cse5 .cse6) (and .cse0 (= ~__ste_email_to0~0 2) .cse1 .cse2 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse4 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse5 .cse6))) [2019-11-28 00:13:13,394 INFO L246 CegarLoopResult]: For program point L233(lines 232 375) no Hoare annotation was computed. [2019-11-28 00:13:13,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:13:13 BoogieIcfgContainer [2019-11-28 00:13:13,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:13:13,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:13:13,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:13:13,432 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:13:13,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:13:04" (3/4) ... [2019-11-28 00:13:13,437 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:13:13,462 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2019-11-28 00:13:13,464 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2019-11-28 00:13:13,466 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 00:13:13,467 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:13:13,469 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 00:13:13,470 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 00:13:13,507 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,507 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,508 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,508 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,509 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && 2 == client) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,509 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && handle == 2) && value == 2) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,509 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && 1 == tmp) && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) [2019-11-28 00:13:13,510 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && 1 == tmp) && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) [2019-11-28 00:13:13,510 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && 1 == tmp) && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) [2019-11-28 00:13:13,510 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && handle == 2) && value == 2) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,511 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && 1 == tmp) && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) [2019-11-28 00:13:13,511 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && handle == 2) && value == 2) && 1 == msg) && 1 == tmp) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,511 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && handle == 2) && value == 2) && 1 == msg) && 1 == tmp) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,512 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 == tmp && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || (((((((((__ste_email_to0 == 2 && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) [2019-11-28 00:13:13,512 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && 1 == tmp) && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((((1 == handle && handle == 3) && 2 == client) && handle == 2) && 1 == msg) && __ste_email_to0 == 2) && 1 == tmp) && 2 == \result) && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-28 00:13:13,512 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 == tmp && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || (((((((((__ste_email_to0 == 2 && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) [2019-11-28 00:13:13,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && !(rjh == 1)) && \result == 1) && 2 == to) && !(1 == to)) && 1 == msg) && rjh == 2) || ((((((0 == __ste_client_autoResponse1 && handle == 3) && !(rjh == 1)) && 0 == \result) && \result == 1) && !(1 == to)) && 1 == msg) [2019-11-28 00:13:13,514 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-28 00:13:13,658 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:13:13,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:13:13,659 INFO L168 Benchmark]: Toolchain (without parser) took 11435.31 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -116.2 MB). Peak memory consumption was 207.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:13,660 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:13:13,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1045.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -145.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:13,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 158.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:13,661 INFO L168 Benchmark]: Boogie Preprocessor took 66.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:13:13,661 INFO L168 Benchmark]: RCFGBuilder took 1140.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.1 MB in the end (delta: 99.1 MB). Peak memory consumption was 99.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:13,662 INFO L168 Benchmark]: TraceAbstraction took 8790.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 989.1 MB in the beginning and 1.1 GB in the end (delta: -96.0 MB). Peak memory consumption was 355.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:13,662 INFO L168 Benchmark]: Witness Printer took 226.22 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:13,664 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.79 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1045.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -145.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 158.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1140.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.1 MB in the end (delta: 99.1 MB). Peak memory consumption was 99.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8790.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 989.1 MB in the beginning and 1.1 GB in the end (delta: -96.0 MB). Peak memory consumption was 355.8 MB. Max. memory is 11.5 GB. * Witness Printer took 226.22 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1019]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1019]: 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: 240]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((__ste_email_to0 == 2 && handle == 3) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2530]: Loop Invariant Derived loop invariant: ((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 945]: Loop Invariant Derived loop invariant: (((((((((1 == msg && 1 == tmp) && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((1 == msg && 1 == tmp) && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2512]: Loop Invariant Derived loop invariant: ((((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && handle == 2) && value == 2) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((((1 == msg && 1 == tmp) && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((((1 == handle && handle == 3) && 2 == client) && handle == 2) && 1 == msg) && __ste_email_to0 == 2) && 1 == tmp) && 2 == \result) && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 954]: Loop Invariant Derived loop invariant: (((((((((1 == msg && 1 == tmp) && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: (((((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && handle == 2) && value == 2) && 1 == msg) && 1 == tmp) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && rjh == handle) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: ((((((((1 == tmp && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || (((((((((__ste_email_to0 == 2 && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && 2 == client) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2437]: Loop Invariant Derived loop invariant: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2437]: Loop Invariant Derived loop invariant: ((((((((1 == tmp && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || (((((((((__ste_email_to0 == 2 && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1955]: Loop Invariant Derived loop invariant: ((((((handle == 3 && !(rjh == 1)) && \result == 1) && 2 == to) && !(1 == to)) && 1 == msg) && rjh == 2) || ((((((0 == __ste_client_autoResponse1 && handle == 3) && !(rjh == 1)) && 0 == \result) && \result == 1) && !(1 == to)) && 1 == msg) - InvariantResult [Line: 1955]: Loop Invariant Derived loop invariant: (((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && handle == 2) && value == 2) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2512]: Loop Invariant Derived loop invariant: ((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == to) && !(__ste_email_to0 == 1)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: (((((((((1 == msg && 1 == tmp) && 1 == handle) && handle == 3) && \result == 1) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 2 == client) && 2 == to) && handle == 2) && 1 == msg) && rjh == 2) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: (((((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && handle == 2) && value == 2) && 1 == msg) && 1 == tmp) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 2 error locations. Result: SAFE, OverallTime: 3.8s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, HoareTripleCheckerStatistics: 2010 SDtfs, 3203 SDslu, 3642 SDs, 0 SdLazy, 378 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=293occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 776 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 46 PreInvPairs, 172 NumberOfFragments, 1148 HoareAnnotationTreeSize, 46 FomulaSimplifications, 283037 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 46 FomulaSimplificationsInter, 37221 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 27983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...