./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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_spec0_product05.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec4497e08a1792200bf5eff0342ec51442e382a3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 22:47:24,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 22:47:24,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 22:47:25,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 22:47:25,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 22:47:25,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 22:47:25,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 22:47:25,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 22:47:25,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 22:47:25,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 22:47:25,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 22:47:25,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 22:47:25,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 22:47:25,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 22:47:25,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 22:47:25,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 22:47:25,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 22:47:25,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 22:47:25,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 22:47:25,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 22:47:25,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 22:47:25,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 22:47:25,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 22:47:25,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 22:47:25,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 22:47:25,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 22:47:25,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 22:47:25,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 22:47:25,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 22:47:25,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 22:47:25,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 22:47:25,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 22:47:25,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 22:47:25,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 22:47:25,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 22:47:25,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 22:47:25,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 22:47:25,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 22:47:25,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 22:47:25,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 22:47:25,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 22:47:25,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 22:47:25,145 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 22:47:25,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 22:47:25,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 22:47:25,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 22:47:25,147 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 22:47:25,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 22:47:25,148 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 22:47:25,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 22:47:25,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 22:47:25,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 22:47:25,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 22:47:25,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 22:47:25,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 22:47:25,150 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 22:47:25,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 22:47:25,150 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 22:47:25,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 22:47:25,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 22:47:25,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 22:47:25,151 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 22:47:25,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 22:47:25,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:47:25,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 22:47:25,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 22:47:25,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 22:47:25,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 22:47:25,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 22:47:25,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 22:47:25,154 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 22:47:25,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> ec4497e08a1792200bf5eff0342ec51442e382a3 [2020-10-25 22:47:25,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 22:47:25,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 22:47:25,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 22:47:25,628 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 22:47:25,630 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 22:47:25,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2020-10-25 22:47:25,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05960aec0/f40726da1cc54c038e378b1abbae9d46/FLAG097fc5ec6 [2020-10-25 22:47:26,537 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 22:47:26,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2020-10-25 22:47:26,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05960aec0/f40726da1cc54c038e378b1abbae9d46/FLAG097fc5ec6 [2020-10-25 22:47:26,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05960aec0/f40726da1cc54c038e378b1abbae9d46 [2020-10-25 22:47:26,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 22:47:26,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 22:47:26,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 22:47:26,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 22:47:26,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 22:47:26,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:47:26" (1/1) ... [2020-10-25 22:47:26,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a130a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:26, skipping insertion in model container [2020-10-25 22:47:26,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:47:26" (1/1) ... [2020-10-25 22:47:26,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 22:47:26,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 22:47:27,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:47:27,568 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 22:47:27,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:47:27,765 INFO L208 MainTranslator]: Completed translation [2020-10-25 22:47:27,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27 WrapperNode [2020-10-25 22:47:27,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 22:47:27,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 22:47:27,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 22:47:27,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 22:47:27,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27" (1/1) ... [2020-10-25 22:47:27,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27" (1/1) ... [2020-10-25 22:47:27,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 22:47:27,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 22:47:27,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 22:47:27,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 22:47:27,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27" (1/1) ... [2020-10-25 22:47:27,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27" (1/1) ... [2020-10-25 22:47:27,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27" (1/1) ... [2020-10-25 22:47:27,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27" (1/1) ... [2020-10-25 22:47:27,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27" (1/1) ... [2020-10-25 22:47:27,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27" (1/1) ... [2020-10-25 22:47:27,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27" (1/1) ... [2020-10-25 22:47:27,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 22:47:27,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 22:47:27,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 22:47:27,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 22:47:27,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27" (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 [2020-10-25 22:47:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2020-10-25 22:47:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 22:47:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 22:47:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 22:47:28,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 22:47:29,341 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 22:47:29,342 INFO L298 CfgBuilder]: Removed 131 assume(true) statements. [2020-10-25 22:47:29,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:47:29 BoogieIcfgContainer [2020-10-25 22:47:29,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 22:47:29,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 22:47:29,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 22:47:29,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 22:47:29,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 10:47:26" (1/3) ... [2020-10-25 22:47:29,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4775802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:47:29, skipping insertion in model container [2020-10-25 22:47:29,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:47:27" (2/3) ... [2020-10-25 22:47:29,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4775802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:47:29, skipping insertion in model container [2020-10-25 22:47:29,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:47:29" (3/3) ... [2020-10-25 22:47:29,354 INFO L111 eAbstractionObserver]: Analyzing ICFG email_spec0_product05.cil.c [2020-10-25 22:47:29,369 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 22:47:29,376 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-25 22:47:29,390 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-25 22:47:29,420 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 22:47:29,420 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 22:47:29,421 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 22:47:29,421 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 22:47:29,421 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 22:47:29,421 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 22:47:29,421 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 22:47:29,421 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 22:47:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2020-10-25 22:47:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-25 22:47:29,449 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:29,450 INFO L422 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] [2020-10-25 22:47:29,451 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:29,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1721357046, now seen corresponding path program 1 times [2020-10-25 22:47:29,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:29,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469372183] [2020-10-25 22:47:29,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:47:29,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469372183] [2020-10-25 22:47:29,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:29,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 22:47:29,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283735469] [2020-10-25 22:47:29,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 22:47:29,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:29,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 22:47:29,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 22:47:29,874 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 2 states. [2020-10-25 22:47:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:29,913 INFO L93 Difference]: Finished difference Result 223 states and 349 transitions. [2020-10-25 22:47:29,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 22:47:29,914 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2020-10-25 22:47:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:29,928 INFO L225 Difference]: With dead ends: 223 [2020-10-25 22:47:29,929 INFO L226 Difference]: Without dead ends: 118 [2020-10-25 22:47:29,933 INFO L677 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 [2020-10-25 22:47:29,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-25 22:47:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-10-25 22:47:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-10-25 22:47:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2020-10-25 22:47:30,024 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 34 [2020-10-25 22:47:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:30,025 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2020-10-25 22:47:30,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 22:47:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2020-10-25 22:47:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 22:47:30,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:30,031 INFO L422 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] [2020-10-25 22:47:30,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 22:47:30,031 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash -122239248, now seen corresponding path program 1 times [2020-10-25 22:47:30,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:30,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164922619] [2020-10-25 22:47:30,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:47:30,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164922619] [2020-10-25 22:47:30,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:30,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:47:30,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730960864] [2020-10-25 22:47:30,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:47:30,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:30,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:47:30,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:47:30,186 INFO L87 Difference]: Start difference. First operand 118 states and 187 transitions. Second operand 3 states. [2020-10-25 22:47:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:30,256 INFO L93 Difference]: Finished difference Result 327 states and 519 transitions. [2020-10-25 22:47:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:47:30,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-25 22:47:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:30,259 INFO L225 Difference]: With dead ends: 327 [2020-10-25 22:47:30,260 INFO L226 Difference]: Without dead ends: 220 [2020-10-25 22:47:30,262 INFO L677 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 [2020-10-25 22:47:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-10-25 22:47:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 117. [2020-10-25 22:47:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-25 22:47:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2020-10-25 22:47:30,277 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 35 [2020-10-25 22:47:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:30,277 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2020-10-25 22:47:30,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:47:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2020-10-25 22:47:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 22:47:30,279 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:30,279 INFO L422 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] [2020-10-25 22:47:30,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 22:47:30,280 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2107249571, now seen corresponding path program 1 times [2020-10-25 22:47:30,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:30,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069948255] [2020-10-25 22:47:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:30,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:47:30,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069948255] [2020-10-25 22:47:30,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:30,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:47:30,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066440402] [2020-10-25 22:47:30,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:47:30,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:30,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:47:30,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:47:30,396 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand 3 states. [2020-10-25 22:47:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:30,443 INFO L93 Difference]: Finished difference Result 220 states and 346 transitions. [2020-10-25 22:47:30,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:47:30,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-10-25 22:47:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:30,446 INFO L225 Difference]: With dead ends: 220 [2020-10-25 22:47:30,446 INFO L226 Difference]: Without dead ends: 118 [2020-10-25 22:47:30,447 INFO L677 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 [2020-10-25 22:47:30,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-25 22:47:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2020-10-25 22:47:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-25 22:47:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 182 transitions. [2020-10-25 22:47:30,459 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 182 transitions. Word has length 36 [2020-10-25 22:47:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:30,459 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 182 transitions. [2020-10-25 22:47:30,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:47:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 182 transitions. [2020-10-25 22:47:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-25 22:47:30,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:30,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:30,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 22:47:30,462 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:30,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:30,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1018177341, now seen corresponding path program 1 times [2020-10-25 22:47:30,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:30,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555823431] [2020-10-25 22:47:30,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:47:30,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555823431] [2020-10-25 22:47:30,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:30,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:47:30,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49154815] [2020-10-25 22:47:30,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:47:30,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:47:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:47:30,534 INFO L87 Difference]: Start difference. First operand 117 states and 182 transitions. Second operand 3 states. [2020-10-25 22:47:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:30,580 INFO L93 Difference]: Finished difference Result 226 states and 353 transitions. [2020-10-25 22:47:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:47:30,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-10-25 22:47:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:30,585 INFO L225 Difference]: With dead ends: 226 [2020-10-25 22:47:30,585 INFO L226 Difference]: Without dead ends: 117 [2020-10-25 22:47:30,586 INFO L677 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 [2020-10-25 22:47:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-25 22:47:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-10-25 22:47:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-25 22:47:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2020-10-25 22:47:30,602 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 37 [2020-10-25 22:47:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:30,602 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2020-10-25 22:47:30,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:47:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2020-10-25 22:47:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-25 22:47:30,604 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:30,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:30,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 22:47:30,605 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:30,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:30,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1032935230, now seen corresponding path program 1 times [2020-10-25 22:47:30,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:30,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419074395] [2020-10-25 22:47:30,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:47:30,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419074395] [2020-10-25 22:47:30,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:30,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:47:30,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502755503] [2020-10-25 22:47:30,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:47:30,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:30,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:47:30,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:47:30,689 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand 3 states. [2020-10-25 22:47:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:30,706 INFO L93 Difference]: Finished difference Result 191 states and 289 transitions. [2020-10-25 22:47:30,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:47:30,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-10-25 22:47:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:30,709 INFO L225 Difference]: With dead ends: 191 [2020-10-25 22:47:30,709 INFO L226 Difference]: Without dead ends: 120 [2020-10-25 22:47:30,710 INFO L677 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 [2020-10-25 22:47:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-25 22:47:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2020-10-25 22:47:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-25 22:47:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 182 transitions. [2020-10-25 22:47:30,722 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 182 transitions. Word has length 38 [2020-10-25 22:47:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:30,722 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 182 transitions. [2020-10-25 22:47:30,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:47:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 182 transitions. [2020-10-25 22:47:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-25 22:47:30,725 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:30,726 INFO L422 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] [2020-10-25 22:47:30,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 22:47:30,726 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1719269101, now seen corresponding path program 1 times [2020-10-25 22:47:30,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:30,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742915877] [2020-10-25 22:47:30,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:47:30,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742915877] [2020-10-25 22:47:30,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996128401] [2020-10-25 22:47:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:47:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:31,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 22:47:31,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:47:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:47:31,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:47:31,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-25 22:47:31,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274138944] [2020-10-25 22:47:31,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:47:31,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:31,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:47:31,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:47:31,218 INFO L87 Difference]: Start difference. First operand 119 states and 182 transitions. Second operand 5 states. [2020-10-25 22:47:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:31,245 INFO L93 Difference]: Finished difference Result 291 states and 448 transitions. [2020-10-25 22:47:31,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:47:31,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-10-25 22:47:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:31,247 INFO L225 Difference]: With dead ends: 291 [2020-10-25 22:47:31,248 INFO L226 Difference]: Without dead ends: 220 [2020-10-25 22:47:31,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:47:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-10-25 22:47:31,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 148. [2020-10-25 22:47:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-25 22:47:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 236 transitions. [2020-10-25 22:47:31,261 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 236 transitions. Word has length 43 [2020-10-25 22:47:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:31,262 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 236 transitions. [2020-10-25 22:47:31,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:47:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 236 transitions. [2020-10-25 22:47:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-25 22:47:31,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:31,265 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:31,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-10-25 22:47:31,479 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:31,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 196922526, now seen corresponding path program 2 times [2020-10-25 22:47:31,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:31,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594819633] [2020-10-25 22:47:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:47:31,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594819633] [2020-10-25 22:47:31,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:31,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:47:31,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230528478] [2020-10-25 22:47:31,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:47:31,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:47:31,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:47:31,585 INFO L87 Difference]: Start difference. First operand 148 states and 236 transitions. Second operand 3 states. [2020-10-25 22:47:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:31,604 INFO L93 Difference]: Finished difference Result 349 states and 556 transitions. [2020-10-25 22:47:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:47:31,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-10-25 22:47:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:31,607 INFO L225 Difference]: With dead ends: 349 [2020-10-25 22:47:31,607 INFO L226 Difference]: Without dead ends: 249 [2020-10-25 22:47:31,607 INFO L677 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 [2020-10-25 22:47:31,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-10-25 22:47:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 178. [2020-10-25 22:47:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-10-25 22:47:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2020-10-25 22:47:31,619 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 48 [2020-10-25 22:47:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:31,620 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2020-10-25 22:47:31,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:47:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2020-10-25 22:47:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 22:47:31,621 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:31,621 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:31,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 22:47:31,622 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:31,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash -326279457, now seen corresponding path program 1 times [2020-10-25 22:47:31,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:31,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12464251] [2020-10-25 22:47:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 22:47:31,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12464251] [2020-10-25 22:47:31,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:31,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:47:31,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907563580] [2020-10-25 22:47:31,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:47:31,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:31,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:47:31,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:47:31,696 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand 3 states. [2020-10-25 22:47:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:31,714 INFO L93 Difference]: Finished difference Result 403 states and 656 transitions. [2020-10-25 22:47:31,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:47:31,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-25 22:47:31,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:31,717 INFO L225 Difference]: With dead ends: 403 [2020-10-25 22:47:31,717 INFO L226 Difference]: Without dead ends: 249 [2020-10-25 22:47:31,718 INFO L677 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 [2020-10-25 22:47:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-10-25 22:47:31,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 178. [2020-10-25 22:47:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-10-25 22:47:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 288 transitions. [2020-10-25 22:47:31,730 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 288 transitions. Word has length 49 [2020-10-25 22:47:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:31,730 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 288 transitions. [2020-10-25 22:47:31,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:47:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 288 transitions. [2020-10-25 22:47:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 22:47:31,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:31,732 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:31,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 22:47:31,732 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:31,733 INFO L82 PathProgramCache]: Analyzing trace with hash -867360645, now seen corresponding path program 2 times [2020-10-25 22:47:31,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:31,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991307064] [2020-10-25 22:47:31,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 22:47:31,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991307064] [2020-10-25 22:47:31,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:31,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-25 22:47:31,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997143521] [2020-10-25 22:47:31,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 22:47:31,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:31,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 22:47:31,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:47:31,858 INFO L87 Difference]: Start difference. First operand 178 states and 288 transitions. Second operand 10 states. [2020-10-25 22:47:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:32,782 INFO L93 Difference]: Finished difference Result 621 states and 896 transitions. [2020-10-25 22:47:32,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-25 22:47:32,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2020-10-25 22:47:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:32,787 INFO L225 Difference]: With dead ends: 621 [2020-10-25 22:47:32,787 INFO L226 Difference]: Without dead ends: 572 [2020-10-25 22:47:32,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2020-10-25 22:47:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-10-25 22:47:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 212. [2020-10-25 22:47:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-10-25 22:47:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 335 transitions. [2020-10-25 22:47:32,810 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 335 transitions. Word has length 49 [2020-10-25 22:47:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:32,811 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 335 transitions. [2020-10-25 22:47:32,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 22:47:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 335 transitions. [2020-10-25 22:47:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 22:47:32,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:32,812 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:32,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 22:47:32,813 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:32,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1932642042, now seen corresponding path program 1 times [2020-10-25 22:47:32,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:32,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681235536] [2020-10-25 22:47:32,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 22:47:32,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681235536] [2020-10-25 22:47:32,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:32,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:47:32,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541782960] [2020-10-25 22:47:32,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:47:32,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:32,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:47:32,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:47:32,914 INFO L87 Difference]: Start difference. First operand 212 states and 335 transitions. Second operand 6 states. [2020-10-25 22:47:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:33,019 INFO L93 Difference]: Finished difference Result 344 states and 516 transitions. [2020-10-25 22:47:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 22:47:33,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-10-25 22:47:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:33,022 INFO L225 Difference]: With dead ends: 344 [2020-10-25 22:47:33,022 INFO L226 Difference]: Without dead ends: 255 [2020-10-25 22:47:33,022 INFO L677 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 [2020-10-25 22:47:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-10-25 22:47:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 208. [2020-10-25 22:47:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-10-25 22:47:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 328 transitions. [2020-10-25 22:47:33,051 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 328 transitions. Word has length 50 [2020-10-25 22:47:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:33,051 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 328 transitions. [2020-10-25 22:47:33,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:47:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 328 transitions. [2020-10-25 22:47:33,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 22:47:33,052 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:33,053 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:33,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 22:47:33,053 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:33,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:33,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1701439479, now seen corresponding path program 1 times [2020-10-25 22:47:33,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:33,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704407777] [2020-10-25 22:47:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 22:47:33,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704407777] [2020-10-25 22:47:33,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:33,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:47:33,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136308854] [2020-10-25 22:47:33,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:47:33,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:33,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:47:33,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:47:33,149 INFO L87 Difference]: Start difference. First operand 208 states and 328 transitions. Second operand 5 states. [2020-10-25 22:47:33,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:33,297 INFO L93 Difference]: Finished difference Result 523 states and 798 transitions. [2020-10-25 22:47:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 22:47:33,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2020-10-25 22:47:33,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:33,302 INFO L225 Difference]: With dead ends: 523 [2020-10-25 22:47:33,302 INFO L226 Difference]: Without dead ends: 441 [2020-10-25 22:47:33,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:47:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-10-25 22:47:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 361. [2020-10-25 22:47:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-10-25 22:47:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 571 transitions. [2020-10-25 22:47:33,350 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 571 transitions. Word has length 50 [2020-10-25 22:47:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:33,351 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 571 transitions. [2020-10-25 22:47:33,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:47:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 571 transitions. [2020-10-25 22:47:33,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-25 22:47:33,352 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:33,352 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:33,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 22:47:33,352 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:33,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:33,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1663962474, now seen corresponding path program 1 times [2020-10-25 22:47:33,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:33,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157798664] [2020-10-25 22:47:33,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 22:47:33,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157798664] [2020-10-25 22:47:33,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:33,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-25 22:47:33,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035796918] [2020-10-25 22:47:33,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 22:47:33,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:33,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 22:47:33,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:47:33,508 INFO L87 Difference]: Start difference. First operand 361 states and 571 transitions. Second operand 9 states. [2020-10-25 22:47:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:34,360 INFO L93 Difference]: Finished difference Result 890 states and 1295 transitions. [2020-10-25 22:47:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-25 22:47:34,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-10-25 22:47:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:34,367 INFO L225 Difference]: With dead ends: 890 [2020-10-25 22:47:34,368 INFO L226 Difference]: Without dead ends: 732 [2020-10-25 22:47:34,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2020-10-25 22:47:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-10-25 22:47:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 440. [2020-10-25 22:47:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-25 22:47:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 681 transitions. [2020-10-25 22:47:34,430 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 681 transitions. Word has length 51 [2020-10-25 22:47:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:34,432 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 681 transitions. [2020-10-25 22:47:34,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 22:47:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 681 transitions. [2020-10-25 22:47:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-25 22:47:34,434 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:34,434 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:34,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 22:47:34,434 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:34,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1224175828, now seen corresponding path program 1 times [2020-10-25 22:47:34,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:34,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485356588] [2020-10-25 22:47:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 22:47:34,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485356588] [2020-10-25 22:47:34,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:34,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:47:34,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530548296] [2020-10-25 22:47:34,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:47:34,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:34,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:47:34,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:47:34,524 INFO L87 Difference]: Start difference. First operand 440 states and 681 transitions. Second operand 4 states. [2020-10-25 22:47:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:34,594 INFO L93 Difference]: Finished difference Result 531 states and 797 transitions. [2020-10-25 22:47:34,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:47:34,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-10-25 22:47:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:34,597 INFO L225 Difference]: With dead ends: 531 [2020-10-25 22:47:34,598 INFO L226 Difference]: Without dead ends: 347 [2020-10-25 22:47:34,598 INFO L677 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 [2020-10-25 22:47:34,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-10-25 22:47:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 312. [2020-10-25 22:47:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2020-10-25 22:47:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 490 transitions. [2020-10-25 22:47:34,634 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 490 transitions. Word has length 52 [2020-10-25 22:47:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:34,635 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 490 transitions. [2020-10-25 22:47:34,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:47:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 490 transitions. [2020-10-25 22:47:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-25 22:47:34,637 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:34,637 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:34,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 22:47:34,638 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:34,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash -944544913, now seen corresponding path program 1 times [2020-10-25 22:47:34,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:34,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119792995] [2020-10-25 22:47:34,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 22:47:34,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119792995] [2020-10-25 22:47:34,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:34,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:47:34,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109090499] [2020-10-25 22:47:34,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:47:34,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:34,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:47:34,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:47:34,715 INFO L87 Difference]: Start difference. First operand 312 states and 490 transitions. Second operand 3 states. [2020-10-25 22:47:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:34,788 INFO L93 Difference]: Finished difference Result 855 states and 1352 transitions. [2020-10-25 22:47:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:47:34,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-10-25 22:47:34,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:34,792 INFO L225 Difference]: With dead ends: 855 [2020-10-25 22:47:34,793 INFO L226 Difference]: Without dead ends: 569 [2020-10-25 22:47:34,794 INFO L677 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 [2020-10-25 22:47:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-10-25 22:47:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 424. [2020-10-25 22:47:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-25 22:47:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 691 transitions. [2020-10-25 22:47:34,852 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 691 transitions. Word has length 57 [2020-10-25 22:47:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:34,852 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 691 transitions. [2020-10-25 22:47:34,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:47:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 691 transitions. [2020-10-25 22:47:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-25 22:47:34,865 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:34,865 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:34,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 22:47:34,866 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:34,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:34,866 INFO L82 PathProgramCache]: Analyzing trace with hash 328528683, now seen corresponding path program 1 times [2020-10-25 22:47:34,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:34,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419010999] [2020-10-25 22:47:34,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 22:47:34,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419010999] [2020-10-25 22:47:34,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:34,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:47:34,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000408196] [2020-10-25 22:47:34,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:47:34,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:34,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:47:34,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:47:34,932 INFO L87 Difference]: Start difference. First operand 424 states and 691 transitions. Second operand 3 states. [2020-10-25 22:47:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:35,024 INFO L93 Difference]: Finished difference Result 1181 states and 1941 transitions. [2020-10-25 22:47:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:47:35,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-10-25 22:47:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:35,029 INFO L225 Difference]: With dead ends: 1181 [2020-10-25 22:47:35,030 INFO L226 Difference]: Without dead ends: 787 [2020-10-25 22:47:35,033 INFO L677 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 [2020-10-25 22:47:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2020-10-25 22:47:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 642. [2020-10-25 22:47:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2020-10-25 22:47:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1080 transitions. [2020-10-25 22:47:35,095 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1080 transitions. Word has length 58 [2020-10-25 22:47:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:35,096 INFO L481 AbstractCegarLoop]: Abstraction has 642 states and 1080 transitions. [2020-10-25 22:47:35,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:47:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1080 transitions. [2020-10-25 22:47:35,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-25 22:47:35,105 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:35,105 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:35,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 22:47:35,106 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:35,106 INFO L82 PathProgramCache]: Analyzing trace with hash 87613521, now seen corresponding path program 1 times [2020-10-25 22:47:35,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:35,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786802618] [2020-10-25 22:47:35,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 22:47:35,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786802618] [2020-10-25 22:47:35,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:35,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:47:35,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592048394] [2020-10-25 22:47:35,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:47:35,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:35,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:47:35,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:47:35,167 INFO L87 Difference]: Start difference. First operand 642 states and 1080 transitions. Second operand 3 states. [2020-10-25 22:47:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:35,299 INFO L93 Difference]: Finished difference Result 1821 states and 3086 transitions. [2020-10-25 22:47:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:47:35,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-10-25 22:47:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:35,307 INFO L225 Difference]: With dead ends: 1821 [2020-10-25 22:47:35,307 INFO L226 Difference]: Without dead ends: 1213 [2020-10-25 22:47:35,309 INFO L677 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 [2020-10-25 22:47:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2020-10-25 22:47:35,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1068. [2020-10-25 22:47:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2020-10-25 22:47:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1833 transitions. [2020-10-25 22:47:35,423 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1833 transitions. Word has length 59 [2020-10-25 22:47:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:35,423 INFO L481 AbstractCegarLoop]: Abstraction has 1068 states and 1833 transitions. [2020-10-25 22:47:35,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:47:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1833 transitions. [2020-10-25 22:47:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-25 22:47:35,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:35,427 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:35,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 22:47:35,427 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1318592951, now seen corresponding path program 1 times [2020-10-25 22:47:35,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:35,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972550553] [2020-10-25 22:47:35,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 22:47:35,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972550553] [2020-10-25 22:47:35,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:47:35,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:47:35,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290215402] [2020-10-25 22:47:35,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:47:35,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:35,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:47:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:47:35,535 INFO L87 Difference]: Start difference. First operand 1068 states and 1833 transitions. Second operand 3 states. [2020-10-25 22:47:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:35,801 INFO L93 Difference]: Finished difference Result 3077 states and 5307 transitions. [2020-10-25 22:47:35,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:47:35,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-10-25 22:47:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:35,815 INFO L225 Difference]: With dead ends: 3077 [2020-10-25 22:47:35,816 INFO L226 Difference]: Without dead ends: 2047 [2020-10-25 22:47:35,820 INFO L677 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 [2020-10-25 22:47:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2020-10-25 22:47:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1902. [2020-10-25 22:47:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2020-10-25 22:47:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 3290 transitions. [2020-10-25 22:47:36,050 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 3290 transitions. Word has length 60 [2020-10-25 22:47:36,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:36,051 INFO L481 AbstractCegarLoop]: Abstraction has 1902 states and 3290 transitions. [2020-10-25 22:47:36,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:47:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3290 transitions. [2020-10-25 22:47:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-25 22:47:36,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:47:36,055 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:47:36,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 22:47:36,056 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:47:36,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:47:36,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1559369011, now seen corresponding path program 1 times [2020-10-25 22:47:36,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:47:36,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263854040] [2020-10-25 22:47:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:47:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 22:47:36,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263854040] [2020-10-25 22:47:36,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688566633] [2020-10-25 22:47:36,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:47:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:47:36,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-25 22:47:36,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:47:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:47:36,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:47:36,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-10-25 22:47:36,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829603173] [2020-10-25 22:47:36,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-25 22:47:36,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:47:36,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-25 22:47:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-25 22:47:36,540 INFO L87 Difference]: Start difference. First operand 1902 states and 3290 transitions. Second operand 8 states. [2020-10-25 22:47:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:47:37,089 INFO L93 Difference]: Finished difference Result 2773 states and 4552 transitions. [2020-10-25 22:47:37,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-25 22:47:37,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-10-25 22:47:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:47:37,090 INFO L225 Difference]: With dead ends: 2773 [2020-10-25 22:47:37,090 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 22:47:37,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2020-10-25 22:47:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 22:47:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 22:47:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 22:47:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 22:47:37,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2020-10-25 22:47:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:47:37,099 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 22:47:37,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-25 22:47:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 22:47:37,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 22:47:37,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-25 22:47:37,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 22:47:37,497 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 82 [2020-10-25 22:47:37,871 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 110 [2020-10-25 22:47:37,993 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2020-10-25 22:47:38,291 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2020-10-25 22:47:38,511 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2020-10-25 22:47:38,924 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 110 [2020-10-25 22:47:39,186 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 114 [2020-10-25 22:47:39,422 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2020-10-25 22:47:39,950 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 110 [2020-10-25 22:47:40,167 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2020-10-25 22:47:40,431 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 114 [2020-10-25 22:47:40,798 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 62 [2020-10-25 22:47:40,973 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 110 [2020-10-25 22:47:41,309 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 162 [2020-10-25 22:47:41,776 WARN L193 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 180 [2020-10-25 22:47:42,247 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2020-10-25 22:47:42,417 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 13 [2020-10-25 22:47:43,025 WARN L193 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 37 [2020-10-25 22:47:43,245 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 22 [2020-10-25 22:47:43,548 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 30 [2020-10-25 22:47:43,942 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 28 [2020-10-25 22:47:44,233 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 32 [2020-10-25 22:47:44,571 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2020-10-25 22:47:44,788 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 24 [2020-10-25 22:47:45,397 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 37 [2020-10-25 22:47:46,073 WARN L193 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 35 [2020-10-25 22:47:46,532 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2020-10-25 22:47:46,725 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 17 [2020-10-25 22:47:47,120 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 17 [2020-10-25 22:47:47,863 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 20 [2020-10-25 22:47:48,537 WARN L193 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 37 [2020-10-25 22:47:48,915 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 22 [2020-10-25 22:47:49,664 WARN L193 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 35 [2020-10-25 22:47:49,884 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 24 [2020-10-25 22:47:50,205 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2020-10-25 22:47:50,524 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2020-10-25 22:47:50,841 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2020-10-25 22:47:51,122 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 26 [2020-10-25 22:47:51,690 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 37 [2020-10-25 22:47:52,736 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 154 DAG size of output: 16 [2020-10-25 22:47:54,224 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 177 DAG size of output: 17 [2020-10-25 22:47:54,533 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2020-10-25 22:47:54,850 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2020-10-25 22:47:54,921 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 22:47:54,921 INFO L274 CegarLoopResult]: For program point L498(lines 498 502) no Hoare annotation was computed. [2020-10-25 22:47:54,922 INFO L270 CegarLoopResult]: At program point L498-2(lines 491 506) the Hoare annotation is: (and (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,922 INFO L274 CegarLoopResult]: For program point L498-3(lines 498 502) no Hoare annotation was computed. [2020-10-25 22:47:54,922 INFO L270 CegarLoopResult]: At program point L498-5(lines 491 506) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~handle 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ULTIMATE.start_setEmailTo_~value 2) (= ~rjh~0 2) (= ULTIMATE.start_outgoing_~msg 1) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,922 INFO L274 CegarLoopResult]: For program point L498-6(lines 498 502) no Hoare annotation was computed. [2020-10-25 22:47:54,922 INFO L270 CegarLoopResult]: At program point L498-8(lines 491 506) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse0 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse0 .cse1 .cse2 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse3 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse4 .cse5) (and (= ~__ste_email_to0~0 2) .cse1 .cse2 .cse0 (= 2 ULTIMATE.start_incoming_~client) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5))) [2020-10-25 22:47:54,923 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 22:47:54,923 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-25 22:47:54,923 INFO L274 CegarLoopResult]: For program point L532(lines 532 540) no Hoare annotation was computed. [2020-10-25 22:47:54,923 INFO L274 CegarLoopResult]: For program point L532-2(lines 532 540) no Hoare annotation was computed. [2020-10-25 22:47:54,923 INFO L274 CegarLoopResult]: For program point L532-4(lines 532 540) no Hoare annotation was computed. [2020-10-25 22:47:54,923 INFO L274 CegarLoopResult]: For program point L2184(lines 2184 2200) no Hoare annotation was computed. [2020-10-25 22:47:54,923 INFO L274 CegarLoopResult]: For program point L2184-1(lines 2184 2200) no Hoare annotation was computed. [2020-10-25 22:47:54,923 INFO L274 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2020-10-25 22:47:54,923 INFO L274 CegarLoopResult]: For program point L335(lines 335 339) no Hoare annotation was computed. [2020-10-25 22:47:54,924 INFO L270 CegarLoopResult]: At program point L368-1(lines 243 386) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,924 INFO L274 CegarLoopResult]: For program point L535(lines 535 539) no Hoare annotation was computed. [2020-10-25 22:47:54,924 INFO L270 CegarLoopResult]: At program point L535-2(lines 528 543) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_setEmailTo_~value 2) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,924 INFO L274 CegarLoopResult]: For program point L535-3(lines 535 539) no Hoare annotation was computed. [2020-10-25 22:47:54,924 INFO L270 CegarLoopResult]: At program point L535-5(lines 528 543) the Hoare annotation is: (let ((.cse0 (= 2 ULTIMATE.start_createEmail_~to)) (.cse1 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse5 (= ~rjh~0 2)) (.cse6 (= ULTIMATE.start_outgoing_~msg 1)) (.cse7 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_incoming_~client) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-10-25 22:47:54,924 INFO L274 CegarLoopResult]: For program point L535-6(lines 535 539) no Hoare annotation was computed. [2020-10-25 22:47:54,925 INFO L270 CegarLoopResult]: At program point L535-8(lines 528 543) the Hoare annotation is: (and (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= |ULTIMATE.start_createEmail_#res| 1) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,925 INFO L270 CegarLoopResult]: At program point L305(lines 295 381) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,925 INFO L270 CegarLoopResult]: At program point L272(lines 262 384) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,925 INFO L274 CegarLoopResult]: For program point L173(lines 173 180) no Hoare annotation was computed. [2020-10-25 22:47:54,925 INFO L274 CegarLoopResult]: For program point L2188(lines 2188 2199) no Hoare annotation was computed. [2020-10-25 22:47:54,925 INFO L277 CegarLoopResult]: At program point L173-1(lines 173 180) the Hoare annotation is: true [2020-10-25 22:47:54,925 INFO L274 CegarLoopResult]: For program point L2188-1(lines 2188 2199) no Hoare annotation was computed. [2020-10-25 22:47:54,925 INFO L274 CegarLoopResult]: For program point L2255(lines 2255 2267) no Hoare annotation was computed. [2020-10-25 22:47:54,926 INFO L274 CegarLoopResult]: For program point L2255-2(lines 2255 2267) no Hoare annotation was computed. [2020-10-25 22:47:54,926 INFO L274 CegarLoopResult]: For program point L2255-4(lines 2255 2267) no Hoare annotation was computed. [2020-10-25 22:47:54,926 INFO L274 CegarLoopResult]: For program point L439(lines 439 450) no Hoare annotation was computed. [2020-10-25 22:47:54,926 INFO L274 CegarLoopResult]: For program point L439-1(lines 439 450) no Hoare annotation was computed. [2020-10-25 22:47:54,926 INFO L270 CegarLoopResult]: At program point L341(lines 331 378) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,926 INFO L274 CegarLoopResult]: For program point L2258(lines 2258 2266) no Hoare annotation was computed. [2020-10-25 22:47:54,926 INFO L274 CegarLoopResult]: For program point L2258-2(lines 2258 2266) no Hoare annotation was computed. [2020-10-25 22:47:54,926 INFO L274 CegarLoopResult]: For program point L2192(lines 2192 2198) no Hoare annotation was computed. [2020-10-25 22:47:54,926 INFO L274 CegarLoopResult]: For program point L2258-4(lines 2258 2266) no Hoare annotation was computed. [2020-10-25 22:47:54,926 INFO L274 CegarLoopResult]: For program point L2192-1(lines 2192 2198) no Hoare annotation was computed. [2020-10-25 22:47:54,927 INFO L274 CegarLoopResult]: For program point L310(lines 310 317) no Hoare annotation was computed. [2020-10-25 22:47:54,927 INFO L270 CegarLoopResult]: At program point L2391(lines 2386 2394) the Hoare annotation is: (let ((.cse0 (= 2 ULTIMATE.start_createEmail_~to)) (.cse1 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= ULTIMATE.start_outgoing_~msg 1)) (.cse5 (= ~rjh~0 2)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_incoming_~client) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6) (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse0 .cse1 .cse2 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse3 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse4 .cse5 .cse6))) [2020-10-25 22:47:54,927 INFO L274 CegarLoopResult]: For program point L277(lines 277 281) no Hoare annotation was computed. [2020-10-25 22:47:54,927 INFO L274 CegarLoopResult]: For program point L244(lines 243 386) no Hoare annotation was computed. [2020-10-25 22:47:54,927 INFO L274 CegarLoopResult]: For program point L476(lines 476 487) no Hoare annotation was computed. [2020-10-25 22:47:54,927 INFO L274 CegarLoopResult]: For program point L443(lines 443 449) no Hoare annotation was computed. [2020-10-25 22:47:54,927 INFO L274 CegarLoopResult]: For program point L476-1(lines 476 487) no Hoare annotation was computed. [2020-10-25 22:47:54,927 INFO L274 CegarLoopResult]: For program point L443-1(lines 443 449) no Hoare annotation was computed. [2020-10-25 22:47:54,927 INFO L274 CegarLoopResult]: For program point L245(lines 245 249) no Hoare annotation was computed. [2020-10-25 22:47:54,927 INFO L274 CegarLoopResult]: For program point L2261(lines 2261 2265) no Hoare annotation was computed. [2020-10-25 22:47:54,928 INFO L274 CegarLoopResult]: For program point L2261-3(lines 2261 2265) no Hoare annotation was computed. [2020-10-25 22:47:54,928 INFO L270 CegarLoopResult]: At program point L2261-2(lines 1 2541) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1)) (not (= ~rjh~0 1)) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,928 INFO L270 CegarLoopResult]: At program point L2261-5(lines 1 2541) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (= ~rjh~0 2)) [2020-10-25 22:47:54,928 INFO L274 CegarLoopResult]: For program point L2261-6(lines 2261 2265) no Hoare annotation was computed. [2020-10-25 22:47:54,928 INFO L270 CegarLoopResult]: At program point L2261-8(lines 1 2541) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,928 INFO L274 CegarLoopResult]: For program point L346(lines 346 350) no Hoare annotation was computed. [2020-10-25 22:47:54,928 INFO L277 CegarLoopResult]: At program point L181(lines 163 183) the Hoare annotation is: true [2020-10-25 22:47:54,928 INFO L270 CegarLoopResult]: At program point L2197-1(lines 2180 2203) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse1 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= 2 ULTIMATE.start_createEmail_~to) .cse0 .cse1 .cse2 (= ~rjh~0 2) .cse3) (and .cse0 .cse1 (not (= ~rjh~0 1)) .cse2 (not (= ULTIMATE.start_createEmail_~to 1)) .cse3 (= |ULTIMATE.start_getClientForwardReceiver_#res| 0)))) [2020-10-25 22:47:54,929 INFO L270 CegarLoopResult]: At program point L2197(lines 2180 2203) the Hoare annotation is: (and (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ULTIMATE.start_incoming_~client) (= ULTIMATE.start_setEmailTo_~value 2) (= ~rjh~0 2) (= ULTIMATE.start_outgoing_~msg 1) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ULTIMATE.start_getEmailTo_~handle 1)) [2020-10-25 22:47:54,929 INFO L274 CegarLoopResult]: For program point L513(lines 513 524) no Hoare annotation was computed. [2020-10-25 22:47:54,929 INFO L274 CegarLoopResult]: For program point L480(lines 480 486) no Hoare annotation was computed. [2020-10-25 22:47:54,929 INFO L274 CegarLoopResult]: For program point L513-1(lines 513 524) no Hoare annotation was computed. [2020-10-25 22:47:54,929 INFO L274 CegarLoopResult]: For program point L513-2(lines 513 524) no Hoare annotation was computed. [2020-10-25 22:47:54,929 INFO L274 CegarLoopResult]: For program point L480-1(lines 480 486) no Hoare annotation was computed. [2020-10-25 22:47:54,929 INFO L274 CegarLoopResult]: For program point L513-3(lines 513 524) no Hoare annotation was computed. [2020-10-25 22:47:54,929 INFO L274 CegarLoopResult]: For program point L2231-1(lines 2231 2247) no Hoare annotation was computed. [2020-10-25 22:47:54,929 INFO L274 CegarLoopResult]: For program point L2231(lines 2231 2247) no Hoare annotation was computed. [2020-10-25 22:47:54,930 INFO L274 CegarLoopResult]: For program point L117(lines 117 125) no Hoare annotation was computed. [2020-10-25 22:47:54,930 INFO L270 CegarLoopResult]: At program point L448(lines 435 453) the Hoare annotation is: (let ((.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse0 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse8 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse9 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse1 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse2 (= ~rjh~0 2)) (.cse3 (= ULTIMATE.start_outgoing_~msg 1)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 (= 2 ULTIMATE.start_incoming_~client) .cse1 .cse2 .cse3 .cse4 (= ~__ste_email_to0~0 2) .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse8 .cse9) (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse0 .cse8 .cse9 .cse1 .cse2 .cse3 .cse4))) [2020-10-25 22:47:54,930 INFO L277 CegarLoopResult]: At program point L448-1(lines 435 453) the Hoare annotation is: true [2020-10-25 22:47:54,930 INFO L270 CegarLoopResult]: At program point L283(lines 273 383) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,930 INFO L270 CegarLoopResult]: At program point L2530(lines 1 2541) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1)) (not (= ~rjh~0 1))) [2020-10-25 22:47:54,930 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 22:47:54,930 INFO L274 CegarLoopResult]: For program point L251(lines 251 385) no Hoare annotation was computed. [2020-10-25 22:47:54,931 INFO L274 CegarLoopResult]: For program point L517(lines 517 523) no Hoare annotation was computed. [2020-10-25 22:47:54,931 INFO L274 CegarLoopResult]: For program point L517-1(lines 517 523) no Hoare annotation was computed. [2020-10-25 22:47:54,931 INFO L274 CegarLoopResult]: For program point L517-2(lines 517 523) no Hoare annotation was computed. [2020-10-25 22:47:54,931 INFO L274 CegarLoopResult]: For program point L517-3(lines 517 523) no Hoare annotation was computed. [2020-10-25 22:47:54,931 INFO L270 CegarLoopResult]: At program point L2400(lines 2395 2403) the Hoare annotation is: (let ((.cse0 (= 2 ULTIMATE.start_createEmail_~to)) (.cse1 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= ULTIMATE.start_outgoing_~msg 1)) (.cse5 (= ~rjh~0 2)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_incoming_~client) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6) (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse0 .cse1 .cse2 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse3 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse4 .cse5 .cse6))) [2020-10-25 22:47:54,932 INFO L270 CegarLoopResult]: At program point L352(lines 342 377) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,932 INFO L270 CegarLoopResult]: At program point L319(lines 306 380) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,932 INFO L274 CegarLoopResult]: For program point L2235-1(lines 2235 2246) no Hoare annotation was computed. [2020-10-25 22:47:54,932 INFO L274 CegarLoopResult]: For program point L2235(lines 2235 2246) no Hoare annotation was computed. [2020-10-25 22:47:54,932 INFO L270 CegarLoopResult]: At program point L485(lines 472 490) the Hoare annotation is: (let ((.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse0 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse8 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse9 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse1 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse2 (= ~rjh~0 2)) (.cse3 (= ULTIMATE.start_outgoing_~msg 1)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 (= 2 ULTIMATE.start_incoming_~client) .cse1 .cse2 .cse3 .cse4 (= ~__ste_email_to0~0 2) .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse8 .cse9) (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse0 .cse8 .cse9 .cse1 .cse2 .cse3 .cse4))) [2020-10-25 22:47:54,932 INFO L277 CegarLoopResult]: At program point L485-1(lines 472 490) the Hoare annotation is: true [2020-10-25 22:47:54,933 INFO L270 CegarLoopResult]: At program point L387(lines 242 388) the Hoare annotation is: (and (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,933 INFO L274 CegarLoopResult]: For program point L288(lines 288 292) no Hoare annotation was computed. [2020-10-25 22:47:54,933 INFO L274 CegarLoopResult]: For program point L255(lines 255 259) no Hoare annotation was computed. [2020-10-25 22:47:54,933 INFO L270 CegarLoopResult]: At program point L2337-1(lines 1 2541) the Hoare annotation is: (let ((.cse0 (= 2 ULTIMATE.start_createEmail_~to)) (.cse1 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= ULTIMATE.start_outgoing_~msg 1)) (.cse5 (= ~rjh~0 2)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_incoming_~client) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6) (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse0 .cse1 .cse2 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse3 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse4 .cse5 .cse6))) [2020-10-25 22:47:54,933 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 22:47:54,933 INFO L274 CegarLoopResult]: For program point L2337(lines 2337 2344) no Hoare annotation was computed. [2020-10-25 22:47:54,933 INFO L274 CegarLoopResult]: For program point L2337-2(lines 2337 2344) no Hoare annotation was computed. [2020-10-25 22:47:54,934 INFO L270 CegarLoopResult]: At program point L2503(lines 2492 2506) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~handle 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ULTIMATE.start_setEmailTo_~value 2) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,934 INFO L274 CegarLoopResult]: For program point L2239-1(lines 2239 2245) no Hoare annotation was computed. [2020-10-25 22:47:54,934 INFO L274 CegarLoopResult]: For program point L2239(lines 2239 2245) no Hoare annotation was computed. [2020-10-25 22:47:54,934 INFO L270 CegarLoopResult]: At program point L522(lines 509 527) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~handle 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ULTIMATE.start_setEmailTo_~value 2) (= ULTIMATE.start_getEmailTo_~handle 1) (= ~rjh~0 2) (= ULTIMATE.start_outgoing_~msg 1) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,934 INFO L270 CegarLoopResult]: At program point L522-1(lines 509 527) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse6 (= ULTIMATE.start_outgoing_~msg 1)) (.cse7 (= ~rjh~0 2)) (.cse8 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_incoming_~client) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-10-25 22:47:54,934 INFO L270 CegarLoopResult]: At program point L522-2(lines 509 527) the Hoare annotation is: (and (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= |ULTIMATE.start_createEmail_#res| 1) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,934 INFO L277 CegarLoopResult]: At program point L522-3(lines 509 527) the Hoare annotation is: true [2020-10-25 22:47:54,934 INFO L277 CegarLoopResult]: At program point L2471-1(lines 2446 2473) the Hoare annotation is: true [2020-10-25 22:47:54,935 INFO L270 CegarLoopResult]: At program point L2471(lines 2446 2473) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse6 (= ULTIMATE.start_outgoing_~msg 1)) (.cse7 (= ~rjh~0 2)) (.cse8 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_incoming_~client) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-10-25 22:47:54,935 INFO L274 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2020-10-25 22:47:54,935 INFO L274 CegarLoopResult]: For program point L324(lines 324 328) no Hoare annotation was computed. [2020-10-25 22:47:54,935 INFO L274 CegarLoopResult]: For program point L1183(lines 1183 1189) no Hoare annotation was computed. [2020-10-25 22:47:54,935 INFO L274 CegarLoopResult]: For program point L1183-2(lines 1183 1189) no Hoare annotation was computed. [2020-10-25 22:47:54,935 INFO L270 CegarLoopResult]: At program point L2538(lines 2533 2541) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1)) (not (= ~rjh~0 1))) [2020-10-25 22:47:54,935 INFO L274 CegarLoopResult]: For program point L2208(lines 2208 2220) no Hoare annotation was computed. [2020-10-25 22:47:54,935 INFO L270 CegarLoopResult]: At program point L160(lines 140 162) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,936 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 22:47:54,936 INFO L270 CegarLoopResult]: At program point L294(lines 284 382) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,936 INFO L270 CegarLoopResult]: At program point L261(lines 251 385) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,936 INFO L270 CegarLoopResult]: At program point L2409(lines 2404 2412) the Hoare annotation is: (let ((.cse0 (= 2 ULTIMATE.start_createEmail_~to)) (.cse1 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= ULTIMATE.start_outgoing_~msg 1)) (.cse5 (= ~rjh~0 2)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_incoming_~client) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6) (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse0 .cse1 .cse2 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse3 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse4 .cse5 .cse6))) [2020-10-25 22:47:54,936 INFO L270 CegarLoopResult]: At program point L2244(lines 2227 2250) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~handle 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ULTIMATE.start_setEmailTo_~value 2) (= ~rjh~0 2) (= ULTIMATE.start_outgoing_~msg 1) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,936 INFO L274 CegarLoopResult]: For program point L2211(lines 2211 2219) no Hoare annotation was computed. [2020-10-25 22:47:54,937 INFO L270 CegarLoopResult]: At program point L2244-1(lines 2227 2250) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse2 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse0 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse0 .cse1 .cse2 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse3 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse4 .cse5) (and (= ~__ste_email_to0~0 2) .cse1 .cse2 .cse0 (= 2 ULTIMATE.start_incoming_~client) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5))) [2020-10-25 22:47:54,937 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 22:47:54,937 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 22:47:54,937 INFO L274 CegarLoopResult]: For program point L495(lines 495 503) no Hoare annotation was computed. [2020-10-25 22:47:54,937 INFO L274 CegarLoopResult]: For program point L495-2(lines 495 503) no Hoare annotation was computed. [2020-10-25 22:47:54,937 INFO L270 CegarLoopResult]: At program point L363(lines 353 376) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,937 INFO L274 CegarLoopResult]: For program point L495-4(lines 495 503) no Hoare annotation was computed. [2020-10-25 22:47:54,937 INFO L270 CegarLoopResult]: At program point L330(lines 320 379) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,937 INFO L274 CegarLoopResult]: For program point L2214(lines 2214 2218) no Hoare annotation was computed. [2020-10-25 22:47:54,938 INFO L274 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2020-10-25 22:47:54,938 INFO L274 CegarLoopResult]: For program point L199-1(line 199) no Hoare annotation was computed. [2020-10-25 22:47:54,938 INFO L270 CegarLoopResult]: At program point L2214-2(lines 1 2541) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse1 (not (= ~__ste_email_to0~0 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_test_~op1~0 1) .cse3) (and .cse0 (= ULTIMATE.start_test_~op1~0 0) .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,938 INFO L270 CegarLoopResult]: At program point L2479-1(lines 2474 2482) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse0 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse3 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse6 (= ULTIMATE.start_outgoing_~msg 1)) (.cse7 (= ~rjh~0 2)) (.cse8 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_incoming_~client) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-10-25 22:47:54,938 INFO L270 CegarLoopResult]: At program point L2479(lines 2474 2482) the Hoare annotation is: (let ((.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse6 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse7 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse8 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse0 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_outgoing_~msg 1)) (.cse3 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and (= 2 ULTIMATE.start_incoming_~client) .cse0 .cse1 .cse2 .cse3 (= ~__ste_email_to0~0 2) .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse7 .cse8) (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse1 .cse2 .cse3))) [2020-10-25 22:47:54,938 INFO L277 CegarLoopResult]: At program point L2479-3(lines 2474 2482) the Hoare annotation is: true [2020-10-25 22:47:54,939 INFO L270 CegarLoopResult]: At program point L2479-2(lines 2474 2482) the Hoare annotation is: (and (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= |ULTIMATE.start_createEmail_#res| 1) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,939 INFO L274 CegarLoopResult]: For program point L299(lines 299 303) no Hoare annotation was computed. [2020-10-25 22:47:54,939 INFO L270 CegarLoopResult]: At program point L2314(lines 1 2541) the Hoare annotation is: (and (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ULTIMATE.start_incoming_~client) (= ULTIMATE.start_setEmailTo_~value 2) (= ~rjh~0 2) (= ULTIMATE.start_outgoing_~msg 1) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~__ste_email_to0~0 2) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ULTIMATE.start_getEmailTo_~handle 1)) [2020-10-25 22:47:54,939 INFO L274 CegarLoopResult]: For program point L266(lines 266 270) no Hoare annotation was computed. [2020-10-25 22:47:54,939 INFO L270 CegarLoopResult]: At program point L200(lines 1175 1192) the Hoare annotation is: (let ((.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (not (= ULTIMATE.start_setClientId_~handle 1))) (.cse0 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse8 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse9 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse1 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse2 (= ~rjh~0 2)) (.cse3 (= ULTIMATE.start_outgoing_~msg 1)) (.cse4 (not (= ULTIMATE.start_setClientId_~handle 2)))) (or (and .cse0 (= 2 ULTIMATE.start_incoming_~client) .cse1 .cse2 .cse3 .cse4 (= ~__ste_email_to0~0 2) .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse8 .cse9) (and (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse0 .cse8 .cse9 .cse1 .cse2 .cse3 .cse4))) [2020-10-25 22:47:54,939 INFO L270 CegarLoopResult]: At program point L2314-1(lines 1 2541) the Hoare annotation is: (and (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_createEmail_~msg~0 1) (not (= ULTIMATE.start_setClientId_~handle 1)) (= |ULTIMATE.start_createEmail_#res| 1) (= ~rjh~0 2) (not (= ULTIMATE.start_setClientId_~handle 2))) [2020-10-25 22:47:54,939 INFO L277 CegarLoopResult]: At program point L200-1(lines 1175 1192) the Hoare annotation is: true [2020-10-25 22:47:54,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 10:47:54 BoogieIcfgContainer [2020-10-25 22:47:54,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 22:47:54,991 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 22:47:54,991 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 22:47:54,992 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 22:47:54,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:47:29" (3/4) ... [2020-10-25 22:47:54,996 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 22:47:55,022 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2020-10-25 22:47:55,024 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2020-10-25 22:47:55,026 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-10-25 22:47:55,027 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-25 22:47:55,029 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 22:47:55,031 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 22:47:55,066 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_email_to0 == 2 && handle == 1) && !(handle == 1)) && 2 == to) && msg == 1) && \result == 1) && value == 2) && rjh == 2) && !(handle == 2) [2020-10-25 22:47:55,067 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((__ste_email_to0 == 2 && handle == 1) && !(handle == 1)) && 2 == to) && msg == 1) && \result == 1) && value == 2) && rjh == 2) && msg == 1) && !(handle == 2) [2020-10-25 22:47:55,067 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((__ste_email_to0 == 2 && handle == 1) && !(handle == 1)) && 2 == to) && msg == 1) && \result == 1) && value == 2) && rjh == 2) && msg == 1) && !(handle == 2) [2020-10-25 22:47:55,067 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((__ste_email_to0 == 2 && handle == 1) && !(handle == 1)) && 2 == to) && msg == 1) && 2 == \result) && \result == 1) && value == 2) && handle == 1) && rjh == 2) && msg == 1) && !(handle == 2) [2020-10-25 22:47:55,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == 1 && 2 == client) && value == 2) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && msg == 1) && 2 == \result) && \result == 1) && handle == 1 [2020-10-25 22:47:55,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == 1 && 2 == client) && value == 2) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && 2 == to) && msg == 1) && !(handle == 1)) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1 [2020-10-25 22:47:55,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((__ste_email_to0 == 2 && 2 == to) && msg == 1) && !(handle == 1)) && 2 == client) && 2 == handle) && \result == 1) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) [2020-10-25 22:47:55,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && \result == 1) && handle == 1) && rjh == 2) && msg == 1) && !(handle == 2)) || (((((((((((__ste_email_to0 == 2 && 2 == to) && msg == 1) && !(handle == 1)) && 2 == client) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1) && rjh == 2) && msg == 1) && !(handle == 2)) [2020-10-25 22:47:55,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((__ste_email_to0 == 2 && 2 == to) && msg == 1) && !(handle == 1)) && 2 == client) && 2 == handle) && \result == 1) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) [2020-10-25 22:47:55,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((__ste_email_to0 == 2 && 2 == to) && msg == 1) && !(handle == 1)) && 2 == client) && 2 == handle) && \result == 1) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) [2020-10-25 22:47:55,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 == client && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && 2 == to) && msg == 1) && !(handle == 1)) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && \result == 1) && handle == 1) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) [2020-10-25 22:47:55,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((__ste_email_to0 == 2 && 2 == to) && msg == 1) && !(handle == 1)) && 2 == client) && 2 == handle) && \result == 1) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) [2020-10-25 22:47:55,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(tmp == 0) && 2 == client) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && 2 == to) && msg == 1) && !(handle == 1)) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1) || ((((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && handle == 1) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) [2020-10-25 22:47:55,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && rjh == 2) && !(handle == 2)) || ((((((((__ste_email_to0 == 2 && msg == 1) && !(handle == 1)) && 2 == to) && 2 == client) && 2 == handle) && \result == 1) && rjh == 2) && !(handle == 2)) [2020-10-25 22:47:55,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(tmp == 0) && 2 == client) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && 2 == to) && msg == 1) && !(handle == 1)) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1) || ((((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && handle == 1) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) [2020-10-25 22:47:55,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && rjh == 2) && !(handle == 2)) || ((((((((__ste_email_to0 == 2 && msg == 1) && !(handle == 1)) && 2 == to) && 2 == client) && 2 == handle) && \result == 1) && rjh == 2) && !(handle == 2)) [2020-10-25 22:47:55,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(tmp == 0) && 2 == client) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && 2 == to) && msg == 1) && !(handle == 1)) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1) || ((((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && handle == 1) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) [2020-10-25 22:47:55,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 == to && msg == 1) && !(handle == 1)) && \result == 1) && rjh == 2) && !(handle == 2) [2020-10-25 22:47:55,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((__ste_email_to0 == 2 && !(handle == 1)) && 2 == to) && msg == 1) && !(tmp == 0)) && 2 == client) && 2 == handle) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) [2020-10-25 22:47:55,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 == to && msg == 1) && !(handle == 1)) && \result == 1) && rjh == 2) && !(handle == 2) [2020-10-25 22:47:55,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 == to && msg == 1) && !(handle == 1)) && \result == 1) && rjh == 2) && !(handle == 2)) || ((((((msg == 1 && !(handle == 1)) && !(rjh == 1)) && \result == 1) && !(to == 1)) && !(handle == 2)) && \result == 0) [2020-10-25 22:47:55,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((__ste_email_to0 == 2 && !(handle == 1)) && 2 == to) && msg == 1) && !(tmp == 0)) && 2 == client) && 2 == handle) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) [2020-10-25 22:47:55,073 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((__ste_email_to0 == 2 && !(handle == 1)) && 2 == to) && msg == 1) && !(tmp == 0)) && 2 == client) && 2 == handle) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) [2020-10-25 22:47:55,073 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 == to && msg == 1) && !(handle == 1)) && \result == 1) && rjh == 2) && !(handle == 2) [2020-10-25 22:47:55,073 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 == to && msg == 1) && !(handle == 1)) && \result == 1) && !(\result == 0)) && rjh == 2) && !(handle == 2) [2020-10-25 22:47:55,177 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 22:47:55,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 22:47:55,179 INFO L168 Benchmark]: Toolchain (without parser) took 28405.28 ms. Allocated memory was 54.5 MB in the beginning and 494.9 MB in the end (delta: 440.4 MB). Free memory was 29.4 MB in the beginning and 179.5 MB in the end (delta: -150.2 MB). Peak memory consumption was 291.7 MB. Max. memory is 16.1 GB. [2020-10-25 22:47:55,179 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 44.0 MB. Free memory was 24.0 MB in the beginning and 24.0 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:47:55,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 982.53 ms. Allocated memory is still 54.5 MB. Free memory was 28.7 MB in the beginning and 22.4 MB in the end (delta: 6.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 16.1 GB. [2020-10-25 22:47:55,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.48 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 22.4 MB in the beginning and 45.4 MB in the end (delta: -23.1 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-25 22:47:55,180 INFO L168 Benchmark]: Boogie Preprocessor took 57.97 ms. Allocated memory is still 69.2 MB. Free memory was 45.4 MB in the beginning and 42.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:47:55,180 INFO L168 Benchmark]: RCFGBuilder took 1363.01 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 42.0 MB in the beginning and 56.7 MB in the end (delta: -14.7 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:47:55,181 INFO L168 Benchmark]: TraceAbstraction took 25645.11 ms. Allocated memory was 83.9 MB in the beginning and 494.9 MB in the end (delta: 411.0 MB). Free memory was 56.1 MB in the beginning and 196.3 MB in the end (delta: -140.2 MB). Peak memory consumption was 309.2 MB. Max. memory is 16.1 GB. [2020-10-25 22:47:55,184 INFO L168 Benchmark]: Witness Printer took 185.99 ms. Allocated memory is still 494.9 MB. Free memory was 196.3 MB in the beginning and 179.5 MB in the end (delta: 16.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-10-25 22:47:55,188 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 44.0 MB. Free memory was 24.0 MB in the beginning and 24.0 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 982.53 ms. Allocated memory is still 54.5 MB. Free memory was 28.7 MB in the beginning and 22.4 MB in the end (delta: 6.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 153.48 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 22.4 MB in the beginning and 45.4 MB in the end (delta: -23.1 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.97 ms. Allocated memory is still 69.2 MB. Free memory was 45.4 MB in the beginning and 42.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1363.01 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 42.0 MB in the beginning and 56.7 MB in the end (delta: -14.7 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25645.11 ms. Allocated memory was 83.9 MB in the beginning and 494.9 MB in the end (delta: 411.0 MB). Free memory was 56.1 MB in the beginning and 196.3 MB in the end (delta: -140.2 MB). Peak memory consumption was 309.2 MB. Max. memory is 16.1 GB. * Witness Printer took 185.99 ms. Allocated memory is still 494.9 MB. Free memory was 196.3 MB in the beginning and 179.5 MB in the end (delta: 16.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: 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: 2474]: Loop Invariant Derived loop invariant: (((((((((((__ste_email_to0 == 2 && !(handle == 1)) && 2 == to) && msg == 1) && !(tmp == 0)) && 2 == client) && 2 == handle) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: ((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (__ste_client_forwardReceiver1 == 0 && !(__ste_email_to0 == 1)) && !(rjh == 1) - InvariantResult [Line: 2386]: Loop Invariant Derived loop invariant: (((((((((__ste_email_to0 == 2 && 2 == to) && msg == 1) && !(handle == 1)) && 2 == client) && 2 == handle) && \result == 1) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 2474]: Loop Invariant Derived loop invariant: (((((2 == to && msg == 1) && !(handle == 1)) && \result == 1) && !(\result == 0)) && rjh == 2) && !(handle == 2) - InvariantResult [Line: 2474]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((handle == 1 && 2 == client) && value == 2) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && !(handle == 1)) && 2 == to) && msg == 1) && 2 == \result) && \result == 1) && handle == 1 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((__ste_email_to0 == 2 && handle == 1) && !(handle == 1)) && 2 == to) && msg == 1) && 2 == \result) && \result == 1) && value == 2) && handle == 1) && rjh == 2) && msg == 1) && !(handle == 2) - InvariantResult [Line: 2180]: Loop Invariant Derived loop invariant: ((((((((((((handle == 1 && 2 == client) && value == 2) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && 2 == to) && msg == 1) && !(handle == 1)) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((__ste_client_forwardReceiver1 == 0 && !(handle == 1)) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2) - InvariantResult [Line: 2474]: Loop Invariant Derived loop invariant: ((((((((((((2 == client && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && 2 == to) && msg == 1) && !(handle == 1)) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && \result == 1) && handle == 1) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: ((((((((__ste_email_to0 == 2 && handle == 1) && !(handle == 1)) && 2 == to) && msg == 1) && \result == 1) && value == 2) && rjh == 2) && msg == 1) && !(handle == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((__ste_client_forwardReceiver1 == 0 && !(handle == 1)) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2) - InvariantResult [Line: 2533]: Loop Invariant Derived loop invariant: (__ste_client_forwardReceiver1 == 0 && !(__ste_email_to0 == 1)) && !(rjh == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((__ste_email_to0 == 2 && 2 == to) && msg == 1) && !(handle == 1)) && 2 == client) && 2 == handle) && \result == 1) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: ((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && rjh == 2) && !(handle == 2)) || ((((((((__ste_email_to0 == 2 && msg == 1) && !(handle == 1)) && 2 == to) && 2 == client) && 2 == handle) && \result == 1) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((__ste_client_forwardReceiver1 == 0 && !(__ste_email_to0 == 1)) && !(rjh == 1)) && !(handle == 2) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && \result == 1) && handle == 1) && rjh == 2) && msg == 1) && !(handle == 2)) || (((((((((((__ste_email_to0 == 2 && 2 == to) && msg == 1) && !(handle == 1)) && 2 == client) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1) && rjh == 2) && msg == 1) && !(handle == 2)) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && 2 == to) && msg == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((__ste_client_forwardReceiver1 == 0 && !(__ste_email_to0 == 1)) && rjh == handle) && rjh == 2 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((2 == to && msg == 1) && !(handle == 1)) && \result == 1) && rjh == 2) && !(handle == 2) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((__ste_email_to0 == 2 && !(handle == 1)) && handle == 1) && 2 == to) && msg == 1) && value == 2) && rjh == 2) && !(handle == 2) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 2395]: Loop Invariant Derived loop invariant: (((((((((__ste_email_to0 == 2 && 2 == to) && msg == 1) && !(handle == 1)) && 2 == client) && 2 == handle) && \result == 1) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 2492]: Loop Invariant Derived loop invariant: (((((((__ste_email_to0 == 2 && handle == 1) && !(handle == 1)) && 2 == to) && msg == 1) && \result == 1) && value == 2) && rjh == 2) && !(handle == 2) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2227]: Loop Invariant Derived loop invariant: ((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && rjh == 2) && !(handle == 2)) || ((((((((__ste_email_to0 == 2 && msg == 1) && !(handle == 1)) && 2 == to) && 2 == client) && 2 == handle) && \result == 1) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 2227]: Loop Invariant Derived loop invariant: ((((((((__ste_email_to0 == 2 && handle == 1) && !(handle == 1)) && 2 == to) && msg == 1) && \result == 1) && value == 2) && rjh == 2) && msg == 1) && !(handle == 2) - InvariantResult [Line: 1175]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1175]: Loop Invariant Derived loop invariant: (((((((((((((!(tmp == 0) && 2 == client) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && 2 == to) && msg == 1) && !(handle == 1)) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1) || ((((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && handle == 1) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((((((((!(tmp == 0) && 2 == client) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && 2 == to) && msg == 1) && !(handle == 1)) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1) || ((((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && handle == 1) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((((__ste_email_to0 == 2 && !(handle == 1)) && 2 == to) && msg == 1) && !(tmp == 0)) && 2 == client) && 2 == handle) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2180]: Loop Invariant Derived loop invariant: (((((2 == to && msg == 1) && !(handle == 1)) && \result == 1) && rjh == 2) && !(handle == 2)) || ((((((msg == 1 && !(handle == 1)) && !(rjh == 1)) && \result == 1) && !(to == 1)) && !(handle == 2)) && \result == 0) - InvariantResult [Line: 2404]: Loop Invariant Derived loop invariant: (((((((((__ste_email_to0 == 2 && 2 == to) && msg == 1) && !(handle == 1)) && 2 == client) && 2 == handle) && \result == 1) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((2 == to && msg == 1) && !(handle == 1)) && \result == 1) && rjh == 2) && !(handle == 2) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((2 == to && msg == 1) && !(handle == 1)) && \result == 1) && rjh == 2) && !(handle == 2) - InvariantResult [Line: 2446]: Loop Invariant Derived loop invariant: (((((((((((__ste_email_to0 == 2 && !(handle == 1)) && 2 == to) && msg == 1) && !(tmp == 0)) && 2 == client) && 2 == handle) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) || (((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && !(\result == 0)) && msg == 1) && rjh == 2) && !(handle == 2)) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2446]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: (((((((((((((!(tmp == 0) && 2 == client) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) && __ste_email_to0 == 2) && 2 == to) && msg == 1) && !(handle == 1)) && 2 == handle) && 2 == \result) && \result == 1) && handle == 1) || ((((((((((handle == 1 && 2 == to) && msg == 1) && !(handle == 1)) && !(tmp == 0)) && \result == 1) && handle == 1) && !(\result == 0)) && rjh == 2) && msg == 1) && !(handle == 2)) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((!(handle == 1) && !(__ste_email_to0 == 1)) && rjh == 2) && op1 == 1) && !(handle == 2)) || ((((!(handle == 1) && op1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2) && !(handle == 2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 136 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.8s, OverallIterations: 18, TraceHistogramMax: 3, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4019 SDtfs, 5361 SDslu, 7163 SDs, 0 SdLazy, 578 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1902occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 1713 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 54 PreInvPairs, 1243 NumberOfFragments, 2030 HoareAnnotationTreeSize, 54 FomulaSimplifications, 79664078 FormulaSimplificationTreeSizeReduction, 4.5s HoareSimplificationTime, 54 FomulaSimplificationsInter, 1285270 FormulaSimplificationTreeSizeReductionInter, 12.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 971 NumberOfCodeBlocks, 971 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 951 ConstructedInterpolants, 0 QuantifiedInterpolants, 73196 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1528 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 95/109 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...