./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 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec0_product10.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6176b82523031a539fb61f992e9d4a2cb26367e3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 08:30:44,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 08:30:44,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 08:30:44,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 08:30:44,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 08:30:44,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 08:30:44,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 08:30:44,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 08:30:44,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 08:30:44,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 08:30:44,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 08:30:44,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 08:30:44,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 08:30:44,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 08:30:44,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 08:30:44,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 08:30:44,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 08:30:44,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 08:30:44,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 08:30:44,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 08:30:44,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 08:30:44,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 08:30:44,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 08:30:44,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 08:30:44,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 08:30:44,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 08:30:44,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 08:30:44,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 08:30:44,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 08:30:44,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 08:30:44,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 08:30:44,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 08:30:44,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 08:30:44,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 08:30:44,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 08:30:44,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 08:30:44,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 08:30:44,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 08:30:44,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 08:30:44,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 08:30:44,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 08:30:44,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 08:30:44,596 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 08:30:44,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 08:30:44,598 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 08:30:44,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 08:30:44,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 08:30:44,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 08:30:44,600 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 08:30:44,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 08:30:44,600 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 08:30:44,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 08:30:44,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 08:30:44,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 08:30:44,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 08:30:44,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 08:30:44,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 08:30:44,602 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 08:30:44,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 08:30:44,602 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 08:30:44,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 08:30:44,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 08:30:44,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 08:30:44,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 08:30:44,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:30:44,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 08:30:44,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 08:30:44,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 08:30:44,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 08:30:44,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 08:30:44,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 08:30:44,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 08:30:44,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6176b82523031a539fb61f992e9d4a2cb26367e3 [2021-08-26 08:30:44,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 08:30:44,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 08:30:44,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 08:30:44,873 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 08:30:44,874 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 08:30:44,875 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product10.cil.c [2021-08-26 08:30:44,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fabc97f8/c95968f46d354083af1eeb601e8c1c82/FLAGe3bf5bb72 [2021-08-26 08:30:45,390 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 08:30:45,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product10.cil.c [2021-08-26 08:30:45,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fabc97f8/c95968f46d354083af1eeb601e8c1c82/FLAGe3bf5bb72 [2021-08-26 08:30:45,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fabc97f8/c95968f46d354083af1eeb601e8c1c82 [2021-08-26 08:30:45,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 08:30:45,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 08:30:45,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 08:30:45,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 08:30:45,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 08:30:45,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:30:45" (1/1) ... [2021-08-26 08:30:45,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdc502e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:45, skipping insertion in model container [2021-08-26 08:30:45,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:30:45" (1/1) ... [2021-08-26 08:30:45,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 08:30:45,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 08:30:45,889 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product10.cil.c[2518,2531] [2021-08-26 08:30:46,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:30:46,161 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 08:30:46,177 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product10.cil.c[2518,2531] [2021-08-26 08:30:46,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:30:46,288 INFO L208 MainTranslator]: Completed translation [2021-08-26 08:30:46,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46 WrapperNode [2021-08-26 08:30:46,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 08:30:46,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 08:30:46,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 08:30:46,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 08:30:46,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46" (1/1) ... [2021-08-26 08:30:46,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46" (1/1) ... [2021-08-26 08:30:46,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 08:30:46,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 08:30:46,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 08:30:46,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 08:30:46,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46" (1/1) ... [2021-08-26 08:30:46,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46" (1/1) ... [2021-08-26 08:30:46,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46" (1/1) ... [2021-08-26 08:30:46,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46" (1/1) ... [2021-08-26 08:30:46,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46" (1/1) ... [2021-08-26 08:30:46,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46" (1/1) ... [2021-08-26 08:30:46,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46" (1/1) ... [2021-08-26 08:30:46,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 08:30:46,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 08:30:46,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 08:30:46,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 08:30:46,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46" (1/1) ... [2021-08-26 08:30:46,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:30:46,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:30:46,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 08:30:46,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 08:30:46,507 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2021-08-26 08:30:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 08:30:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 08:30:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 08:30:46,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 08:30:47,621 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 08:30:47,622 INFO L299 CfgBuilder]: Removed 155 assume(true) statements. [2021-08-26 08:30:47,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:30:47 BoogieIcfgContainer [2021-08-26 08:30:47,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 08:30:47,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 08:30:47,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 08:30:47,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 08:30:47,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:30:45" (1/3) ... [2021-08-26 08:30:47,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334e4583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:30:47, skipping insertion in model container [2021-08-26 08:30:47,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:46" (2/3) ... [2021-08-26 08:30:47,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334e4583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:30:47, skipping insertion in model container [2021-08-26 08:30:47,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:30:47" (3/3) ... [2021-08-26 08:30:47,629 INFO L111 eAbstractionObserver]: Analyzing ICFG email_spec0_product10.cil.c [2021-08-26 08:30:47,633 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 08:30:47,633 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 08:30:47,687 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 08:30:47,694 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, mConcurrency=FINITE_AUTOMATA, 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-08-26 08:30:47,694 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-26 08:30:47,708 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-08-26 08:30:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-26 08:30:47,712 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:47,713 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-08-26 08:30:47,713 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:47,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:47,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1170669752, now seen corresponding path program 1 times [2021-08-26 08:30:47,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:47,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970151579] [2021-08-26 08:30:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:47,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:47,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:47,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970151579] [2021-08-26 08:30:47,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970151579] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:47,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:47,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 08:30:47,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128306734] [2021-08-26 08:30:47,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 08:30:47,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:47,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 08:30:47,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 08:30:47,924 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-08-26 08:30:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:47,943 INFO L93 Difference]: Finished difference Result 273 states and 434 transitions. [2021-08-26 08:30:47,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 08:30:47,944 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-08-26 08:30:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:47,951 INFO L225 Difference]: With dead ends: 273 [2021-08-26 08:30:47,951 INFO L226 Difference]: Without dead ends: 146 [2021-08-26 08:30:47,953 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-08-26 08:30:47,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-08-26 08:30:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-08-26 08:30:47,981 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-08-26 08:30:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 234 transitions. [2021-08-26 08:30:47,983 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 234 transitions. Word has length 38 [2021-08-26 08:30:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:47,983 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 234 transitions. [2021-08-26 08:30:47,983 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-08-26 08:30:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 234 transitions. [2021-08-26 08:30:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 08:30:47,984 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:47,985 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-08-26 08:30:47,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 08:30:47,985 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:47,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1521803372, now seen corresponding path program 1 times [2021-08-26 08:30:47,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:47,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943486052] [2021-08-26 08:30:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:47,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:48,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:48,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943486052] [2021-08-26 08:30:48,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943486052] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:48,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:48,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:48,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194223740] [2021-08-26 08:30:48,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:48,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:48,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:48,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:48,061 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-08-26 08:30:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:48,118 INFO L93 Difference]: Finished difference Result 411 states and 660 transitions. [2021-08-26 08:30:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:48,119 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-08-26 08:30:48,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:48,121 INFO L225 Difference]: With dead ends: 411 [2021-08-26 08:30:48,121 INFO L226 Difference]: Without dead ends: 276 [2021-08-26 08:30:48,122 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:48,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-08-26 08:30:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 145. [2021-08-26 08:30:48,131 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-08-26 08:30:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 230 transitions. [2021-08-26 08:30:48,132 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 230 transitions. Word has length 39 [2021-08-26 08:30:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:48,132 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 230 transitions. [2021-08-26 08:30:48,132 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-08-26 08:30:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 230 transitions. [2021-08-26 08:30:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-26 08:30:48,133 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:48,133 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-08-26 08:30:48,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 08:30:48,134 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:48,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:48,134 INFO L82 PathProgramCache]: Analyzing trace with hash 964876999, now seen corresponding path program 1 times [2021-08-26 08:30:48,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:48,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630079142] [2021-08-26 08:30:48,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:48,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:48,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:48,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630079142] [2021-08-26 08:30:48,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630079142] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:48,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:48,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:48,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818219278] [2021-08-26 08:30:48,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:48,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:48,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:48,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:48,189 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-08-26 08:30:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:48,218 INFO L93 Difference]: Finished difference Result 276 states and 440 transitions. [2021-08-26 08:30:48,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:48,219 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-08-26 08:30:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:48,220 INFO L225 Difference]: With dead ends: 276 [2021-08-26 08:30:48,220 INFO L226 Difference]: Without dead ends: 146 [2021-08-26 08:30:48,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-08-26 08:30:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2021-08-26 08:30:48,227 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-08-26 08:30:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 227 transitions. [2021-08-26 08:30:48,228 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 227 transitions. Word has length 40 [2021-08-26 08:30:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:48,228 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 227 transitions. [2021-08-26 08:30:48,228 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-08-26 08:30:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 227 transitions. [2021-08-26 08:30:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-26 08:30:48,229 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:48,229 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-08-26 08:30:48,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 08:30:48,230 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash -559359774, now seen corresponding path program 1 times [2021-08-26 08:30:48,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:48,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772234066] [2021-08-26 08:30:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:48,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:48,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:48,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772234066] [2021-08-26 08:30:48,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772234066] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:48,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:48,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:48,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72514385] [2021-08-26 08:30:48,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:48,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:48,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:48,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:48,286 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-08-26 08:30:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:48,298 INFO L93 Difference]: Finished difference Result 243 states and 376 transitions. [2021-08-26 08:30:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:48,298 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-08-26 08:30:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:48,299 INFO L225 Difference]: With dead ends: 243 [2021-08-26 08:30:48,299 INFO L226 Difference]: Without dead ends: 148 [2021-08-26 08:30:48,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-08-26 08:30:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2021-08-26 08:30:48,307 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-08-26 08:30:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 229 transitions. [2021-08-26 08:30:48,308 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 229 transitions. Word has length 42 [2021-08-26 08:30:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:48,308 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 229 transitions. [2021-08-26 08:30:48,308 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-08-26 08:30:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 229 transitions. [2021-08-26 08:30:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-26 08:30:48,310 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:48,310 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-08-26 08:30:48,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 08:30:48,310 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:48,311 INFO L82 PathProgramCache]: Analyzing trace with hash 499910929, now seen corresponding path program 1 times [2021-08-26 08:30:48,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:48,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72864089] [2021-08-26 08:30:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:48,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:48,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:48,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72864089] [2021-08-26 08:30:48,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72864089] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:30:48,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585633026] [2021-08-26 08:30:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:48,421 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:30:48,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:30:48,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:30:48,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 08:30:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:48,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 08:30:48,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:30:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:49,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585633026] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:30:49,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:30:49,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-26 08:30:49,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783863618] [2021-08-26 08:30:49,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:49,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:49,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:49,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:49,027 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-08-26 08:30:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:49,062 INFO L93 Difference]: Finished difference Result 371 states and 582 transitions. [2021-08-26 08:30:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 08:30:49,063 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-08-26 08:30:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:49,064 INFO L225 Difference]: With dead ends: 371 [2021-08-26 08:30:49,064 INFO L226 Difference]: Without dead ends: 276 [2021-08-26 08:30:49,065 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-08-26 08:30:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 180. [2021-08-26 08:30:49,071 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-08-26 08:30:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2021-08-26 08:30:49,072 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 47 [2021-08-26 08:30:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:49,072 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2021-08-26 08:30:49,072 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-08-26 08:30:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2021-08-26 08:30:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-26 08:30:49,073 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:49,074 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-08-26 08:30:49,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-26 08:30:49,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:30:49,289 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:49,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:49,289 INFO L82 PathProgramCache]: Analyzing trace with hash 358260290, now seen corresponding path program 2 times [2021-08-26 08:30:49,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:49,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559611207] [2021-08-26 08:30:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:49,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:30:49,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:49,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559611207] [2021-08-26 08:30:49,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559611207] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:49,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:49,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:49,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894123165] [2021-08-26 08:30:49,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:49,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:49,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:49,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:49,325 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-08-26 08:30:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:49,338 INFO L93 Difference]: Finished difference Result 437 states and 704 transitions. [2021-08-26 08:30:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:49,340 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-08-26 08:30:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:49,341 INFO L225 Difference]: With dead ends: 437 [2021-08-26 08:30:49,341 INFO L226 Difference]: Without dead ends: 309 [2021-08-26 08:30:49,342 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-26 08:30:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 214. [2021-08-26 08:30:49,349 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-08-26 08:30:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 351 transitions. [2021-08-26 08:30:49,350 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 351 transitions. Word has length 52 [2021-08-26 08:30:49,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:49,350 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 351 transitions. [2021-08-26 08:30:49,351 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-08-26 08:30:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 351 transitions. [2021-08-26 08:30:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-26 08:30:49,351 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:49,352 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-08-26 08:30:49,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 08:30:49,352 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:49,353 INFO L82 PathProgramCache]: Analyzing trace with hash 928867361, now seen corresponding path program 1 times [2021-08-26 08:30:49,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:49,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197248283] [2021-08-26 08:30:49,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:49,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-26 08:30:49,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:49,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197248283] [2021-08-26 08:30:49,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197248283] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:49,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:49,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:49,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129051028] [2021-08-26 08:30:49,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:49,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:49,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:49,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:49,385 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-08-26 08:30:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:49,398 INFO L93 Difference]: Finished difference Result 499 states and 818 transitions. [2021-08-26 08:30:49,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:49,399 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-08-26 08:30:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:49,400 INFO L225 Difference]: With dead ends: 499 [2021-08-26 08:30:49,400 INFO L226 Difference]: Without dead ends: 309 [2021-08-26 08:30:49,401 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:49,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-26 08:30:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 214. [2021-08-26 08:30:49,406 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-08-26 08:30:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 349 transitions. [2021-08-26 08:30:49,407 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 349 transitions. Word has length 54 [2021-08-26 08:30:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:49,407 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 349 transitions. [2021-08-26 08:30:49,407 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-08-26 08:30:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 349 transitions. [2021-08-26 08:30:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-26 08:30:49,408 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:49,408 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-08-26 08:30:49,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 08:30:49,408 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash 663544003, now seen corresponding path program 2 times [2021-08-26 08:30:49,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:49,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518904985] [2021-08-26 08:30:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:49,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 08:30:49,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:49,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518904985] [2021-08-26 08:30:49,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518904985] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:49,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:49,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:49,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316113903] [2021-08-26 08:30:49,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:49,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:49,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:49,457 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-08-26 08:30:49,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:49,471 INFO L93 Difference]: Finished difference Result 550 states and 908 transitions. [2021-08-26 08:30:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:49,472 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-08-26 08:30:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:49,474 INFO L225 Difference]: With dead ends: 550 [2021-08-26 08:30:49,474 INFO L226 Difference]: Without dead ends: 366 [2021-08-26 08:30:49,474 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:49,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-08-26 08:30:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 271. [2021-08-26 08:30:49,484 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-08-26 08:30:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 450 transitions. [2021-08-26 08:30:49,485 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 450 transitions. Word has length 54 [2021-08-26 08:30:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:49,485 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 450 transitions. [2021-08-26 08:30:49,485 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-08-26 08:30:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 450 transitions. [2021-08-26 08:30:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-26 08:30:49,486 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:49,486 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-08-26 08:30:49,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 08:30:49,486 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:49,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:49,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2045513071, now seen corresponding path program 1 times [2021-08-26 08:30:49,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:49,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177126727] [2021-08-26 08:30:49,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:49,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 08:30:49,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:49,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177126727] [2021-08-26 08:30:49,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177126727] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:49,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:49,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:30:49,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718823089] [2021-08-26 08:30:49,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:49,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:49,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:49,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:49,526 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-08-26 08:30:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:49,622 INFO L93 Difference]: Finished difference Result 641 states and 1067 transitions. [2021-08-26 08:30:49,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 08:30:49,623 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-08-26 08:30:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:49,624 INFO L225 Difference]: With dead ends: 641 [2021-08-26 08:30:49,625 INFO L226 Difference]: Without dead ends: 423 [2021-08-26 08:30:49,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 08:30:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-08-26 08:30:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 271. [2021-08-26 08:30:49,633 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-08-26 08:30:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 447 transitions. [2021-08-26 08:30:49,634 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 447 transitions. Word has length 55 [2021-08-26 08:30:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:49,634 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 447 transitions. [2021-08-26 08:30:49,635 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-08-26 08:30:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 447 transitions. [2021-08-26 08:30:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-26 08:30:49,635 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:49,635 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-08-26 08:30:49,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 08:30:49,636 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:49,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash -626013561, now seen corresponding path program 1 times [2021-08-26 08:30:49,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:49,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701035151] [2021-08-26 08:30:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:49,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 08:30:49,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:49,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701035151] [2021-08-26 08:30:49,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701035151] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:49,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:49,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 08:30:49,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644955776] [2021-08-26 08:30:49,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 08:30:49,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:49,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 08:30:49,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-08-26 08:30:49,714 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-08-26 08:30:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:50,285 INFO L93 Difference]: Finished difference Result 894 states and 1355 transitions. [2021-08-26 08:30:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-26 08:30:50,286 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-08-26 08:30:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:50,288 INFO L225 Difference]: With dead ends: 894 [2021-08-26 08:30:50,289 INFO L226 Difference]: Without dead ends: 821 [2021-08-26 08:30:50,289 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 251.1ms TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2021-08-26 08:30:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-08-26 08:30:50,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 314. [2021-08-26 08:30:50,303 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-08-26 08:30:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 509 transitions. [2021-08-26 08:30:50,303 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 509 transitions. Word has length 55 [2021-08-26 08:30:50,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:50,304 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 509 transitions. [2021-08-26 08:30:50,304 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-08-26 08:30:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 509 transitions. [2021-08-26 08:30:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-26 08:30:50,305 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:50,305 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-08-26 08:30:50,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 08:30:50,305 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:50,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:50,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1977535086, now seen corresponding path program 1 times [2021-08-26 08:30:50,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:50,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494641946] [2021-08-26 08:30:50,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:50,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 08:30:50,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:50,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494641946] [2021-08-26 08:30:50,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494641946] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:50,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:50,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 08:30:50,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825905128] [2021-08-26 08:30:50,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 08:30:50,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:50,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 08:30:50,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-08-26 08:30:50,387 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-08-26 08:30:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:50,934 INFO L93 Difference]: Finished difference Result 929 states and 1399 transitions. [2021-08-26 08:30:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-26 08:30:50,935 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-08-26 08:30:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:50,938 INFO L225 Difference]: With dead ends: 929 [2021-08-26 08:30:50,938 INFO L226 Difference]: Without dead ends: 833 [2021-08-26 08:30:50,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 246.3ms TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2021-08-26 08:30:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-08-26 08:30:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 341. [2021-08-26 08:30:50,954 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-08-26 08:30:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 550 transitions. [2021-08-26 08:30:50,955 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 550 transitions. Word has length 56 [2021-08-26 08:30:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:50,955 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 550 transitions. [2021-08-26 08:30:50,955 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-08-26 08:30:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 550 transitions. [2021-08-26 08:30:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-26 08:30:50,956 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:50,956 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-08-26 08:30:50,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 08:30:50,956 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:50,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1899401231, now seen corresponding path program 1 times [2021-08-26 08:30:50,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:50,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810565275] [2021-08-26 08:30:50,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:50,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 08:30:51,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:51,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810565275] [2021-08-26 08:30:51,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810565275] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:51,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:51,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 08:30:51,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056543403] [2021-08-26 08:30:51,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 08:30:51,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:51,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 08:30:51,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 08:30:51,002 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-08-26 08:30:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:51,067 INFO L93 Difference]: Finished difference Result 542 states and 842 transitions. [2021-08-26 08:30:51,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 08:30:51,068 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-08-26 08:30:51,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:51,071 INFO L225 Difference]: With dead ends: 542 [2021-08-26 08:30:51,071 INFO L226 Difference]: Without dead ends: 393 [2021-08-26 08:30:51,072 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 29.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-08-26 08:30:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-08-26 08:30:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 322. [2021-08-26 08:30:51,086 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-08-26 08:30:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 519 transitions. [2021-08-26 08:30:51,087 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 519 transitions. Word has length 56 [2021-08-26 08:30:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:51,088 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 519 transitions. [2021-08-26 08:30:51,088 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-08-26 08:30:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2021-08-26 08:30:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-26 08:30:51,090 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:51,090 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-08-26 08:30:51,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 08:30:51,091 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:51,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1757108711, now seen corresponding path program 1 times [2021-08-26 08:30:51,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:51,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873633922] [2021-08-26 08:30:51,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:51,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 08:30:51,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:51,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873633922] [2021-08-26 08:30:51,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873633922] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:51,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:51,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 08:30:51,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020791628] [2021-08-26 08:30:51,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:51,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:51,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:51,148 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-08-26 08:30:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:51,245 INFO L93 Difference]: Finished difference Result 875 states and 1376 transitions. [2021-08-26 08:30:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 08:30:51,245 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-08-26 08:30:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:51,247 INFO L225 Difference]: With dead ends: 875 [2021-08-26 08:30:51,247 INFO L226 Difference]: Without dead ends: 767 [2021-08-26 08:30:51,248 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 20.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:30:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2021-08-26 08:30:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 587. [2021-08-26 08:30:51,276 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-08-26 08:30:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 950 transitions. [2021-08-26 08:30:51,278 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 950 transitions. Word has length 57 [2021-08-26 08:30:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:51,278 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 950 transitions. [2021-08-26 08:30:51,278 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-08-26 08:30:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 950 transitions. [2021-08-26 08:30:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-26 08:30:51,281 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:51,281 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-08-26 08:30:51,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 08:30:51,282 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash 905258701, now seen corresponding path program 1 times [2021-08-26 08:30:51,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:51,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210483803] [2021-08-26 08:30:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:51,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 08:30:51,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:51,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210483803] [2021-08-26 08:30:51,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210483803] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:51,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:51,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 08:30:51,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135838476] [2021-08-26 08:30:51,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 08:30:51,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 08:30:51,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:30:51,365 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-08-26 08:30:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:51,839 INFO L93 Difference]: Finished difference Result 1594 states and 2408 transitions. [2021-08-26 08:30:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-26 08:30:51,839 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-08-26 08:30:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:51,843 INFO L225 Difference]: With dead ends: 1594 [2021-08-26 08:30:51,843 INFO L226 Difference]: Without dead ends: 1345 [2021-08-26 08:30:51,844 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 168.7ms TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2021-08-26 08:30:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2021-08-26 08:30:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 710. [2021-08-26 08:30:51,884 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-08-26 08:30:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1125 transitions. [2021-08-26 08:30:51,887 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1125 transitions. Word has length 58 [2021-08-26 08:30:51,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:51,887 INFO L470 AbstractCegarLoop]: Abstraction has 710 states and 1125 transitions. [2021-08-26 08:30:51,887 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-08-26 08:30:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1125 transitions. [2021-08-26 08:30:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-26 08:30:51,889 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:51,889 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-08-26 08:30:51,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 08:30:51,889 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:51,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1393067954, now seen corresponding path program 1 times [2021-08-26 08:30:51,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:51,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376525026] [2021-08-26 08:30:51,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:51,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 08:30:51,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:51,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376525026] [2021-08-26 08:30:51,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376525026] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:51,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:51,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 08:30:51,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598165071] [2021-08-26 08:30:51,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 08:30:51,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 08:30:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 08:30:51,927 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-08-26 08:30:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:51,998 INFO L93 Difference]: Finished difference Result 977 states and 1504 transitions. [2021-08-26 08:30:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 08:30:51,999 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-08-26 08:30:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:52,001 INFO L225 Difference]: With dead ends: 977 [2021-08-26 08:30:52,001 INFO L226 Difference]: Without dead ends: 699 [2021-08-26 08:30:52,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-08-26 08:30:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 555. [2021-08-26 08:30:52,027 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-08-26 08:30:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 892 transitions. [2021-08-26 08:30:52,028 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 892 transitions. Word has length 59 [2021-08-26 08:30:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:52,028 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 892 transitions. [2021-08-26 08:30:52,028 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-08-26 08:30:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 892 transitions. [2021-08-26 08:30:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-26 08:30:52,029 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:52,030 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-08-26 08:30:52,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 08:30:52,030 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash 596644252, now seen corresponding path program 1 times [2021-08-26 08:30:52,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:52,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686193509] [2021-08-26 08:30:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:52,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 08:30:52,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:52,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686193509] [2021-08-26 08:30:52,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686193509] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:52,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:52,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:52,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715033884] [2021-08-26 08:30:52,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:52,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:52,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,062 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-08-26 08:30:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:52,124 INFO L93 Difference]: Finished difference Result 1566 states and 2532 transitions. [2021-08-26 08:30:52,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:52,124 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-08-26 08:30:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:52,127 INFO L225 Difference]: With dead ends: 1566 [2021-08-26 08:30:52,127 INFO L226 Difference]: Without dead ends: 1045 [2021-08-26 08:30:52,128 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-08-26 08:30:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 789. [2021-08-26 08:30:52,175 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-08-26 08:30:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1305 transitions. [2021-08-26 08:30:52,178 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1305 transitions. Word has length 63 [2021-08-26 08:30:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:52,178 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1305 transitions. [2021-08-26 08:30:52,178 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-08-26 08:30:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1305 transitions. [2021-08-26 08:30:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-26 08:30:52,180 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:52,180 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-08-26 08:30:52,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 08:30:52,181 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:52,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:52,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1480771081, now seen corresponding path program 1 times [2021-08-26 08:30:52,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:52,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684267097] [2021-08-26 08:30:52,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:52,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 08:30:52,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:52,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684267097] [2021-08-26 08:30:52,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684267097] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:52,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:52,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:52,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800003939] [2021-08-26 08:30:52,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:52,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:52,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,213 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-08-26 08:30:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:52,279 INFO L93 Difference]: Finished difference Result 2254 states and 3749 transitions. [2021-08-26 08:30:52,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:52,280 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-08-26 08:30:52,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:52,284 INFO L225 Difference]: With dead ends: 2254 [2021-08-26 08:30:52,284 INFO L226 Difference]: Without dead ends: 1503 [2021-08-26 08:30:52,287 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2021-08-26 08:30:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1247. [2021-08-26 08:30:52,333 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-08-26 08:30:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2106 transitions. [2021-08-26 08:30:52,336 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2106 transitions. Word has length 64 [2021-08-26 08:30:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:52,336 INFO L470 AbstractCegarLoop]: Abstraction has 1247 states and 2106 transitions. [2021-08-26 08:30:52,337 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-08-26 08:30:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2106 transitions. [2021-08-26 08:30:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-26 08:30:52,338 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:52,338 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-08-26 08:30:52,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 08:30:52,339 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:52,339 INFO L82 PathProgramCache]: Analyzing trace with hash -246111330, now seen corresponding path program 1 times [2021-08-26 08:30:52,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:52,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469935595] [2021-08-26 08:30:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:52,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 08:30:52,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:52,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469935595] [2021-08-26 08:30:52,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469935595] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:52,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:52,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:52,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667715688] [2021-08-26 08:30:52,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:52,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,397 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-08-26 08:30:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:52,474 INFO L93 Difference]: Finished difference Result 3606 states and 6114 transitions. [2021-08-26 08:30:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:52,475 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-08-26 08:30:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:52,482 INFO L225 Difference]: With dead ends: 3606 [2021-08-26 08:30:52,482 INFO L226 Difference]: Without dead ends: 2401 [2021-08-26 08:30:52,484 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2021-08-26 08:30:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2145. [2021-08-26 08:30:52,558 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-08-26 08:30:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3659 transitions. [2021-08-26 08:30:52,562 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3659 transitions. Word has length 65 [2021-08-26 08:30:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:52,562 INFO L470 AbstractCegarLoop]: Abstraction has 2145 states and 3659 transitions. [2021-08-26 08:30:52,563 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-08-26 08:30:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3659 transitions. [2021-08-26 08:30:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-26 08:30:52,565 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:52,565 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-08-26 08:30:52,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 08:30:52,566 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash 283992071, now seen corresponding path program 1 times [2021-08-26 08:30:52,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:52,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799928353] [2021-08-26 08:30:52,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:52,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 08:30:52,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:52,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799928353] [2021-08-26 08:30:52,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799928353] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:52,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:52,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 08:30:52,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146809685] [2021-08-26 08:30:52,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 08:30:52,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:52,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 08:30:52,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 08:30:52,613 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-08-26 08:30:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:52,681 INFO L93 Difference]: Finished difference Result 2225 states and 3778 transitions. [2021-08-26 08:30:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 08:30:52,682 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-08-26 08:30:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:52,682 INFO L225 Difference]: With dead ends: 2225 [2021-08-26 08:30:52,682 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 08:30:52,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 08:30:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 08:30:52,685 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-08-26 08:30:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 08:30:52,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2021-08-26 08:30:52,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:52,685 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 08:30:52,685 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-08-26 08:30:52,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 08:30:52,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 08:30:52,688 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 08:30:52,688 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 08:30:52,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-26 08:30:52,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 08:30:52,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:53,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:54,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:55,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:31:02,553 INFO L860 garLoopResultBuilder]: At program point L828(lines 810 830) the Hoare annotation is: true [2021-08-26 08:31:02,553 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2021-08-26 08:31:02,553 INFO L853 garLoopResultBuilder]: At program point L1489(lines 1484 1492) 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-08-26 08:31:02,554 INFO L853 garLoopResultBuilder]: At program point L1489-1(lines 1484 1492) 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-08-26 08:31:02,554 INFO L853 garLoopResultBuilder]: At program point L1489-2(lines 1484 1492) 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-08-26 08:31:02,554 INFO L860 garLoopResultBuilder]: At program point L1489-3(lines 1484 1492) the Hoare annotation is: true [2021-08-26 08:31:02,554 INFO L857 garLoopResultBuilder]: For program point L928(lines 928 939) no Hoare annotation was computed. [2021-08-26 08:31:02,554 INFO L857 garLoopResultBuilder]: For program point L895(lines 895 901) no Hoare annotation was computed. [2021-08-26 08:31:02,554 INFO L857 garLoopResultBuilder]: For program point L928-1(lines 928 939) no Hoare annotation was computed. [2021-08-26 08:31:02,554 INFO L857 garLoopResultBuilder]: For program point L928-2(lines 928 939) no Hoare annotation was computed. [2021-08-26 08:31:02,554 INFO L857 garLoopResultBuilder]: For program point L895-1(lines 895 901) no Hoare annotation was computed. [2021-08-26 08:31:02,554 INFO L857 garLoopResultBuilder]: For program point L928-3(lines 928 939) no Hoare annotation was computed. [2021-08-26 08:31:02,555 INFO L853 garLoopResultBuilder]: At program point L664(lines 659 667) 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-08-26 08:31:02,555 INFO L857 garLoopResultBuilder]: For program point L2580(lines 2580 2584) no Hoare annotation was computed. [2021-08-26 08:31:02,555 INFO L853 garLoopResultBuilder]: At program point L2580-2(lines 1 2589) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:31:02,555 INFO L857 garLoopResultBuilder]: For program point L2580-3(lines 2580 2584) no Hoare annotation was computed. [2021-08-26 08:31:02,555 INFO L857 garLoopResultBuilder]: For program point L2580-6(lines 2580 2584) no Hoare annotation was computed. [2021-08-26 08:31:02,555 INFO L853 garLoopResultBuilder]: At program point L2580-5(lines 1 2589) 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-08-26 08:31:02,555 INFO L857 garLoopResultBuilder]: For program point L1358(lines 1358 1362) no Hoare annotation was computed. [2021-08-26 08:31:02,555 INFO L853 garLoopResultBuilder]: At program point L2580-8(lines 1 2589) 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-08-26 08:31:02,555 INFO L853 garLoopResultBuilder]: At program point L103(lines 98 106) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:31:02,555 INFO L857 garLoopResultBuilder]: For program point L764(lines 764 772) no Hoare annotation was computed. [2021-08-26 08:31:02,555 INFO L853 garLoopResultBuilder]: At program point L2516(lines 2499 2522) 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-08-26 08:31:02,555 INFO L853 garLoopResultBuilder]: At program point L2516-1(lines 2499 2522) 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-08-26 08:31:02,555 INFO L857 garLoopResultBuilder]: For program point L601(lines 601 608) no Hoare annotation was computed. [2021-08-26 08:31:02,555 INFO L853 garLoopResultBuilder]: At program point L601-1(lines 1 2589) 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-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L2550(lines 2550 2566) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L601-2(lines 601 608) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L2550-1(lines 2550 2566) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L1427(lines 1427 1431) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L1394(lines 1394 1398) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L853 garLoopResultBuilder]: At program point L1427-1(lines 1299 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-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L965(lines 965 976) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L932(lines 932 938) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L965-1(lines 965 976) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L932-1(lines 932 938) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L965-2(lines 965 976) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L932-2(lines 932 938) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L965-3(lines 965 976) no Hoare annotation was computed. [2021-08-26 08:31:02,556 INFO L857 garLoopResultBuilder]: For program point L932-3(lines 932 938) no Hoare annotation was computed. [2021-08-26 08:31:02,557 INFO L853 garLoopResultBuilder]: At program point L900(lines 887 905) 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-08-26 08:31:02,557 INFO L860 garLoopResultBuilder]: At program point L900-1(lines 887 905) the Hoare annotation is: true [2021-08-26 08:31:02,557 INFO L853 garLoopResultBuilder]: At program point L1364(lines 1354 1440) 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-08-26 08:31:02,557 INFO L853 garLoopResultBuilder]: At program point L1331(lines 1318 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-08-26 08:31:02,557 INFO L857 garLoopResultBuilder]: For program point L2554(lines 2554 2565) no Hoare annotation was computed. [2021-08-26 08:31:02,557 INFO L857 garLoopResultBuilder]: For program point L2554-1(lines 2554 2565) no Hoare annotation was computed. [2021-08-26 08:31:02,557 INFO L857 garLoopResultBuilder]: For program point L2092(lines 2092 2104) no Hoare annotation was computed. [2021-08-26 08:31:02,557 INFO L857 garLoopResultBuilder]: For program point L969(lines 969 975) no Hoare annotation was computed. [2021-08-26 08:31:02,557 INFO L857 garLoopResultBuilder]: For program point L969-1(lines 969 975) no Hoare annotation was computed. [2021-08-26 08:31:02,557 INFO L857 garLoopResultBuilder]: For program point L969-2(lines 969 975) no Hoare annotation was computed. [2021-08-26 08:31:02,557 INFO L857 garLoopResultBuilder]: For program point L969-3(lines 969 975) no Hoare annotation was computed. [2021-08-26 08:31:02,557 INFO L857 garLoopResultBuilder]: For program point L1300(lines 1299 1445) no Hoare annotation was computed. [2021-08-26 08:31:02,557 INFO L853 garLoopResultBuilder]: At program point L937(lines 924 942) 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-08-26 08:31:02,557 INFO L853 garLoopResultBuilder]: At program point L937-1(lines 924 942) 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-08-26 08:31:02,557 INFO L853 garLoopResultBuilder]: At program point L937-2(lines 924 942) 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-08-26 08:31:02,558 INFO L860 garLoopResultBuilder]: At program point L937-3(lines 924 942) the Hoare annotation is: true [2021-08-26 08:31:02,558 INFO L853 garLoopResultBuilder]: At program point L673(lines 668 676) 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-08-26 08:31:02,558 INFO L853 garLoopResultBuilder]: At program point L1400(lines 1390 1437) 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-08-26 08:31:02,558 INFO L857 garLoopResultBuilder]: For program point L1301(lines 1301 1305) no Hoare annotation was computed. [2021-08-26 08:31:02,558 INFO L857 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2021-08-26 08:31:02,558 INFO L857 garLoopResultBuilder]: For program point L112-1(line 112) no Hoare annotation was computed. [2021-08-26 08:31:02,558 INFO L853 garLoopResultBuilder]: At program point L113(lines 119 136) 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-08-26 08:31:02,558 INFO L860 garLoopResultBuilder]: At program point L113-1(lines 119 136) the Hoare annotation is: true [2021-08-26 08:31:02,558 INFO L857 garLoopResultBuilder]: For program point L2095(lines 2095 2103) no Hoare annotation was computed. [2021-08-26 08:31:02,559 INFO L853 garLoopResultBuilder]: At program point L807(lines 787 809) 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-08-26 08:31:02,559 INFO L857 garLoopResultBuilder]: For program point L2558(lines 2558 2564) no Hoare annotation was computed. [2021-08-26 08:31:02,559 INFO L857 garLoopResultBuilder]: For program point L2558-1(lines 2558 2564) no Hoare annotation was computed. [2021-08-26 08:31:02,559 INFO L857 garLoopResultBuilder]: For program point L1369(lines 1369 1376) no Hoare annotation was computed. [2021-08-26 08:31:02,559 INFO L857 garLoopResultBuilder]: For program point L1336(lines 1336 1340) no Hoare annotation was computed. [2021-08-26 08:31:02,559 INFO L853 garLoopResultBuilder]: At program point L974(lines 961 979) 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-08-26 08:31:02,559 INFO L853 garLoopResultBuilder]: At program point L974-1(lines 961 979) 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-08-26 08:31:02,559 INFO L853 garLoopResultBuilder]: At program point L974-2(lines 961 979) 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-08-26 08:31:02,559 INFO L860 garLoopResultBuilder]: At program point L974-3(lines 961 979) the Hoare annotation is: true [2021-08-26 08:31:02,560 INFO L857 garLoopResultBuilder]: For program point L2527(lines 2527 2539) no Hoare annotation was computed. [2021-08-26 08:31:02,560 INFO L857 garLoopResultBuilder]: For program point L2098(lines 2098 2102) no Hoare annotation was computed. [2021-08-26 08:31:02,560 INFO L853 garLoopResultBuilder]: At program point L2098-2(lines 1 2589) 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-08-26 08:31:02,560 INFO L857 garLoopResultBuilder]: For program point L1405(lines 1405 1409) no Hoare annotation was computed. [2021-08-26 08:31:02,560 INFO L857 garLoopResultBuilder]: For program point L1307(lines 1307 1444) no Hoare annotation was computed. [2021-08-26 08:31:02,560 INFO L857 garLoopResultBuilder]: For program point L581(lines 581 587) no Hoare annotation was computed. [2021-08-26 08:31:02,560 INFO L853 garLoopResultBuilder]: At program point L581-1(lines 573 590) 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-08-26 08:31:02,560 INFO L857 garLoopResultBuilder]: For program point L2530(lines 2530 2538) no Hoare annotation was computed. [2021-08-26 08:31:02,560 INFO L853 garLoopResultBuilder]: At program point L2563-1(lines 2546 2569) 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-08-26 08:31:02,560 INFO L857 garLoopResultBuilder]: For program point L581-2(lines 581 587) no Hoare annotation was computed. [2021-08-26 08:31:02,561 INFO L853 garLoopResultBuilder]: At program point L2563(lines 2546 2569) 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-08-26 08:31:02,561 INFO L853 garLoopResultBuilder]: At program point L581-3(lines 573 590) 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-08-26 08:31:02,561 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 08:31:02,561 INFO L857 garLoopResultBuilder]: For program point L2068(lines 2068 2084) no Hoare annotation was computed. [2021-08-26 08:31:02,561 INFO L857 garLoopResultBuilder]: For program point L2068-1(lines 2068 2084) no Hoare annotation was computed. [2021-08-26 08:31:02,561 INFO L853 garLoopResultBuilder]: At program point L1342(lines 1332 1442) 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-08-26 08:31:02,561 INFO L857 garLoopResultBuilder]: For program point L947(lines 947 955) no Hoare annotation was computed. [2021-08-26 08:31:02,561 INFO L857 garLoopResultBuilder]: For program point L947-2(lines 947 955) no Hoare annotation was computed. [2021-08-26 08:31:02,561 INFO L857 garLoopResultBuilder]: For program point L947-4(lines 947 955) no Hoare annotation was computed. [2021-08-26 08:31:02,561 INFO L857 garLoopResultBuilder]: For program point L2533(lines 2533 2537) no Hoare annotation was computed. [2021-08-26 08:31:02,562 INFO L853 garLoopResultBuilder]: At program point L2533-2(lines 1 2589) 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-08-26 08:31:02,562 INFO L857 garLoopResultBuilder]: For program point L1311(lines 1311 1315) no Hoare annotation was computed. [2021-08-26 08:31:02,562 INFO L853 garLoopResultBuilder]: At program point L1411(lines 1401 1436) 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-08-26 08:31:02,562 INFO L853 garLoopResultBuilder]: At program point L1378(lines 1365 1439) 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-08-26 08:31:02,562 INFO L857 garLoopResultBuilder]: For program point L2072(lines 2072 2083) no Hoare annotation was computed. [2021-08-26 08:31:02,562 INFO L857 garLoopResultBuilder]: For program point L2072-1(lines 2072 2083) no Hoare annotation was computed. [2021-08-26 08:31:02,562 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 08:31:02,562 INFO L857 garLoopResultBuilder]: For program point L950(lines 950 954) no Hoare annotation was computed. [2021-08-26 08:31:02,562 INFO L853 garLoopResultBuilder]: At program point L950-2(lines 943 958) 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-08-26 08:31:02,563 INFO L857 garLoopResultBuilder]: For program point L950-3(lines 950 954) no Hoare annotation was computed. [2021-08-26 08:31:02,563 INFO L853 garLoopResultBuilder]: At program point L950-5(lines 943 958) 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-08-26 08:31:02,563 INFO L857 garLoopResultBuilder]: For program point L950-6(lines 950 954) no Hoare annotation was computed. [2021-08-26 08:31:02,563 INFO L853 garLoopResultBuilder]: At program point L950-8(lines 943 958) 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-08-26 08:31:02,563 INFO L857 garLoopResultBuilder]: For program point L2503-1(lines 2503 2519) no Hoare annotation was computed. [2021-08-26 08:31:02,563 INFO L853 garLoopResultBuilder]: At program point L1446(lines 1298 1447) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~rjh~0 2) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:31:02,563 INFO L857 garLoopResultBuilder]: For program point L2503(lines 2503 2519) no Hoare annotation was computed. [2021-08-26 08:31:02,563 INFO L857 garLoopResultBuilder]: For program point L1347(lines 1347 1351) no Hoare annotation was computed. [2021-08-26 08:31:02,563 INFO L857 garLoopResultBuilder]: For program point L984(lines 984 992) no Hoare annotation was computed. [2021-08-26 08:31:02,563 INFO L857 garLoopResultBuilder]: For program point L984-2(lines 984 992) no Hoare annotation was computed. [2021-08-26 08:31:02,564 INFO L857 garLoopResultBuilder]: For program point L984-4(lines 984 992) no Hoare annotation was computed. [2021-08-26 08:31:02,564 INFO L857 garLoopResultBuilder]: For program point L984-6(lines 984 992) no Hoare annotation was computed. [2021-08-26 08:31:02,564 INFO L857 garLoopResultBuilder]: For program point L984-8(lines 984 992) no Hoare annotation was computed. [2021-08-26 08:31:02,564 INFO L853 garLoopResultBuilder]: At program point L1513(lines 1502 1516) 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-08-26 08:31:02,564 INFO L857 garLoopResultBuilder]: For program point L820(lines 820 827) no Hoare annotation was computed. [2021-08-26 08:31:02,564 INFO L860 garLoopResultBuilder]: At program point L820-1(lines 820 827) the Hoare annotation is: true [2021-08-26 08:31:02,564 INFO L853 garLoopResultBuilder]: At program point L655(lines 650 658) 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-08-26 08:31:02,564 INFO L853 garLoopResultBuilder]: At program point L1481(lines 1456 1483) 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-08-26 08:31:02,564 INFO L860 garLoopResultBuilder]: At program point L1481-1(lines 1456 1483) the Hoare annotation is: true [2021-08-26 08:31:02,564 INFO L857 garLoopResultBuilder]: For program point L127(lines 127 133) no Hoare annotation was computed. [2021-08-26 08:31:02,565 INFO L857 garLoopResultBuilder]: For program point L127-2(lines 127 133) no Hoare annotation was computed. [2021-08-26 08:31:02,565 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 08:31:02,565 INFO L857 garLoopResultBuilder]: For program point L2076(lines 2076 2082) no Hoare annotation was computed. [2021-08-26 08:31:02,565 INFO L857 garLoopResultBuilder]: For program point L2076-1(lines 2076 2082) no Hoare annotation was computed. [2021-08-26 08:31:02,565 INFO L857 garLoopResultBuilder]: For program point L1416(lines 1416 1420) no Hoare annotation was computed. [2021-08-26 08:31:02,565 INFO L857 garLoopResultBuilder]: For program point L1383(lines 1383 1387) no Hoare annotation was computed. [2021-08-26 08:31:02,565 INFO L853 garLoopResultBuilder]: At program point L1317(lines 1307 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-08-26 08:31:02,565 INFO L853 garLoopResultBuilder]: At program point L95(lines 1 2589) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:31:02,565 INFO L857 garLoopResultBuilder]: For program point L987(lines 987 991) no Hoare annotation was computed. [2021-08-26 08:31:02,565 INFO L853 garLoopResultBuilder]: At program point L987-2(lines 980 995) 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-08-26 08:31:02,566 INFO L857 garLoopResultBuilder]: For program point L987-3(lines 987 991) no Hoare annotation was computed. [2021-08-26 08:31:02,566 INFO L853 garLoopResultBuilder]: At program point L987-5(lines 980 995) 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-08-26 08:31:02,566 INFO L857 garLoopResultBuilder]: For program point L987-6(lines 987 991) no Hoare annotation was computed. [2021-08-26 08:31:02,566 INFO L853 garLoopResultBuilder]: At program point L987-8(lines 980 995) 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-08-26 08:31:02,566 INFO L857 garLoopResultBuilder]: For program point L987-9(lines 987 991) no Hoare annotation was computed. [2021-08-26 08:31:02,566 INFO L853 garLoopResultBuilder]: At program point L987-11(lines 980 995) 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-08-26 08:31:02,566 INFO L857 garLoopResultBuilder]: For program point L987-12(lines 987 991) no Hoare annotation was computed. [2021-08-26 08:31:02,566 INFO L853 garLoopResultBuilder]: At program point L987-14(lines 980 995) 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-08-26 08:31:02,566 INFO L857 garLoopResultBuilder]: For program point L2507-1(lines 2507 2518) no Hoare annotation was computed. [2021-08-26 08:31:02,567 INFO L857 garLoopResultBuilder]: For program point L2507(lines 2507 2518) no Hoare annotation was computed. [2021-08-26 08:31:02,567 INFO L857 garLoopResultBuilder]: For program point L2574(lines 2574 2586) no Hoare annotation was computed. [2021-08-26 08:31:02,567 INFO L857 garLoopResultBuilder]: For program point L2574-2(lines 2574 2586) no Hoare annotation was computed. [2021-08-26 08:31:02,567 INFO L857 garLoopResultBuilder]: For program point L2574-4(lines 2574 2586) no Hoare annotation was computed. [2021-08-26 08:31:02,567 INFO L853 garLoopResultBuilder]: At program point L560(lines 1 2589) 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-08-26 08:31:02,567 INFO L853 garLoopResultBuilder]: At program point L560-1(lines 1 2589) 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-08-26 08:31:02,567 INFO L853 garLoopResultBuilder]: At program point L1353(lines 1343 1441) 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-08-26 08:31:02,567 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 08:31:02,567 INFO L857 garLoopResultBuilder]: For program point L891(lines 891 902) no Hoare annotation was computed. [2021-08-26 08:31:02,567 INFO L857 garLoopResultBuilder]: For program point L891-1(lines 891 902) no Hoare annotation was computed. [2021-08-26 08:31:02,568 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2021-08-26 08:31:02,568 INFO L853 garLoopResultBuilder]: At program point L2081(lines 2064 2087) 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-08-26 08:31:02,568 INFO L853 garLoopResultBuilder]: At program point L2081-1(lines 2064 2087) 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-08-26 08:31:02,568 INFO L857 garLoopResultBuilder]: For program point L2577(lines 2577 2585) no Hoare annotation was computed. [2021-08-26 08:31:02,568 INFO L857 garLoopResultBuilder]: For program point L2511-1(lines 2511 2517) no Hoare annotation was computed. [2021-08-26 08:31:02,568 INFO L857 garLoopResultBuilder]: For program point L2577-2(lines 2577 2585) no Hoare annotation was computed. [2021-08-26 08:31:02,568 INFO L857 garLoopResultBuilder]: For program point L2511(lines 2511 2517) no Hoare annotation was computed. [2021-08-26 08:31:02,568 INFO L857 garLoopResultBuilder]: For program point L2577-4(lines 2577 2585) no Hoare annotation was computed. [2021-08-26 08:31:02,568 INFO L857 garLoopResultBuilder]: For program point L1322(lines 1322 1329) no Hoare annotation was computed. [2021-08-26 08:31:02,569 INFO L853 garLoopResultBuilder]: At program point L1422(lines 1412 1435) 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-08-26 08:31:02,569 INFO L853 garLoopResultBuilder]: At program point L1389(lines 1379 1438) 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-08-26 08:31:02,572 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 08:31:02,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:31:02 BoogieIcfgContainer [2021-08-26 08:31:02,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 08:31:02,593 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 08:31:02,593 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 08:31:02,593 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 08:31:02,594 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:30:47" (3/4) ... [2021-08-26 08:31:02,595 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 08:31:02,611 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 84 nodes and edges [2021-08-26 08:31:02,616 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2021-08-26 08:31:02,617 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-08-26 08:31:02,618 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-08-26 08:31:02,619 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 08:31:02,619 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 08:31:02,643 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-08-26 08:31:02,643 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-08-26 08:31:02,645 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-08-26 08:31:02,645 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-08-26 08:31:02,645 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-08-26 08:31:02,645 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-08-26 08:31:02,646 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-08-26 08:31:02,646 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-08-26 08:31:02,646 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 [2021-08-26 08:31:02,646 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-08-26 08:31:02,646 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-08-26 08:31:02,646 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 [2021-08-26 08:31:02,647 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-08-26 08:31:02,647 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 [2021-08-26 08:31:02,647 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-08-26 08:31:02,647 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 [2021-08-26 08:31:02,647 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-08-26 08:31:02,647 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-08-26 08:31:02,647 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-08-26 08:31:02,647 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-08-26 08:31:02,648 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-08-26 08:31:02,648 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-08-26 08:31:02,648 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-08-26 08:31:02,648 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-08-26 08:31:02,648 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-08-26 08:31:02,648 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-08-26 08:31:02,648 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-08-26 08:31:02,648 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-08-26 08:31:02,649 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-08-26 08:31:02,649 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-08-26 08:31:02,649 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-08-26 08:31:02,649 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-08-26 08:31:02,649 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && msg == 1 [2021-08-26 08:31:02,709 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 08:31:02,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 08:31:02,711 INFO L168 Benchmark]: Toolchain (without parser) took 16988.30 ms. Allocated memory was 54.5 MB in the beginning and 396.4 MB in the end (delta: 341.8 MB). Free memory was 31.2 MB in the beginning and 330.4 MB in the end (delta: -299.2 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:02,711 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.6 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 08:31:02,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 565.80 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 31.0 MB in the beginning and 43.8 MB in the end (delta: -12.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:02,711 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.04 ms. Allocated memory is still 69.2 MB. Free memory was 43.8 MB in the beginning and 38.0 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:02,712 INFO L168 Benchmark]: Boogie Preprocessor took 52.66 ms. Allocated memory is still 69.2 MB. Free memory was 38.0 MB in the beginning and 34.4 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:02,712 INFO L168 Benchmark]: RCFGBuilder took 1195.83 ms. Allocated memory was 69.2 MB in the beginning and 102.8 MB in the end (delta: 33.6 MB). Free memory was 34.4 MB in the beginning and 44.7 MB in the end (delta: -10.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:02,712 INFO L168 Benchmark]: TraceAbstraction took 14968.40 ms. Allocated memory was 102.8 MB in the beginning and 396.4 MB in the end (delta: 293.6 MB). Free memory was 44.7 MB in the beginning and 348.4 MB in the end (delta: -303.6 MB). Peak memory consumption was 213.3 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:02,712 INFO L168 Benchmark]: Witness Printer took 116.44 ms. Allocated memory is still 396.4 MB. Free memory was 348.4 MB in the beginning and 330.4 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-26 08:31:02,714 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.15 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.6 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 565.80 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 31.0 MB in the beginning and 43.8 MB in the end (delta: -12.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.04 ms. Allocated memory is still 69.2 MB. Free memory was 43.8 MB in the beginning and 38.0 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.66 ms. Allocated memory is still 69.2 MB. Free memory was 38.0 MB in the beginning and 34.4 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1195.83 ms. Allocated memory was 69.2 MB in the beginning and 102.8 MB in the end (delta: 33.6 MB). Free memory was 34.4 MB in the beginning and 44.7 MB in the end (delta: -10.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14968.40 ms. Allocated memory was 102.8 MB in the beginning and 396.4 MB in the end (delta: 293.6 MB). Free memory was 44.7 MB in the beginning and 348.4 MB in the end (delta: -303.6 MB). Peak memory consumption was 213.3 MB. Max. memory is 16.1 GB. * Witness Printer took 116.44 ms. Allocated memory is still 396.4 MB. Free memory was 348.4 MB in the beginning and 330.4 MB in the end (delta: 18.0 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: 112]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 112]: 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: 14886.4ms, OverallIterations: 19, TraceHistogramMax: 3, EmptinessCheckTime: 28.8ms, AutomataDifference: 2488.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 9864.5ms, InitialAbstractionConstructionTime: 10.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5580 SDtfs, 8956 SDslu, 10022 SDs, 0 SdLazy, 881 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 762.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 772.4ms 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: 404.4ms AutomataMinimizationTime, 19 MinimizatonAttempts, 3463 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 63 LocationsWithAnnotation, 63 PreInvPairs, 1047 NumberOfFragments, 1938 HoareAnnotationTreeSize, 63 FomulaSimplifications, 443043999 FormulaSimplificationTreeSizeReduction, 2926.9ms HoareSimplificationTime, 63 FomulaSimplificationsInter, 719483 FormulaSimplificationTreeSizeReductionInter, 6913.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 167.5ms SsaConstructionTime, 426.0ms SatisfiabilityAnalysisTime, 910.5ms 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: 1379]: 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: 961]: 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: 787]: Loop Invariant Derived loop invariant: ((handle == 3 && __ste_client_forwardReceiver1 == 0) && rjh == 2) && !(__ste_email_to0 == 1) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 980]: Loop Invariant Derived loop invariant: (((((handle == 3 && __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: 924]: 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: 1318]: 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: 924]: 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: 119]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2064]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 2499]: 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: 887]: 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: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 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 - InvariantResult [Line: 1484]: Loop Invariant Derived loop invariant: ((((handle == 3 && \result == 1) && \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: 2064]: 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: 1456]: Loop Invariant Derived loop invariant: ((((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 1401]: 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: 668]: Loop Invariant Derived loop invariant: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 887]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1298]: Loop Invariant Derived loop invariant: (handle == 3 && rjh == 2) && !(__ste_email_to0 == 1) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == to) && rjh == 2) && !(__ste_email_to0 == 1)) && msg == 1 - InvariantResult [Line: 1412]: 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: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 924]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 650]: Loop Invariant Derived loop invariant: ((((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 2546]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 1299]: 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: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 659]: 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 && 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: 980]: 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: 573]: 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: 2499]: 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: 1484]: Loop Invariant Derived loop invariant: ((((((handle == 3 && handle == 1) && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 - InvariantResult [Line: 1343]: 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: 961]: 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: 119]: 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: 1365]: 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: 1456]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 943]: 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: 980]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 980]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && msg == 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1484]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1332]: 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: 810]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 924]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1354]: 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: 820]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1502]: 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: ((((((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: 1390]: 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: 1484]: Loop Invariant Derived loop invariant: ((((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 961]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2546]: 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: 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: 961]: Loop Invariant Derived loop invariant: ((((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && rjh == 2) && tmp == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 980]: Loop Invariant Derived loop invariant: (((((handle == 3 && handle == 1) && \result == 1) && 2 == to) && rjh == 2) && msg == 1) && msg == 1 RESULT: Ultimate proved your program to be correct! [2021-08-26 08:31:02,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...