./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/email_spec0_product10.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec0_product10.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be --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 ac360da941eb2bc713d1cdb41b6939d6a50ea394a41fda87a7330709a6b33058 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 20:22:00,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 20:22:00,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 20:22:00,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 20:22:00,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 20:22:00,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 20:22:00,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 20:22:00,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 20:22:00,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 20:22:00,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 20:22:00,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 20:22:00,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 20:22:00,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 20:22:00,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 20:22:00,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 20:22:00,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 20:22:00,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 20:22:00,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 20:22:00,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 20:22:00,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 20:22:00,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 20:22:00,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 20:22:00,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 20:22:00,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 20:22:00,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 20:22:00,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 20:22:00,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 20:22:00,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 20:22:00,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 20:22:00,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 20:22:00,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 20:22:00,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 20:22:00,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 20:22:00,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 20:22:00,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 20:22:00,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 20:22:00,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 20:22:00,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 20:22:00,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 20:22:00,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 20:22:00,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 20:22:00,142 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 20:22:00,191 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 20:22:00,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 20:22:00,197 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 20:22:00,197 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 20:22:00,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 20:22:00,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 20:22:00,202 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 20:22:00,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 20:22:00,203 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 20:22:00,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 20:22:00,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 20:22:00,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 20:22:00,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 20:22:00,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 20:22:00,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 20:22:00,205 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 20:22:00,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 20:22:00,206 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 20:22:00,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 20:22:00,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 20:22:00,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 20:22:00,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 20:22:00,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:22:00,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 20:22:00,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 20:22:00,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 20:22:00,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 20:22:00,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 20:22:00,208 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 20:22:00,210 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 20:22:00,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 20:22:00,211 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 20:22:00,211 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be 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 -> ac360da941eb2bc713d1cdb41b6939d6a50ea394a41fda87a7330709a6b33058 [2021-10-21 20:22:00,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 20:22:00,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 20:22:00,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 20:22:00,559 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 20:22:00,560 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 20:22:00,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/product-lines/email_spec0_product10.cil.c [2021-10-21 20:22:00,629 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/data/ab64d0ce7/21fddaaab22341ed80a6a3e8d617de52/FLAGa10f99035 [2021-10-21 20:22:01,255 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 20:22:01,256 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/sv-benchmarks/c/product-lines/email_spec0_product10.cil.c [2021-10-21 20:22:01,274 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/data/ab64d0ce7/21fddaaab22341ed80a6a3e8d617de52/FLAGa10f99035 [2021-10-21 20:22:01,471 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/data/ab64d0ce7/21fddaaab22341ed80a6a3e8d617de52 [2021-10-21 20:22:01,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 20:22:01,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 20:22:01,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 20:22:01,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 20:22:01,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 20:22:01,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:22:01" (1/1) ... [2021-10-21 20:22:01,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36fe05d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:01, skipping insertion in model container [2021-10-21 20:22:01,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:22:01" (1/1) ... [2021-10-21 20:22:01,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 20:22:01,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 20:22:01,814 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/sv-benchmarks/c/product-lines/email_spec0_product10.cil.c[2842,2855] [2021-10-21 20:22:02,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:22:02,182 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 20:22:02,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/sv-benchmarks/c/product-lines/email_spec0_product10.cil.c[2842,2855] [2021-10-21 20:22:02,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:22:02,370 INFO L208 MainTranslator]: Completed translation [2021-10-21 20:22:02,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02 WrapperNode [2021-10-21 20:22:02,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 20:22:02,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 20:22:02,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 20:22:02,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 20:22:02,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02" (1/1) ... [2021-10-21 20:22:02,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02" (1/1) ... [2021-10-21 20:22:02,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 20:22:02,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 20:22:02,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 20:22:02,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 20:22:02,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02" (1/1) ... [2021-10-21 20:22:02,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02" (1/1) ... [2021-10-21 20:22:02,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02" (1/1) ... [2021-10-21 20:22:02,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02" (1/1) ... [2021-10-21 20:22:02,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02" (1/1) ... [2021-10-21 20:22:02,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02" (1/1) ... [2021-10-21 20:22:02,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02" (1/1) ... [2021-10-21 20:22:02,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 20:22:02,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 20:22:02,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 20:22:02,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 20:22:02,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02" (1/1) ... [2021-10-21 20:22:02,578 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:22:02,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:22:02,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 20:22:02,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 20:22:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2021-10-21 20:22:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 20:22:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 20:22:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 20:22:02,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 20:22:03,922 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 20:22:03,922 INFO L299 CfgBuilder]: Removed 155 assume(true) statements. [2021-10-21 20:22:03,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:22:03 BoogieIcfgContainer [2021-10-21 20:22:03,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 20:22:03,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 20:22:03,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 20:22:03,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 20:22:03,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 08:22:01" (1/3) ... [2021-10-21 20:22:03,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e918d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:22:03, skipping insertion in model container [2021-10-21 20:22:03,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:22:02" (2/3) ... [2021-10-21 20:22:03,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e918d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:22:03, skipping insertion in model container [2021-10-21 20:22:03,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:22:03" (3/3) ... [2021-10-21 20:22:03,935 INFO L111 eAbstractionObserver]: Analyzing ICFG email_spec0_product10.cil.c [2021-10-21 20:22:03,946 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 20:22:03,946 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-21 20:22:04,010 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 20:22:04,018 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 20:22:04,018 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-21 20:22:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 159 states have (on average 1.6540880503144655) internal successors, (263), 161 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-21 20:22:04,057 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:04,058 INFO L512 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] [2021-10-21 20:22:04,059 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1170669752, now seen corresponding path program 1 times [2021-10-21 20:22:04,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:04,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402847174] [2021-10-21 20:22:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:04,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:22:04,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:04,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402847174] [2021-10-21 20:22:04,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402847174] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:04,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:04,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 20:22:04,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416299640] [2021-10-21 20:22:04,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-21 20:22:04,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:04,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-21 20:22:04,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-21 20:22:04,479 INFO L87 Difference]: Start difference. First operand has 162 states, 159 states have (on average 1.6540880503144655) internal successors, (263), 161 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:04,537 INFO L93 Difference]: Finished difference Result 273 states and 434 transitions. [2021-10-21 20:22:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-21 20:22:04,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-21 20:22:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:04,549 INFO L225 Difference]: With dead ends: 273 [2021-10-21 20:22:04,550 INFO L226 Difference]: Without dead ends: 146 [2021-10-21 20:22:04,552 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-21 20:22:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-10-21 20:22:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-10-21 20:22:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 144 states have (on average 1.625) internal successors, (234), 145 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 234 transitions. [2021-10-21 20:22:04,596 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 234 transitions. Word has length 38 [2021-10-21 20:22:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:04,597 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 234 transitions. [2021-10-21 20:22:04,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 234 transitions. [2021-10-21 20:22:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 20:22:04,600 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:04,600 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:22:04,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 20:22:04,601 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1521803372, now seen corresponding path program 1 times [2021-10-21 20:22:04,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:04,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294122856] [2021-10-21 20:22:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:04,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:22:04,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:04,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294122856] [2021-10-21 20:22:04,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294122856] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:04,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:04,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:22:04,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562452341] [2021-10-21 20:22:04,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:22:04,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:04,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:22:04,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:04,790 INFO L87 Difference]: Start difference. First operand 146 states and 234 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:04,863 INFO L93 Difference]: Finished difference Result 411 states and 660 transitions. [2021-10-21 20:22:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:22:04,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-21 20:22:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:04,867 INFO L225 Difference]: With dead ends: 411 [2021-10-21 20:22:04,867 INFO L226 Difference]: Without dead ends: 276 [2021-10-21 20:22:04,869 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-10-21 20:22:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 145. [2021-10-21 20:22:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 143 states have (on average 1.6083916083916083) internal successors, (230), 144 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 230 transitions. [2021-10-21 20:22:04,891 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 230 transitions. Word has length 39 [2021-10-21 20:22:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:04,891 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 230 transitions. [2021-10-21 20:22:04,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 230 transitions. [2021-10-21 20:22:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 20:22:04,894 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:04,894 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:22:04,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 20:22:04,895 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash 964876999, now seen corresponding path program 1 times [2021-10-21 20:22:04,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:04,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760929720] [2021-10-21 20:22:04,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:04,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:22:04,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:04,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760929720] [2021-10-21 20:22:04,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760929720] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:04,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:04,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:22:04,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368151560] [2021-10-21 20:22:04,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:22:04,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:04,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:22:04,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:04,978 INFO L87 Difference]: Start difference. First operand 145 states and 230 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:05,014 INFO L93 Difference]: Finished difference Result 276 states and 440 transitions. [2021-10-21 20:22:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:22:05,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-21 20:22:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:05,021 INFO L225 Difference]: With dead ends: 276 [2021-10-21 20:22:05,021 INFO L226 Difference]: Without dead ends: 146 [2021-10-21 20:22:05,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-10-21 20:22:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2021-10-21 20:22:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 143 states have (on average 1.5874125874125875) internal successors, (227), 144 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 227 transitions. [2021-10-21 20:22:05,054 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 227 transitions. Word has length 40 [2021-10-21 20:22:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:05,054 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 227 transitions. [2021-10-21 20:22:05,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 227 transitions. [2021-10-21 20:22:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-21 20:22:05,060 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:05,061 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:22:05,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 20:22:05,062 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash -559359774, now seen corresponding path program 1 times [2021-10-21 20:22:05,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:05,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773966410] [2021-10-21 20:22:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:05,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:22:05,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:05,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773966410] [2021-10-21 20:22:05,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773966410] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:05,195 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:05,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:22:05,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174638565] [2021-10-21 20:22:05,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:22:05,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:22:05,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:05,198 INFO L87 Difference]: Start difference. First operand 145 states and 227 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:05,219 INFO L93 Difference]: Finished difference Result 243 states and 376 transitions. [2021-10-21 20:22:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:22:05,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-10-21 20:22:05,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:05,222 INFO L225 Difference]: With dead ends: 243 [2021-10-21 20:22:05,222 INFO L226 Difference]: Without dead ends: 148 [2021-10-21 20:22:05,224 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-10-21 20:22:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2021-10-21 20:22:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 145 states have (on average 1.5793103448275863) internal successors, (229), 146 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 229 transitions. [2021-10-21 20:22:05,247 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 229 transitions. Word has length 42 [2021-10-21 20:22:05,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:05,247 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 229 transitions. [2021-10-21 20:22:05,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 229 transitions. [2021-10-21 20:22:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-21 20:22:05,253 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:05,253 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:22:05,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 20:22:05,254 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:05,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:05,255 INFO L82 PathProgramCache]: Analyzing trace with hash 499910929, now seen corresponding path program 1 times [2021-10-21 20:22:05,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:05,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026246624] [2021-10-21 20:22:05,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:05,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:22:05,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:05,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026246624] [2021-10-21 20:22:05,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026246624] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:22:05,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459345687] [2021-10-21 20:22:05,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:05,364 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:22:05,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:22:05,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 20:22:05,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-21 20:22:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:05,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-21 20:22:05,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 20:22:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:22:05,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459345687] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:22:05,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 20:22:05,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-21 20:22:05,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586158261] [2021-10-21 20:22:05,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 20:22:05,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:05,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 20:22:05,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:22:05,875 INFO L87 Difference]: Start difference. First operand 147 states and 229 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:05,900 INFO L93 Difference]: Finished difference Result 371 states and 582 transitions. [2021-10-21 20:22:05,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:22:05,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-10-21 20:22:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:05,903 INFO L225 Difference]: With dead ends: 371 [2021-10-21 20:22:05,903 INFO L226 Difference]: Without dead ends: 276 [2021-10-21 20:22:05,904 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:22:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-10-21 20:22:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 180. [2021-10-21 20:22:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 178 states have (on average 1.6292134831460674) internal successors, (290), 179 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2021-10-21 20:22:05,924 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 47 [2021-10-21 20:22:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:05,926 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2021-10-21 20:22:05,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2021-10-21 20:22:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-21 20:22:05,930 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:05,931 INFO L512 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, 1, 1, 1, 1] [2021-10-21 20:22:05,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-21 20:22:06,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:22:06,156 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:06,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:06,157 INFO L82 PathProgramCache]: Analyzing trace with hash 358260290, now seen corresponding path program 2 times [2021-10-21 20:22:06,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:06,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133742428] [2021-10-21 20:22:06,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:06,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:22:06,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:06,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133742428] [2021-10-21 20:22:06,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133742428] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:06,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:06,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:22:06,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325426069] [2021-10-21 20:22:06,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:22:06,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:06,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:22:06,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:06,269 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:06,290 INFO L93 Difference]: Finished difference Result 437 states and 704 transitions. [2021-10-21 20:22:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:22:06,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-21 20:22:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:06,293 INFO L225 Difference]: With dead ends: 437 [2021-10-21 20:22:06,293 INFO L226 Difference]: Without dead ends: 309 [2021-10-21 20:22:06,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-10-21 20:22:06,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 214. [2021-10-21 20:22:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.6556603773584906) internal successors, (351), 213 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 351 transitions. [2021-10-21 20:22:06,306 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 351 transitions. Word has length 52 [2021-10-21 20:22:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:06,307 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 351 transitions. [2021-10-21 20:22:06,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 351 transitions. [2021-10-21 20:22:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-21 20:22:06,308 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:06,309 INFO L512 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] [2021-10-21 20:22:06,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 20:22:06,309 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:06,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:06,310 INFO L82 PathProgramCache]: Analyzing trace with hash 928867361, now seen corresponding path program 1 times [2021-10-21 20:22:06,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:06,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435186413] [2021-10-21 20:22:06,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:06,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-21 20:22:06,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:06,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435186413] [2021-10-21 20:22:06,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435186413] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:06,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:06,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:22:06,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749445067] [2021-10-21 20:22:06,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:22:06,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:06,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:22:06,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:06,390 INFO L87 Difference]: Start difference. First operand 214 states and 351 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:06,413 INFO L93 Difference]: Finished difference Result 499 states and 818 transitions. [2021-10-21 20:22:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:22:06,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-21 20:22:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:06,416 INFO L225 Difference]: With dead ends: 499 [2021-10-21 20:22:06,416 INFO L226 Difference]: Without dead ends: 309 [2021-10-21 20:22:06,417 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-10-21 20:22:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 214. [2021-10-21 20:22:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.6462264150943395) internal successors, (349), 213 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 349 transitions. [2021-10-21 20:22:06,432 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 349 transitions. Word has length 54 [2021-10-21 20:22:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:06,433 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 349 transitions. [2021-10-21 20:22:06,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 349 transitions. [2021-10-21 20:22:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-21 20:22:06,434 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:06,435 INFO L512 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] [2021-10-21 20:22:06,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 20:22:06,435 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:06,436 INFO L82 PathProgramCache]: Analyzing trace with hash 663544003, now seen corresponding path program 2 times [2021-10-21 20:22:06,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:06,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124249766] [2021-10-21 20:22:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:06,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 20:22:06,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:06,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124249766] [2021-10-21 20:22:06,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124249766] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:06,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:06,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:22:06,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893147351] [2021-10-21 20:22:06,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:22:06,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:22:06,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:06,515 INFO L87 Difference]: Start difference. First operand 214 states and 349 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:06,538 INFO L93 Difference]: Finished difference Result 550 states and 908 transitions. [2021-10-21 20:22:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:22:06,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-21 20:22:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:06,542 INFO L225 Difference]: With dead ends: 550 [2021-10-21 20:22:06,542 INFO L226 Difference]: Without dead ends: 366 [2021-10-21 20:22:06,543 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-21 20:22:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 271. [2021-10-21 20:22:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 269 states have (on average 1.6728624535315986) internal successors, (450), 270 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 450 transitions. [2021-10-21 20:22:06,560 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 450 transitions. Word has length 54 [2021-10-21 20:22:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:06,560 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 450 transitions. [2021-10-21 20:22:06,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 450 transitions. [2021-10-21 20:22:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-21 20:22:06,562 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:06,562 INFO L512 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] [2021-10-21 20:22:06,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 20:22:06,562 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:06,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:06,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2045513071, now seen corresponding path program 1 times [2021-10-21 20:22:06,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:06,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484399943] [2021-10-21 20:22:06,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:06,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 20:22:06,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:06,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484399943] [2021-10-21 20:22:06,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484399943] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:06,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:06,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 20:22:06,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328223854] [2021-10-21 20:22:06,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 20:22:06,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:06,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 20:22:06,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:22:06,669 INFO L87 Difference]: Start difference. First operand 271 states and 450 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:06,835 INFO L93 Difference]: Finished difference Result 641 states and 1067 transitions. [2021-10-21 20:22:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:22:06,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-10-21 20:22:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:06,839 INFO L225 Difference]: With dead ends: 641 [2021-10-21 20:22:06,839 INFO L226 Difference]: Without dead ends: 423 [2021-10-21 20:22:06,840 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-21 20:22:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-10-21 20:22:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 271. [2021-10-21 20:22:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 269 states have (on average 1.661710037174721) internal successors, (447), 270 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 447 transitions. [2021-10-21 20:22:06,864 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 447 transitions. Word has length 55 [2021-10-21 20:22:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:06,865 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 447 transitions. [2021-10-21 20:22:06,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 447 transitions. [2021-10-21 20:22:06,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-21 20:22:06,866 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:06,866 INFO L512 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] [2021-10-21 20:22:06,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 20:22:06,867 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash -626013561, now seen corresponding path program 1 times [2021-10-21 20:22:06,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:06,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691985782] [2021-10-21 20:22:06,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:06,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 20:22:06,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:06,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691985782] [2021-10-21 20:22:06,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691985782] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:06,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:06,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 20:22:06,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594188199] [2021-10-21 20:22:06,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 20:22:06,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:06,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 20:22:07,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-21 20:22:07,000 INFO L87 Difference]: Start difference. First operand 271 states and 447 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:07,843 INFO L93 Difference]: Finished difference Result 894 states and 1355 transitions. [2021-10-21 20:22:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-21 20:22:07,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-10-21 20:22:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:07,851 INFO L225 Difference]: With dead ends: 894 [2021-10-21 20:22:07,851 INFO L226 Difference]: Without dead ends: 821 [2021-10-21 20:22:07,852 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 328.2ms TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2021-10-21 20:22:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-10-21 20:22:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 314. [2021-10-21 20:22:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 312 states have (on average 1.6314102564102564) internal successors, (509), 313 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 509 transitions. [2021-10-21 20:22:07,896 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 509 transitions. Word has length 55 [2021-10-21 20:22:07,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:07,897 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 509 transitions. [2021-10-21 20:22:07,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 509 transitions. [2021-10-21 20:22:07,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-21 20:22:07,898 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:07,899 INFO L512 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] [2021-10-21 20:22:07,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 20:22:07,899 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1977535086, now seen corresponding path program 1 times [2021-10-21 20:22:07,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:07,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12290362] [2021-10-21 20:22:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:07,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 20:22:08,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:08,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12290362] [2021-10-21 20:22:08,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12290362] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:08,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:08,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 20:22:08,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519100381] [2021-10-21 20:22:08,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 20:22:08,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:08,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 20:22:08,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-21 20:22:08,056 INFO L87 Difference]: Start difference. First operand 314 states and 509 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:08,908 INFO L93 Difference]: Finished difference Result 929 states and 1399 transitions. [2021-10-21 20:22:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-21 20:22:08,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-10-21 20:22:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:08,914 INFO L225 Difference]: With dead ends: 929 [2021-10-21 20:22:08,914 INFO L226 Difference]: Without dead ends: 833 [2021-10-21 20:22:08,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 329.6ms TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2021-10-21 20:22:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-10-21 20:22:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 341. [2021-10-21 20:22:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 339 states have (on average 1.6224188790560472) internal successors, (550), 340 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 550 transitions. [2021-10-21 20:22:08,979 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 550 transitions. Word has length 56 [2021-10-21 20:22:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:08,980 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 550 transitions. [2021-10-21 20:22:08,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 550 transitions. [2021-10-21 20:22:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-21 20:22:08,981 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:08,982 INFO L512 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] [2021-10-21 20:22:08,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 20:22:08,982 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:08,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:08,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1899401231, now seen corresponding path program 1 times [2021-10-21 20:22:08,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:08,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408789371] [2021-10-21 20:22:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:08,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 20:22:09,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:09,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408789371] [2021-10-21 20:22:09,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408789371] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:09,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:09,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 20:22:09,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266573059] [2021-10-21 20:22:09,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 20:22:09,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:09,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 20:22:09,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:22:09,056 INFO L87 Difference]: Start difference. First operand 341 states and 550 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:09,151 INFO L93 Difference]: Finished difference Result 542 states and 842 transitions. [2021-10-21 20:22:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 20:22:09,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-10-21 20:22:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:09,154 INFO L225 Difference]: With dead ends: 542 [2021-10-21 20:22:09,155 INFO L226 Difference]: Without dead ends: 393 [2021-10-21 20:22:09,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-21 20:22:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-10-21 20:22:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 322. [2021-10-21 20:22:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 320 states have (on average 1.621875) internal successors, (519), 321 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 519 transitions. [2021-10-21 20:22:09,189 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 519 transitions. Word has length 56 [2021-10-21 20:22:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:09,189 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 519 transitions. [2021-10-21 20:22:09,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2021-10-21 20:22:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-21 20:22:09,191 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:09,191 INFO L512 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] [2021-10-21 20:22:09,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 20:22:09,191 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:09,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1757108711, now seen corresponding path program 1 times [2021-10-21 20:22:09,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:09,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928689236] [2021-10-21 20:22:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:09,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 20:22:09,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:09,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928689236] [2021-10-21 20:22:09,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928689236] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:09,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:09,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:22:09,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029977171] [2021-10-21 20:22:09,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 20:22:09,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:09,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 20:22:09,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:22:09,259 INFO L87 Difference]: Start difference. First operand 322 states and 519 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:09,421 INFO L93 Difference]: Finished difference Result 875 states and 1376 transitions. [2021-10-21 20:22:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 20:22:09,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-21 20:22:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:09,427 INFO L225 Difference]: With dead ends: 875 [2021-10-21 20:22:09,427 INFO L226 Difference]: Without dead ends: 767 [2021-10-21 20:22:09,428 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 25.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:22:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2021-10-21 20:22:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 587. [2021-10-21 20:22:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 585 states have (on average 1.623931623931624) internal successors, (950), 586 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 950 transitions. [2021-10-21 20:22:09,506 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 950 transitions. Word has length 57 [2021-10-21 20:22:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:09,507 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 950 transitions. [2021-10-21 20:22:09,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 950 transitions. [2021-10-21 20:22:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-21 20:22:09,509 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:09,509 INFO L512 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] [2021-10-21 20:22:09,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 20:22:09,510 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash 905258701, now seen corresponding path program 1 times [2021-10-21 20:22:09,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:09,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881930460] [2021-10-21 20:22:09,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:09,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 20:22:09,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:09,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881930460] [2021-10-21 20:22:09,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881930460] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:09,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:09,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 20:22:09,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267202920] [2021-10-21 20:22:09,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:22:09,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:22:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:22:09,615 INFO L87 Difference]: Start difference. First operand 587 states and 950 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:10,393 INFO L93 Difference]: Finished difference Result 1594 states and 2408 transitions. [2021-10-21 20:22:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-21 20:22:10,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-21 20:22:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:10,401 INFO L225 Difference]: With dead ends: 1594 [2021-10-21 20:22:10,401 INFO L226 Difference]: Without dead ends: 1345 [2021-10-21 20:22:10,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 230.1ms TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2021-10-21 20:22:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2021-10-21 20:22:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 710. [2021-10-21 20:22:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 708 states have (on average 1.5889830508474576) internal successors, (1125), 709 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1125 transitions. [2021-10-21 20:22:10,483 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1125 transitions. Word has length 58 [2021-10-21 20:22:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:10,483 INFO L470 AbstractCegarLoop]: Abstraction has 710 states and 1125 transitions. [2021-10-21 20:22:10,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1125 transitions. [2021-10-21 20:22:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-21 20:22:10,485 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:10,485 INFO L512 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] [2021-10-21 20:22:10,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 20:22:10,485 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1393067954, now seen corresponding path program 1 times [2021-10-21 20:22:10,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:10,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373069842] [2021-10-21 20:22:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:10,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 20:22:10,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:10,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373069842] [2021-10-21 20:22:10,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373069842] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:10,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:10,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:22:10,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081462396] [2021-10-21 20:22:10,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:22:10,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:10,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:22:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:22:10,539 INFO L87 Difference]: Start difference. First operand 710 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:10,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:10,634 INFO L93 Difference]: Finished difference Result 977 states and 1504 transitions. [2021-10-21 20:22:10,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:22:10,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-10-21 20:22:10,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:10,638 INFO L225 Difference]: With dead ends: 977 [2021-10-21 20:22:10,639 INFO L226 Difference]: Without dead ends: 699 [2021-10-21 20:22:10,639 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:22:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-10-21 20:22:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 555. [2021-10-21 20:22:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 553 states have (on average 1.6130198915009042) internal successors, (892), 554 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 892 transitions. [2021-10-21 20:22:10,692 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 892 transitions. Word has length 59 [2021-10-21 20:22:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:10,693 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 892 transitions. [2021-10-21 20:22:10,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 892 transitions. [2021-10-21 20:22:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-21 20:22:10,694 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:10,694 INFO L512 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, 1, 1] [2021-10-21 20:22:10,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 20:22:10,695 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:10,695 INFO L82 PathProgramCache]: Analyzing trace with hash 596644252, now seen corresponding path program 1 times [2021-10-21 20:22:10,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:10,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138870566] [2021-10-21 20:22:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:10,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 20:22:10,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:10,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138870566] [2021-10-21 20:22:10,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138870566] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:10,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:10,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:22:10,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641824170] [2021-10-21 20:22:10,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:22:10,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:10,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:22:10,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:10,762 INFO L87 Difference]: Start difference. First operand 555 states and 892 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:10,877 INFO L93 Difference]: Finished difference Result 1566 states and 2532 transitions. [2021-10-21 20:22:10,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:22:10,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-21 20:22:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:10,884 INFO L225 Difference]: With dead ends: 1566 [2021-10-21 20:22:10,884 INFO L226 Difference]: Without dead ends: 1045 [2021-10-21 20:22:10,885 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-10-21 20:22:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 789. [2021-10-21 20:22:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 787 states have (on average 1.6581956797966964) internal successors, (1305), 788 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1305 transitions. [2021-10-21 20:22:10,953 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1305 transitions. Word has length 63 [2021-10-21 20:22:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:10,953 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1305 transitions. [2021-10-21 20:22:10,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1305 transitions. [2021-10-21 20:22:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-21 20:22:10,955 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:10,955 INFO L512 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, 1, 1, 1] [2021-10-21 20:22:10,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 20:22:10,956 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:10,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:10,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1480771081, now seen corresponding path program 1 times [2021-10-21 20:22:10,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:10,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938543228] [2021-10-21 20:22:10,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:10,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 20:22:10,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:10,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938543228] [2021-10-21 20:22:10,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938543228] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:10,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:10,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:22:10,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050258114] [2021-10-21 20:22:10,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:22:10,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:22:11,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:11,000 INFO L87 Difference]: Start difference. First operand 789 states and 1305 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:11,141 INFO L93 Difference]: Finished difference Result 2254 states and 3749 transitions. [2021-10-21 20:22:11,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:22:11,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-21 20:22:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:11,151 INFO L225 Difference]: With dead ends: 2254 [2021-10-21 20:22:11,151 INFO L226 Difference]: Without dead ends: 1503 [2021-10-21 20:22:11,152 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2021-10-21 20:22:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1247. [2021-10-21 20:22:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1245 states have (on average 1.691566265060241) internal successors, (2106), 1246 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2106 transitions. [2021-10-21 20:22:11,244 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2106 transitions. Word has length 64 [2021-10-21 20:22:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:11,244 INFO L470 AbstractCegarLoop]: Abstraction has 1247 states and 2106 transitions. [2021-10-21 20:22:11,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2106 transitions. [2021-10-21 20:22:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-21 20:22:11,247 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:11,247 INFO L512 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, 1, 1, 1, 1] [2021-10-21 20:22:11,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 20:22:11,248 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:11,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash -246111330, now seen corresponding path program 1 times [2021-10-21 20:22:11,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:11,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368126756] [2021-10-21 20:22:11,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:11,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 20:22:11,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:11,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368126756] [2021-10-21 20:22:11,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368126756] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:11,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:11,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:22:11,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863144081] [2021-10-21 20:22:11,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:22:11,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:11,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:22:11,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:11,304 INFO L87 Difference]: Start difference. First operand 1247 states and 2106 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:11,466 INFO L93 Difference]: Finished difference Result 3606 states and 6114 transitions. [2021-10-21 20:22:11,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:22:11,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-10-21 20:22:11,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:11,480 INFO L225 Difference]: With dead ends: 3606 [2021-10-21 20:22:11,480 INFO L226 Difference]: Without dead ends: 2401 [2021-10-21 20:22:11,484 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:22:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2021-10-21 20:22:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2145. [2021-10-21 20:22:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2143 states have (on average 1.7074195053663088) internal successors, (3659), 2144 states have internal predecessors, (3659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3659 transitions. [2021-10-21 20:22:11,671 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3659 transitions. Word has length 65 [2021-10-21 20:22:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:11,672 INFO L470 AbstractCegarLoop]: Abstraction has 2145 states and 3659 transitions. [2021-10-21 20:22:11,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:11,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3659 transitions. [2021-10-21 20:22:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-10-21 20:22:11,676 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:22:11,676 INFO L512 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, 1, 1, 1, 1, 1] [2021-10-21 20:22:11,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 20:22:11,676 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:22:11,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:22:11,678 INFO L82 PathProgramCache]: Analyzing trace with hash 283992071, now seen corresponding path program 1 times [2021-10-21 20:22:11,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:22:11,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295985040] [2021-10-21 20:22:11,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:22:11,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:22:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:22:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 20:22:11,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:22:11,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295985040] [2021-10-21 20:22:11,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295985040] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:22:11,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:22:11,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:22:11,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056117077] [2021-10-21 20:22:11,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:22:11,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:22:11,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:22:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:22:11,747 INFO L87 Difference]: Start difference. First operand 2145 states and 3659 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:22:11,912 INFO L93 Difference]: Finished difference Result 2225 states and 3778 transitions. [2021-10-21 20:22:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:22:11,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-10-21 20:22:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:22:11,913 INFO L225 Difference]: With dead ends: 2225 [2021-10-21 20:22:11,913 INFO L226 Difference]: Without dead ends: 0 [2021-10-21 20:22:11,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:22:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-21 20:22:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-21 20:22:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-21 20:22:11,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2021-10-21 20:22:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:22:11,916 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 20:22:11,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:22:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-21 20:22:11,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-21 20:22:11,920 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:22:11,920 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:22:11,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 20:22:11,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-21 20:22:11,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:12,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:12,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:12,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:12,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:12,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:12,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:13,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:13,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:13,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:13,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:13,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:13,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:13,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:14,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:15,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:16,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:17,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:17,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:17,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:17,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:17,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:22:25,996 INFO L857 garLoopResultBuilder]: For program point L828(lines 828 835) no Hoare annotation was computed. [2021-10-21 20:22:25,996 INFO L860 garLoopResultBuilder]: At program point L828-1(lines 828 835) the Hoare annotation is: true [2021-10-21 20:22:25,997 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2021-10-21 20:22:25,997 INFO L853 garLoopResultBuilder]: At program point L663(lines 658 666) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:25,997 INFO L853 garLoopResultBuilder]: At program point L1489(lines 1464 1491) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= |ULTIMATE.start_isReadable_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:25,997 INFO L860 garLoopResultBuilder]: At program point L1489-1(lines 1464 1491) the Hoare annotation is: true [2021-10-21 20:22:25,997 INFO L857 garLoopResultBuilder]: For program point L135(lines 135 141) no Hoare annotation was computed. [2021-10-21 20:22:25,998 INFO L857 garLoopResultBuilder]: For program point L2084(lines 2084 2090) no Hoare annotation was computed. [2021-10-21 20:22:25,998 INFO L857 garLoopResultBuilder]: For program point L135-2(lines 135 141) no Hoare annotation was computed. [2021-10-21 20:22:25,998 INFO L857 garLoopResultBuilder]: For program point L2084-1(lines 2084 2090) no Hoare annotation was computed. [2021-10-21 20:22:25,998 INFO L857 garLoopResultBuilder]: For program point L1424(lines 1424 1428) no Hoare annotation was computed. [2021-10-21 20:22:25,998 INFO L857 garLoopResultBuilder]: For program point L1391(lines 1391 1395) no Hoare annotation was computed. [2021-10-21 20:22:25,998 INFO L853 garLoopResultBuilder]: At program point L1325(lines 1315 1452) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:25,999 INFO L853 garLoopResultBuilder]: At program point L103(lines 1 2597) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2021-10-21 20:22:25,999 INFO L857 garLoopResultBuilder]: For program point L995(lines 995 999) no Hoare annotation was computed. [2021-10-21 20:22:25,999 INFO L853 garLoopResultBuilder]: At program point L995-2(lines 988 1003) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:25,999 INFO L857 garLoopResultBuilder]: For program point L995-3(lines 995 999) no Hoare annotation was computed. [2021-10-21 20:22:25,999 INFO L853 garLoopResultBuilder]: At program point L995-5(lines 988 1003) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ~rjh~0 2)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (= ULTIMATE.start_outgoing_~msg 1)) (.cse8 (= 2 ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (= ~__ste_email_to0~0 2) .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-10-21 20:22:26,000 INFO L857 garLoopResultBuilder]: For program point L995-6(lines 995 999) no Hoare annotation was computed. [2021-10-21 20:22:26,000 INFO L853 garLoopResultBuilder]: At program point L995-8(lines 988 1003) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,000 INFO L857 garLoopResultBuilder]: For program point L995-9(lines 995 999) no Hoare annotation was computed. [2021-10-21 20:22:26,000 INFO L853 garLoopResultBuilder]: At program point L995-11(lines 988 1003) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,000 INFO L857 garLoopResultBuilder]: For program point L995-12(lines 995 999) no Hoare annotation was computed. [2021-10-21 20:22:26,001 INFO L853 garLoopResultBuilder]: At program point L995-14(lines 988 1003) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,001 INFO L857 garLoopResultBuilder]: For program point L2515-1(lines 2515 2526) no Hoare annotation was computed. [2021-10-21 20:22:26,001 INFO L857 garLoopResultBuilder]: For program point L2515(lines 2515 2526) no Hoare annotation was computed. [2021-10-21 20:22:26,001 INFO L857 garLoopResultBuilder]: For program point L2582(lines 2582 2594) no Hoare annotation was computed. [2021-10-21 20:22:26,001 INFO L857 garLoopResultBuilder]: For program point L2582-2(lines 2582 2594) no Hoare annotation was computed. [2021-10-21 20:22:26,001 INFO L857 garLoopResultBuilder]: For program point L2582-4(lines 2582 2594) no Hoare annotation was computed. [2021-10-21 20:22:26,002 INFO L853 garLoopResultBuilder]: At program point L568(lines 1 2597) the Hoare annotation is: (and (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~client 1)) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1) (= 2 ULTIMATE.start_incoming_~client)) [2021-10-21 20:22:26,002 INFO L853 garLoopResultBuilder]: At program point L568-1(lines 1 2597) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,002 INFO L853 garLoopResultBuilder]: At program point L1361(lines 1351 1449) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:26,002 INFO L857 garLoopResultBuilder]: For program point L899(lines 899 910) no Hoare annotation was computed. [2021-10-21 20:22:26,002 INFO L857 garLoopResultBuilder]: For program point L899-1(lines 899 910) no Hoare annotation was computed. [2021-10-21 20:22:26,003 INFO L853 garLoopResultBuilder]: At program point L2089-1(lines 2072 2095) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,003 INFO L853 garLoopResultBuilder]: At program point L2089(lines 2072 2095) the Hoare annotation is: (and (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1) (= 2 ULTIMATE.start_incoming_~client)) [2021-10-21 20:22:26,003 INFO L857 garLoopResultBuilder]: For program point L2585(lines 2585 2593) no Hoare annotation was computed. [2021-10-21 20:22:26,003 INFO L857 garLoopResultBuilder]: For program point L2519-1(lines 2519 2525) no Hoare annotation was computed. [2021-10-21 20:22:26,003 INFO L857 garLoopResultBuilder]: For program point L2585-2(lines 2585 2593) no Hoare annotation was computed. [2021-10-21 20:22:26,003 INFO L857 garLoopResultBuilder]: For program point L2519(lines 2519 2525) no Hoare annotation was computed. [2021-10-21 20:22:26,004 INFO L857 garLoopResultBuilder]: For program point L2585-4(lines 2585 2593) no Hoare annotation was computed. [2021-10-21 20:22:26,004 INFO L857 garLoopResultBuilder]: For program point L1330(lines 1330 1337) no Hoare annotation was computed. [2021-10-21 20:22:26,004 INFO L853 garLoopResultBuilder]: At program point L1430(lines 1420 1443) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:26,004 INFO L853 garLoopResultBuilder]: At program point L1397(lines 1387 1446) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:26,004 INFO L860 garLoopResultBuilder]: At program point L836(lines 818 838) the Hoare annotation is: true [2021-10-21 20:22:26,005 INFO L853 garLoopResultBuilder]: At program point L1497(lines 1492 1500) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= |ULTIMATE.start_isReadable_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,005 INFO L853 garLoopResultBuilder]: At program point L1497-1(lines 1492 1500) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= |ULTIMATE.start_isReadable_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,005 INFO L853 garLoopResultBuilder]: At program point L1497-2(lines 1492 1500) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= |ULTIMATE.start_isReadable_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,005 INFO L860 garLoopResultBuilder]: At program point L1497-3(lines 1492 1500) the Hoare annotation is: true [2021-10-21 20:22:26,005 INFO L857 garLoopResultBuilder]: For program point L936(lines 936 947) no Hoare annotation was computed. [2021-10-21 20:22:26,006 INFO L857 garLoopResultBuilder]: For program point L903(lines 903 909) no Hoare annotation was computed. [2021-10-21 20:22:26,006 INFO L857 garLoopResultBuilder]: For program point L936-1(lines 936 947) no Hoare annotation was computed. [2021-10-21 20:22:26,006 INFO L857 garLoopResultBuilder]: For program point L936-2(lines 936 947) no Hoare annotation was computed. [2021-10-21 20:22:26,006 INFO L857 garLoopResultBuilder]: For program point L903-1(lines 903 909) no Hoare annotation was computed. [2021-10-21 20:22:26,006 INFO L857 garLoopResultBuilder]: For program point L936-3(lines 936 947) no Hoare annotation was computed. [2021-10-21 20:22:26,006 INFO L853 garLoopResultBuilder]: At program point L672(lines 667 675) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,007 INFO L857 garLoopResultBuilder]: For program point L2588(lines 2588 2592) no Hoare annotation was computed. [2021-10-21 20:22:26,007 INFO L853 garLoopResultBuilder]: At program point L2588-2(lines 1 2597) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2021-10-21 20:22:26,007 INFO L857 garLoopResultBuilder]: For program point L2588-3(lines 2588 2592) no Hoare annotation was computed. [2021-10-21 20:22:26,007 INFO L857 garLoopResultBuilder]: For program point L2588-6(lines 2588 2592) no Hoare annotation was computed. [2021-10-21 20:22:26,007 INFO L853 garLoopResultBuilder]: At program point L2588-5(lines 1 2597) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 2) (not (= ~__ste_email_to0~0 1)) (= ULTIMATE.start_setClientId_~handle 2)) [2021-10-21 20:22:26,007 INFO L857 garLoopResultBuilder]: For program point L1366(lines 1366 1370) no Hoare annotation was computed. [2021-10-21 20:22:26,008 INFO L853 garLoopResultBuilder]: At program point L2588-8(lines 1 2597) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 2) (not (= ~__ste_email_to0~0 1))) [2021-10-21 20:22:26,008 INFO L853 garLoopResultBuilder]: At program point L111(lines 106 114) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2021-10-21 20:22:26,008 INFO L857 garLoopResultBuilder]: For program point L772(lines 772 780) no Hoare annotation was computed. [2021-10-21 20:22:26,008 INFO L853 garLoopResultBuilder]: At program point L2524(lines 2507 2530) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= ~rjh~0 2)) (.cse5 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse6 (= ULTIMATE.start_outgoing_~msg 1))) (or (and (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_setEmailTo_~handle 1) .cse4 .cse5 .cse6))) [2021-10-21 20:22:26,008 INFO L853 garLoopResultBuilder]: At program point L2524-1(lines 2507 2530) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (not (= ~rjh~0 1))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start_createEmail_~to 1))) (.cse4 (= ULTIMATE.start_createEmail_~msg~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_getClientForwardReceiver_#res| 0)) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_createEmail_~to) .cse3 (= ~rjh~0 2) .cse4))) [2021-10-21 20:22:26,009 INFO L857 garLoopResultBuilder]: For program point L609(lines 609 616) no Hoare annotation was computed. [2021-10-21 20:22:26,009 INFO L853 garLoopResultBuilder]: At program point L609-1(lines 1 2597) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,009 INFO L857 garLoopResultBuilder]: For program point L2558(lines 2558 2574) no Hoare annotation was computed. [2021-10-21 20:22:26,009 INFO L857 garLoopResultBuilder]: For program point L609-2(lines 609 616) no Hoare annotation was computed. [2021-10-21 20:22:26,009 INFO L857 garLoopResultBuilder]: For program point L2558-1(lines 2558 2574) no Hoare annotation was computed. [2021-10-21 20:22:26,010 INFO L857 garLoopResultBuilder]: For program point L1435(lines 1435 1439) no Hoare annotation was computed. [2021-10-21 20:22:26,010 INFO L857 garLoopResultBuilder]: For program point L1402(lines 1402 1406) no Hoare annotation was computed. [2021-10-21 20:22:26,010 INFO L853 garLoopResultBuilder]: At program point L1435-1(lines 1307 1453) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:26,010 INFO L857 garLoopResultBuilder]: For program point L973(lines 973 984) no Hoare annotation was computed. [2021-10-21 20:22:26,010 INFO L857 garLoopResultBuilder]: For program point L940(lines 940 946) no Hoare annotation was computed. [2021-10-21 20:22:26,010 INFO L857 garLoopResultBuilder]: For program point L973-1(lines 973 984) no Hoare annotation was computed. [2021-10-21 20:22:26,011 INFO L857 garLoopResultBuilder]: For program point L940-1(lines 940 946) no Hoare annotation was computed. [2021-10-21 20:22:26,011 INFO L857 garLoopResultBuilder]: For program point L973-2(lines 973 984) no Hoare annotation was computed. [2021-10-21 20:22:26,011 INFO L857 garLoopResultBuilder]: For program point L940-2(lines 940 946) no Hoare annotation was computed. [2021-10-21 20:22:26,011 INFO L857 garLoopResultBuilder]: For program point L973-3(lines 973 984) no Hoare annotation was computed. [2021-10-21 20:22:26,011 INFO L857 garLoopResultBuilder]: For program point L940-3(lines 940 946) no Hoare annotation was computed. [2021-10-21 20:22:26,011 INFO L853 garLoopResultBuilder]: At program point L908(lines 895 913) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= |ULTIMATE.start_isReadable_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,012 INFO L860 garLoopResultBuilder]: At program point L908-1(lines 895 913) the Hoare annotation is: true [2021-10-21 20:22:26,012 INFO L853 garLoopResultBuilder]: At program point L1372(lines 1362 1448) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:26,012 INFO L853 garLoopResultBuilder]: At program point L1339(lines 1326 1451) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:26,012 INFO L857 garLoopResultBuilder]: For program point L2562(lines 2562 2573) no Hoare annotation was computed. [2021-10-21 20:22:26,012 INFO L857 garLoopResultBuilder]: For program point L2562-1(lines 2562 2573) no Hoare annotation was computed. [2021-10-21 20:22:26,012 INFO L857 garLoopResultBuilder]: For program point L2100(lines 2100 2112) no Hoare annotation was computed. [2021-10-21 20:22:26,013 INFO L857 garLoopResultBuilder]: For program point L977(lines 977 983) no Hoare annotation was computed. [2021-10-21 20:22:26,013 INFO L857 garLoopResultBuilder]: For program point L977-1(lines 977 983) no Hoare annotation was computed. [2021-10-21 20:22:26,013 INFO L857 garLoopResultBuilder]: For program point L977-2(lines 977 983) no Hoare annotation was computed. [2021-10-21 20:22:26,013 INFO L857 garLoopResultBuilder]: For program point L977-3(lines 977 983) no Hoare annotation was computed. [2021-10-21 20:22:26,013 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-21 20:22:26,013 INFO L857 garLoopResultBuilder]: For program point L1308(lines 1307 1453) no Hoare annotation was computed. [2021-10-21 20:22:26,014 INFO L853 garLoopResultBuilder]: At program point L945(lines 932 950) the Hoare annotation is: (and (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1) (= 2 ULTIMATE.start_incoming_~client)) [2021-10-21 20:22:26,014 INFO L853 garLoopResultBuilder]: At program point L945-1(lines 932 950) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= |ULTIMATE.start_isReadable_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,014 INFO L853 garLoopResultBuilder]: At program point L945-2(lines 932 950) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,014 INFO L860 garLoopResultBuilder]: At program point L945-3(lines 932 950) the Hoare annotation is: true [2021-10-21 20:22:26,014 INFO L853 garLoopResultBuilder]: At program point L681(lines 676 684) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,015 INFO L853 garLoopResultBuilder]: At program point L1408(lines 1398 1445) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:26,015 INFO L857 garLoopResultBuilder]: For program point L1309(lines 1309 1313) no Hoare annotation was computed. [2021-10-21 20:22:26,015 INFO L857 garLoopResultBuilder]: For program point L120(line 120) no Hoare annotation was computed. [2021-10-21 20:22:26,015 INFO L857 garLoopResultBuilder]: For program point L120-1(line 120) no Hoare annotation was computed. [2021-10-21 20:22:26,015 INFO L853 garLoopResultBuilder]: At program point L121(lines 127 144) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= |ULTIMATE.start_isReadable_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,015 INFO L860 garLoopResultBuilder]: At program point L121-1(lines 127 144) the Hoare annotation is: true [2021-10-21 20:22:26,016 INFO L857 garLoopResultBuilder]: For program point L2103(lines 2103 2111) no Hoare annotation was computed. [2021-10-21 20:22:26,016 INFO L853 garLoopResultBuilder]: At program point L815(lines 795 817) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 2) (not (= ~__ste_email_to0~0 1))) [2021-10-21 20:22:26,016 INFO L857 garLoopResultBuilder]: For program point L2566(lines 2566 2572) no Hoare annotation was computed. [2021-10-21 20:22:26,016 INFO L857 garLoopResultBuilder]: For program point L2566-1(lines 2566 2572) no Hoare annotation was computed. [2021-10-21 20:22:26,016 INFO L857 garLoopResultBuilder]: For program point L1377(lines 1377 1384) no Hoare annotation was computed. [2021-10-21 20:22:26,016 INFO L857 garLoopResultBuilder]: For program point L1344(lines 1344 1348) no Hoare annotation was computed. [2021-10-21 20:22:26,017 INFO L853 garLoopResultBuilder]: At program point L982(lines 969 987) the Hoare annotation is: (and (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getEmailTo_~handle 1) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,017 INFO L853 garLoopResultBuilder]: At program point L982-1(lines 969 987) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= |ULTIMATE.start_isReadable_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,017 INFO L853 garLoopResultBuilder]: At program point L982-2(lines 969 987) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,017 INFO L860 garLoopResultBuilder]: At program point L982-3(lines 969 987) the Hoare annotation is: true [2021-10-21 20:22:26,017 INFO L857 garLoopResultBuilder]: For program point L2535(lines 2535 2547) no Hoare annotation was computed. [2021-10-21 20:22:26,018 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-21 20:22:26,018 INFO L857 garLoopResultBuilder]: For program point L2106(lines 2106 2110) no Hoare annotation was computed. [2021-10-21 20:22:26,018 INFO L853 garLoopResultBuilder]: At program point L2106-2(lines 1 2597) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (not (= ~__ste_email_to0~0 1))) (.cse3 (= ULTIMATE.start_test_~op2~0 0)) (.cse4 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 (= ULTIMATE.start_test_~op1~0 1) .cse2 .cse3 .cse4) (and .cse0 .cse1 (= ULTIMATE.start_test_~op1~0 0) .cse2 .cse3 .cse4))) [2021-10-21 20:22:26,018 INFO L857 garLoopResultBuilder]: For program point L1413(lines 1413 1417) no Hoare annotation was computed. [2021-10-21 20:22:26,018 INFO L857 garLoopResultBuilder]: For program point L1315(lines 1315 1452) no Hoare annotation was computed. [2021-10-21 20:22:26,018 INFO L857 garLoopResultBuilder]: For program point L589(lines 589 595) no Hoare annotation was computed. [2021-10-21 20:22:26,019 INFO L853 garLoopResultBuilder]: At program point L589-1(lines 581 598) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ~rjh~0 2)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (= ULTIMATE.start_outgoing_~msg 1)) (.cse8 (= 2 ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (= ~__ste_email_to0~0 2) .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-10-21 20:22:26,019 INFO L857 garLoopResultBuilder]: For program point L2538(lines 2538 2546) no Hoare annotation was computed. [2021-10-21 20:22:26,019 INFO L853 garLoopResultBuilder]: At program point L2571-1(lines 2554 2577) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,019 INFO L857 garLoopResultBuilder]: For program point L589-2(lines 589 595) no Hoare annotation was computed. [2021-10-21 20:22:26,019 INFO L853 garLoopResultBuilder]: At program point L2571(lines 2554 2577) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,019 INFO L853 garLoopResultBuilder]: At program point L589-3(lines 581 598) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,020 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-21 20:22:26,020 INFO L857 garLoopResultBuilder]: For program point L2076(lines 2076 2092) no Hoare annotation was computed. [2021-10-21 20:22:26,020 INFO L857 garLoopResultBuilder]: For program point L2076-1(lines 2076 2092) no Hoare annotation was computed. [2021-10-21 20:22:26,020 INFO L853 garLoopResultBuilder]: At program point L1350(lines 1340 1450) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:26,020 INFO L857 garLoopResultBuilder]: For program point L955(lines 955 963) no Hoare annotation was computed. [2021-10-21 20:22:26,020 INFO L857 garLoopResultBuilder]: For program point L955-2(lines 955 963) no Hoare annotation was computed. [2021-10-21 20:22:26,021 INFO L857 garLoopResultBuilder]: For program point L955-4(lines 955 963) no Hoare annotation was computed. [2021-10-21 20:22:26,021 INFO L857 garLoopResultBuilder]: For program point L2541(lines 2541 2545) no Hoare annotation was computed. [2021-10-21 20:22:26,021 INFO L853 garLoopResultBuilder]: At program point L2541-2(lines 1 2597) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:26,021 INFO L857 garLoopResultBuilder]: For program point L1319(lines 1319 1323) no Hoare annotation was computed. [2021-10-21 20:22:26,021 INFO L853 garLoopResultBuilder]: At program point L1419(lines 1409 1444) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:26,022 INFO L853 garLoopResultBuilder]: At program point L1386(lines 1373 1447) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_test_~op1~0 1)) (.cse4 (= ULTIMATE.start_test_~op2~0 0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ~rjh~0 2)) (.cse2 (= ULTIMATE.start_test_~op1~0 0)) (.cse3 (not (= ~__ste_email_to0~0 1))) (.cse6 (not (= ULTIMATE.start_setClientAutoResponse_~handle 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6))) [2021-10-21 20:22:26,022 INFO L857 garLoopResultBuilder]: For program point L2080(lines 2080 2091) no Hoare annotation was computed. [2021-10-21 20:22:26,022 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-21 20:22:26,022 INFO L857 garLoopResultBuilder]: For program point L2080-1(lines 2080 2091) no Hoare annotation was computed. [2021-10-21 20:22:26,022 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2021-10-21 20:22:26,022 INFO L857 garLoopResultBuilder]: For program point L958(lines 958 962) no Hoare annotation was computed. [2021-10-21 20:22:26,023 INFO L853 garLoopResultBuilder]: At program point L958-2(lines 951 966) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (not (= ~__ste_email_to0~0 1)) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,023 INFO L857 garLoopResultBuilder]: For program point L958-3(lines 958 962) no Hoare annotation was computed. [2021-10-21 20:22:26,023 INFO L853 garLoopResultBuilder]: At program point L958-5(lines 951 966) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-10-21 20:22:26,023 INFO L857 garLoopResultBuilder]: For program point L958-6(lines 958 962) no Hoare annotation was computed. [2021-10-21 20:22:26,023 INFO L853 garLoopResultBuilder]: At program point L958-8(lines 951 966) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,023 INFO L857 garLoopResultBuilder]: For program point L2511-1(lines 2511 2527) no Hoare annotation was computed. [2021-10-21 20:22:26,024 INFO L853 garLoopResultBuilder]: At program point L1454(lines 1306 1455) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~rjh~0 2) (not (= ~__ste_email_to0~0 1))) [2021-10-21 20:22:26,024 INFO L857 garLoopResultBuilder]: For program point L2511(lines 2511 2527) no Hoare annotation was computed. [2021-10-21 20:22:26,024 INFO L857 garLoopResultBuilder]: For program point L1355(lines 1355 1359) no Hoare annotation was computed. [2021-10-21 20:22:26,024 INFO L857 garLoopResultBuilder]: For program point L992(lines 992 1000) no Hoare annotation was computed. [2021-10-21 20:22:26,024 INFO L857 garLoopResultBuilder]: For program point L992-2(lines 992 1000) no Hoare annotation was computed. [2021-10-21 20:22:26,024 INFO L857 garLoopResultBuilder]: For program point L992-4(lines 992 1000) no Hoare annotation was computed. [2021-10-21 20:22:26,025 INFO L857 garLoopResultBuilder]: For program point L992-6(lines 992 1000) no Hoare annotation was computed. [2021-10-21 20:22:26,025 INFO L857 garLoopResultBuilder]: For program point L992-8(lines 992 1000) no Hoare annotation was computed. [2021-10-21 20:22:26,025 INFO L853 garLoopResultBuilder]: At program point L1521(lines 1510 1524) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailTo_~value 2) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~rjh~0 2) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-10-21 20:22:26,029 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 20:22:26,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 08:22:26 BoogieIcfgContainer [2021-10-21 20:22:26,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 20:22:26,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 20:22:26,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 20:22:26,075 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 20:22:26,075 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:22:03" (3/4) ... [2021-10-21 20:22:26,078 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-21 20:22:26,108 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 84 nodes and edges [2021-10-21 20:22:26,110 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2021-10-21 20:22:26,112 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-21 20:22:26,114 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-21 20:22:26,117 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 20:22:26,119 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 20:22:26,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1 [2021-10-21 20:22:26,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1 [2021-10-21 20:22:26,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1 [2021-10-21 20:22:26,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1 [2021-10-21 20:22:26,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(client == 1)) && msg == 1) && msg == 1) && 2 == client [2021-10-21 20:22:26,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1) && 2 == client [2021-10-21 20:22:26,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1) && 2 == client) || (((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && rjh == 2) && msg == 1) && msg == 1) && 2 == client) [2021-10-21 20:22:26,153 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && rjh == 2) && msg == 1) && msg == 1) && 2 == client) || (((((((handle == 3 && handle == 1) && \result == 1) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1) [2021-10-21 20:22:26,153 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 [2021-10-21 20:22:26,153 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1) && 2 == client [2021-10-21 20:22:26,153 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && handle == 1) && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 [2021-10-21 20:22:26,154 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 [2021-10-21 20:22:26,154 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1) && 2 == client) || (((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && rjh == 2) && msg == 1) && msg == 1) && 2 == client) [2021-10-21 20:22:26,154 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 [2021-10-21 20:22:26,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && handle == 1) && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 [2021-10-21 20:22:26,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 [2021-10-21 20:22:26,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && handle == 1) && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 [2021-10-21 20:22:26,156 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-10-21 20:22:26,156 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && handle == 1) && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 [2021-10-21 20:22:26,156 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-10-21 20:22:26,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && handle == 1) && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 [2021-10-21 20:22:26,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-10-21 20:22:26,158 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 [2021-10-21 20:22:26,158 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-10-21 20:22:26,158 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 [2021-10-21 20:22:26,159 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-10-21 20:22:26,159 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 [2021-10-21 20:22:26,159 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-10-21 20:22:26,160 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && !(rjh == 1)) && \result == 1) && !(to == 1)) && msg == 1) && \result == 0) || ((((((handle == 3 && !(rjh == 1)) && \result == 1) && 2 == to) && !(to == 1)) && rjh == 2) && msg == 1) [2021-10-21 20:22:26,160 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-10-21 20:22:26,160 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-10-21 20:22:26,161 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-10-21 20:22:26,161 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-10-21 20:22:26,242 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 20:22:26,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 20:22:26,244 INFO L168 Benchmark]: Toolchain (without parser) took 24764.50 ms. Allocated memory was 121.6 MB in the beginning and 364.9 MB in the end (delta: 243.3 MB). Free memory was 77.6 MB in the beginning and 150.5 MB in the end (delta: -73.0 MB). Peak memory consumption was 170.4 MB. Max. memory is 16.1 GB. [2021-10-21 20:22:26,244 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 121.6 MB. Free memory is still 96.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:22:26,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.59 ms. Allocated memory is still 121.6 MB. Free memory was 77.4 MB in the beginning and 71.4 MB in the end (delta: 6.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-21 20:22:26,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.99 ms. Allocated memory is still 121.6 MB. Free memory was 71.4 MB in the beginning and 65.7 MB in the end (delta: 5.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 20:22:26,246 INFO L168 Benchmark]: Boogie Preprocessor took 52.33 ms. Allocated memory is still 121.6 MB. Free memory was 65.7 MB in the beginning and 62.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 20:22:26,246 INFO L168 Benchmark]: RCFGBuilder took 1371.58 ms. Allocated memory was 121.6 MB in the beginning and 167.8 MB in the end (delta: 46.1 MB). Free memory was 61.9 MB in the beginning and 92.5 MB in the end (delta: -30.6 MB). Peak memory consumption was 35.0 MB. Max. memory is 16.1 GB. [2021-10-21 20:22:26,246 INFO L168 Benchmark]: TraceAbstraction took 22147.51 ms. Allocated memory was 167.8 MB in the beginning and 364.9 MB in the end (delta: 197.1 MB). Free memory was 92.5 MB in the beginning and 169.4 MB in the end (delta: -76.9 MB). Peak memory consumption was 180.9 MB. Max. memory is 16.1 GB. [2021-10-21 20:22:26,247 INFO L168 Benchmark]: Witness Printer took 167.99 ms. Allocated memory is still 364.9 MB. Free memory was 169.4 MB in the beginning and 150.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-21 20:22:26,249 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.25 ms. Allocated memory is still 121.6 MB. Free memory is still 96.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 888.59 ms. Allocated memory is still 121.6 MB. Free memory was 77.4 MB in the beginning and 71.4 MB in the end (delta: 6.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 127.99 ms. Allocated memory is still 121.6 MB. Free memory was 71.4 MB in the beginning and 65.7 MB in the end (delta: 5.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.33 ms. Allocated memory is still 121.6 MB. Free memory was 65.7 MB in the beginning and 62.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1371.58 ms. Allocated memory was 121.6 MB in the beginning and 167.8 MB in the end (delta: 46.1 MB). Free memory was 61.9 MB in the beginning and 92.5 MB in the end (delta: -30.6 MB). Peak memory consumption was 35.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22147.51 ms. Allocated memory was 167.8 MB in the beginning and 364.9 MB in the end (delta: 197.1 MB). Free memory was 92.5 MB in the beginning and 169.4 MB in the end (delta: -76.9 MB). Peak memory consumption was 180.9 MB. Max. memory is 16.1 GB. * Witness Printer took 167.99 ms. Allocated memory is still 364.9 MB. Free memory was 169.4 MB in the beginning and 150.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 120]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 120]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 162 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 22021.3ms, OverallIterations: 19, TraceHistogramMax: 3, EmptinessCheckTime: 58.5ms, AutomataDifference: 4045.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 14074.7ms, InitialAbstractionConstructionTime: 18.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5580 SDtfs, 8956 SDslu, 10022 SDs, 0 SdLazy, 881 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1176.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1029.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2145occurred in iteration=18, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 889.7ms AutomataMinimizationTime, 19 MinimizatonAttempts, 3463 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 63 LocationsWithAnnotation, 63 PreInvPairs, 1047 NumberOfFragments, 1938 HoareAnnotationTreeSize, 63 FomulaSimplifications, 443043999 FormulaSimplificationTreeSizeReduction, 5351.9ms HoareSimplificationTime, 63 FomulaSimplificationsInter, 719483 FormulaSimplificationTreeSizeReductionInter, 8695.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 201.2ms SsaConstructionTime, 626.9ms SatisfiabilityAnalysisTime, 1399.4ms InterpolantComputationTime, 1067 NumberOfCodeBlocks, 1067 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1047 ConstructedInterpolants, 0 QuantifiedInterpolants, 1715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 764 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 113/117 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 895]: Loop Invariant Derived loop invariant: (((((((handle == 3 && handle == 1) && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 969]: Loop Invariant Derived loop invariant: (((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 2507]: Loop Invariant Derived loop invariant: ((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && rjh == 2) && msg == 1) && msg == 1) && 2 == client) || (((((((handle == 3 && handle == 1) && \result == 1) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1) - InvariantResult [Line: 2072]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 795]: Loop Invariant Derived loop invariant: ((handle == 3 && __ste_client_forwardReceiver1 == 0) && rjh == 2) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1306]: Loop Invariant Derived loop invariant: (handle == 3 && rjh == 2) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1398]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 2554]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 969]: Loop Invariant Derived loop invariant: ((((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 818]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2507]: Loop Invariant Derived loop invariant: (((((handle == 3 && !(rjh == 1)) && \result == 1) && !(to == 1)) && msg == 1) && \result == 0) || ((((((handle == 3 && !(rjh == 1)) && \result == 1) && 2 == to) && !(to == 1)) && rjh == 2) && msg == 1) - InvariantResult [Line: 658]: Loop Invariant Derived loop invariant: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 1362]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 1420]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1326]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 951]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == to) && rjh == 2) && !(__ste_email_to0 == 1)) && msg == 1 - InvariantResult [Line: 2072]: Loop Invariant Derived loop invariant: ((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1) && 2 == client - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((handle == 3 && handle == 1) && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: (((((handle == 3 && handle == 1) && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 1492]: Loop Invariant Derived loop invariant: ((((((handle == 3 && handle == 1) && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: ((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1) && 2 == client - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 1307]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1) && 2 == client) || (((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && rjh == 2) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0) && !(handle == 1)) || (((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) && !(handle == 1)) - InvariantResult [Line: 895]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 828]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2554]: Loop Invariant Derived loop invariant: (((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 1373]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 1492]: Loop Invariant Derived loop invariant: ((((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 1340]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: (((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1) && 2 == client) || (((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && rjh == 2) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 667]: Loop Invariant Derived loop invariant: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 1464]: Loop Invariant Derived loop invariant: ((((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1409]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((__ste_client_forwardReceiver1 == 0 && rjh == 2) && !(__ste_email_to0 == 1)) && handle == 2 - InvariantResult [Line: 951]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 1492]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 951]: Loop Invariant Derived loop invariant: (((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 969]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: (((((handle == 3 && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1 - InvariantResult [Line: 1510]: Loop Invariant Derived loop invariant: ((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && msg == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: (((((((handle == 3 && handle == 1) && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 1492]: Loop Invariant Derived loop invariant: ((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 969]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((handle == 3 && __ste_client_forwardReceiver1 == 0) && rjh == 2) && !(__ste_email_to0 == 1) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 1464]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1387]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 1315]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 1351]: Loop Invariant Derived loop invariant: ((((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && op2 == 0) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && !(handle == 1))) || ((((handle == 3 && rjh == 2) && op1 == 1) && !(__ste_email_to0 == 1)) && op2 == 0)) || ((((handle == 3 && rjh == 2) && op1 == 0) && !(__ste_email_to0 == 1)) && !(handle == 1)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && rjh == 2) && !(client == 1)) && msg == 1) && msg == 1) && 2 == client RESULT: Ultimate proved your program to be correct! [2021-10-21 20:22:26,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9d0baf3-b552-481d-b59e-82f5c1a4bb70/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...