./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_product05.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec4497e08a1792200bf5eff0342ec51442e382a3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 08:30:29,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 08:30:29,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 08:30:29,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 08:30:29,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 08:30:29,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 08:30:29,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 08:30:29,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 08:30:29,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 08:30:29,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 08:30:29,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 08:30:29,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 08:30:29,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 08:30:29,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 08:30:29,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 08:30:29,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 08:30:29,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 08:30:29,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 08:30:29,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 08:30:29,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 08:30:29,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 08:30:29,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 08:30:29,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 08:30:29,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 08:30:29,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 08:30:29,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 08:30:29,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 08:30:29,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 08:30:29,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 08:30:29,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 08:30:29,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 08:30:29,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 08:30:29,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 08:30:29,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 08:30:29,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 08:30:29,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 08:30:29,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 08:30:29,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 08:30:29,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 08:30:29,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 08:30:29,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 08:30:29,331 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:29,352 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 08:30:29,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 08:30:29,352 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 08:30:29,352 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 08:30:29,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 08:30:29,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 08:30:29,354 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 08:30:29,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 08:30:29,354 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 08:30:29,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 08:30:29,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 08:30:29,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 08:30:29,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 08:30:29,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 08:30:29,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 08:30:29,355 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 08:30:29,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 08:30:29,355 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 08:30:29,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 08:30:29,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 08:30:29,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 08:30:29,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 08:30:29,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:30:29,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 08:30:29,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 08:30:29,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 08:30:29,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 08:30:29,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 08:30:29,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 08:30:29,357 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 08:30:29,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec4497e08a1792200bf5eff0342ec51442e382a3 [2021-08-26 08:30:29,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 08:30:29,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 08:30:29,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 08:30:29,593 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 08:30:29,593 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 08:30:29,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2021-08-26 08:30:29,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7001eab/f227efc358fe429c8440a640d4166dc3/FLAGba710852e [2021-08-26 08:30:30,100 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 08:30:30,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2021-08-26 08:30:30,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7001eab/f227efc358fe429c8440a640d4166dc3/FLAGba710852e [2021-08-26 08:30:30,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7001eab/f227efc358fe429c8440a640d4166dc3 [2021-08-26 08:30:30,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 08:30:30,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 08:30:30,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 08:30:30,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 08:30:30,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 08:30:30,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:30:30" (1/1) ... [2021-08-26 08:30:30,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c577a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:30, skipping insertion in model container [2021-08-26 08:30:30,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:30:30" (1/1) ... [2021-08-26 08:30:30,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 08:30:30,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 08:30:30,335 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_product05.cil.c[3965,3978] [2021-08-26 08:30:30,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:30:30,501 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 08:30:30,513 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_product05.cil.c[3965,3978] [2021-08-26 08:30:30,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:30:30,617 INFO L208 MainTranslator]: Completed translation [2021-08-26 08:30:30,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:30 WrapperNode [2021-08-26 08:30:30,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 08:30:30,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 08:30:30,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 08:30:30,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 08:30:30,629 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:30" (1/1) ... [2021-08-26 08:30:30,655 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:30" (1/1) ... [2021-08-26 08:30:30,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 08:30:30,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 08:30:30,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 08:30:30,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 08:30:30,696 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:30" (1/1) ... [2021-08-26 08:30:30,696 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:30" (1/1) ... [2021-08-26 08:30:30,703 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:30" (1/1) ... [2021-08-26 08:30:30,704 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:30" (1/1) ... [2021-08-26 08:30:30,718 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:30" (1/1) ... [2021-08-26 08:30:30,735 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:30" (1/1) ... [2021-08-26 08:30:30,737 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:30" (1/1) ... [2021-08-26 08:30:30,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 08:30:30,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 08:30:30,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 08:30:30,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 08:30:30,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:30" (1/1) ... [2021-08-26 08:30:30,747 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:30:30,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:30:30,765 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:30,768 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:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2021-08-26 08:30:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 08:30:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 08:30:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 08:30:30,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 08:30:31,604 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 08:30:31,604 INFO L299 CfgBuilder]: Removed 127 assume(true) statements. [2021-08-26 08:30:31,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:30:31 BoogieIcfgContainer [2021-08-26 08:30:31,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 08:30:31,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 08:30:31,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 08:30:31,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 08:30:31,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:30:30" (1/3) ... [2021-08-26 08:30:31,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700a30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:30:31, skipping insertion in model container [2021-08-26 08:30:31,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:30:30" (2/3) ... [2021-08-26 08:30:31,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700a30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:30:31, skipping insertion in model container [2021-08-26 08:30:31,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:30:31" (3/3) ... [2021-08-26 08:30:31,611 INFO L111 eAbstractionObserver]: Analyzing ICFG email_spec0_product05.cil.c [2021-08-26 08:30:31,615 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 08:30:31,615 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 08:30:31,658 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 08:30:31,665 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:31,665 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-26 08:30:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 131 states have (on average 1.6488549618320612) internal successors, (216), 133 states have internal predecessors, (216), 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:31,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 08:30:31,689 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:31,689 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] [2021-08-26 08:30:31,690 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:31,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1721357046, now seen corresponding path program 1 times [2021-08-26 08:30:31,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:31,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197334229] [2021-08-26 08:30:31,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:31,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:31,906 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:31,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:31,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197334229] [2021-08-26 08:30:31,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197334229] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:31,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:31,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 08:30:31,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307451225] [2021-08-26 08:30:31,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 08:30:31,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:31,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 08:30:31,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 08:30:31,933 INFO L87 Difference]: Start difference. First operand has 134 states, 131 states have (on average 1.6488549618320612) internal successors, (216), 133 states have internal predecessors, (216), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:31,967 INFO L93 Difference]: Finished difference Result 221 states and 347 transitions. [2021-08-26 08:30:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 08:30:31,968 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2021-08-26 08:30:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:31,976 INFO L225 Difference]: With dead ends: 221 [2021-08-26 08:30:31,976 INFO L226 Difference]: Without dead ends: 118 [2021-08-26 08:30:31,979 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:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-08-26 08:30:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-08-26 08:30:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 116 states have (on average 1.6120689655172413) internal successors, (187), 117 states have internal predecessors, (187), 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:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2021-08-26 08:30:32,020 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 34 [2021-08-26 08:30:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:32,020 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2021-08-26 08:30:32,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2021-08-26 08:30:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-26 08:30:32,024 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:32,024 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] [2021-08-26 08:30:32,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 08:30:32,025 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:32,028 INFO L82 PathProgramCache]: Analyzing trace with hash -122239248, now seen corresponding path program 1 times [2021-08-26 08:30:32,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:32,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380753975] [2021-08-26 08:30:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:32,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:32,139 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:32,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:32,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380753975] [2021-08-26 08:30:32,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380753975] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:32,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:32,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:32,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108250204] [2021-08-26 08:30:32,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:32,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:32,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:32,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:32,144 INFO L87 Difference]: Start difference. First operand 118 states and 187 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:32,201 INFO L93 Difference]: Finished difference Result 327 states and 519 transitions. [2021-08-26 08:30:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:32,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2021-08-26 08:30:32,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:32,205 INFO L225 Difference]: With dead ends: 327 [2021-08-26 08:30:32,206 INFO L226 Difference]: Without dead ends: 220 [2021-08-26 08:30:32,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-08-26 08:30:32,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 117. [2021-08-26 08:30:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.5913043478260869) internal successors, (183), 116 states have internal predecessors, (183), 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:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2021-08-26 08:30:32,221 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 35 [2021-08-26 08:30:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:32,222 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2021-08-26 08:30:32,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2021-08-26 08:30:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 08:30:32,226 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:32,226 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] [2021-08-26 08:30:32,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 08:30:32,226 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:32,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:32,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2107249571, now seen corresponding path program 1 times [2021-08-26 08:30:32,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:32,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550273010] [2021-08-26 08:30:32,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:32,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:32,292 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:32,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:32,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550273010] [2021-08-26 08:30:32,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550273010] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:32,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:32,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:32,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172949369] [2021-08-26 08:30:32,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:32,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:32,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:32,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:32,299 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:32,323 INFO L93 Difference]: Finished difference Result 220 states and 346 transitions. [2021-08-26 08:30:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:32,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2021-08-26 08:30:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:32,326 INFO L225 Difference]: With dead ends: 220 [2021-08-26 08:30:32,326 INFO L226 Difference]: Without dead ends: 118 [2021-08-26 08:30:32,328 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-08-26 08:30:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2021-08-26 08:30:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.565217391304348) internal successors, (180), 116 states have internal predecessors, (180), 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:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2021-08-26 08:30:32,342 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 36 [2021-08-26 08:30:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:32,342 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2021-08-26 08:30:32,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2021-08-26 08:30:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-26 08:30:32,343 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:32,343 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:32,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 08:30:32,344 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:32,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1032935230, now seen corresponding path program 1 times [2021-08-26 08:30:32,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:32,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099172352] [2021-08-26 08:30:32,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:32,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:32,393 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:32,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:32,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099172352] [2021-08-26 08:30:32,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099172352] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:32,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:32,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:32,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281780406] [2021-08-26 08:30:32,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:32,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:32,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:32,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:32,395 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:32,402 INFO L93 Difference]: Finished difference Result 191 states and 289 transitions. [2021-08-26 08:30:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:32,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:32,404 INFO L225 Difference]: With dead ends: 191 [2021-08-26 08:30:32,404 INFO L226 Difference]: Without dead ends: 120 [2021-08-26 08:30:32,404 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-08-26 08:30:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2021-08-26 08:30:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 118 states have internal predecessors, (182), 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:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 182 transitions. [2021-08-26 08:30:32,408 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 182 transitions. Word has length 38 [2021-08-26 08:30:32,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:32,409 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 182 transitions. [2021-08-26 08:30:32,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 182 transitions. [2021-08-26 08:30:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-26 08:30:32,409 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:32,410 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] [2021-08-26 08:30:32,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 08:30:32,410 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:32,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:32,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1719269101, now seen corresponding path program 1 times [2021-08-26 08:30:32,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:32,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254787491] [2021-08-26 08:30:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:32,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:32,492 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:32,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:32,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254787491] [2021-08-26 08:30:32,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254787491] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:30:32,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965105203] [2021-08-26 08:30:32,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:32,494 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:30:32,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:30:32,504 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:32,508 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:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:32,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 08:30:32,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:30:32,946 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:32,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965105203] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:30:32,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:30:32,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-26 08:30:32,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386965975] [2021-08-26 08:30:32,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:32,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:32,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:32,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:32,949 INFO L87 Difference]: Start difference. First operand 119 states and 182 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:32,975 INFO L93 Difference]: Finished difference Result 291 states and 448 transitions. [2021-08-26 08:30:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 08:30:32,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 43 [2021-08-26 08:30:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:32,977 INFO L225 Difference]: With dead ends: 291 [2021-08-26 08:30:32,977 INFO L226 Difference]: Without dead ends: 220 [2021-08-26 08:30:32,978 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:32,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-08-26 08:30:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 148. [2021-08-26 08:30:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 146 states have (on average 1.6164383561643836) internal successors, (236), 147 states have internal predecessors, (236), 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:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 236 transitions. [2021-08-26 08:30:32,983 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 236 transitions. Word has length 43 [2021-08-26 08:30:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:32,983 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 236 transitions. [2021-08-26 08:30:32,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 236 transitions. [2021-08-26 08:30:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-26 08:30:32,984 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:32,984 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] [2021-08-26 08:30:33,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 08:30:33,202 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:33,203 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:33,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:33,203 INFO L82 PathProgramCache]: Analyzing trace with hash 196922526, now seen corresponding path program 2 times [2021-08-26 08:30:33,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:33,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245315408] [2021-08-26 08:30:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:33,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:33,261 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:33,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:33,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245315408] [2021-08-26 08:30:33,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245315408] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:33,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:33,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:30:33,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064139720] [2021-08-26 08:30:33,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:33,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:33,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:33,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:33,263 INFO L87 Difference]: Start difference. First operand 148 states and 236 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:33,289 INFO L93 Difference]: Finished difference Result 373 states and 603 transitions. [2021-08-26 08:30:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 08:30:33,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 48 [2021-08-26 08:30:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:33,291 INFO L225 Difference]: With dead ends: 373 [2021-08-26 08:30:33,291 INFO L226 Difference]: Without dead ends: 273 [2021-08-26 08:30:33,291 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 08:30:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-26 08:30:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 202. [2021-08-26 08:30:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 1.685) internal successors, (337), 201 states have internal predecessors, (337), 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:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 337 transitions. [2021-08-26 08:30:33,298 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 337 transitions. Word has length 48 [2021-08-26 08:30:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:33,299 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 337 transitions. [2021-08-26 08:30:33,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 337 transitions. [2021-08-26 08:30:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 08:30:33,299 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:33,300 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] [2021-08-26 08:30:33,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 08:30:33,300 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:33,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:33,300 INFO L82 PathProgramCache]: Analyzing trace with hash -867360645, now seen corresponding path program 1 times [2021-08-26 08:30:33,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:33,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477225910] [2021-08-26 08:30:33,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:33,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:33,377 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:33,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:33,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477225910] [2021-08-26 08:30:33,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477225910] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:33,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:33,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 08:30:33,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463901880] [2021-08-26 08:30:33,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 08:30:33,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 08:30:33,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-08-26 08:30:33,380 INFO L87 Difference]: Start difference. First operand 202 states and 337 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:33,841 INFO L93 Difference]: Finished difference Result 645 states and 945 transitions. [2021-08-26 08:30:33,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-26 08:30:33,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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 49 [2021-08-26 08:30:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:33,843 INFO L225 Difference]: With dead ends: 645 [2021-08-26 08:30:33,844 INFO L226 Difference]: Without dead ends: 596 [2021-08-26 08:30:33,844 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 236.9ms TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2021-08-26 08:30:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-08-26 08:30:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 236. [2021-08-26 08:30:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 234 states have (on average 1.641025641025641) internal successors, (384), 235 states have internal predecessors, (384), 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:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 384 transitions. [2021-08-26 08:30:33,856 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 384 transitions. Word has length 49 [2021-08-26 08:30:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:33,857 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 384 transitions. [2021-08-26 08:30:33,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 384 transitions. [2021-08-26 08:30:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-26 08:30:33,858 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:33,858 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] [2021-08-26 08:30:33,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 08:30:33,858 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:33,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:33,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1932642042, now seen corresponding path program 1 times [2021-08-26 08:30:33,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:33,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684160515] [2021-08-26 08:30:33,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:33,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:33,927 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:33,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:33,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684160515] [2021-08-26 08:30:33,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684160515] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:33,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:33,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 08:30:33,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954745981] [2021-08-26 08:30:33,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 08:30:33,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:33,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 08:30:33,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 08:30:33,929 INFO L87 Difference]: Start difference. First operand 236 states and 384 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:33,983 INFO L93 Difference]: Finished difference Result 368 states and 565 transitions. [2021-08-26 08:30:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 08:30:33,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 50 [2021-08-26 08:30:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:33,984 INFO L225 Difference]: With dead ends: 368 [2021-08-26 08:30:33,985 INFO L226 Difference]: Without dead ends: 279 [2021-08-26 08:30:33,985 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-08-26 08:30:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-08-26 08:30:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 232. [2021-08-26 08:30:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 230 states have (on average 1.6391304347826088) internal successors, (377), 231 states have internal predecessors, (377), 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:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 377 transitions. [2021-08-26 08:30:33,998 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 377 transitions. Word has length 50 [2021-08-26 08:30:33,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:33,998 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 377 transitions. [2021-08-26 08:30:33,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 377 transitions. [2021-08-26 08:30:33,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-26 08:30:33,999 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:33,999 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] [2021-08-26 08:30:33,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 08:30:34,000 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:34,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:34,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1701439479, now seen corresponding path program 1 times [2021-08-26 08:30:34,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:34,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39391822] [2021-08-26 08:30:34,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:34,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:34,066 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:34,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:34,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39391822] [2021-08-26 08:30:34,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39391822] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:34,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:34,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 08:30:34,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970510468] [2021-08-26 08:30:34,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:30:34,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:30:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:34,071 INFO L87 Difference]: Start difference. First operand 232 states and 377 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:34,151 INFO L93 Difference]: Finished difference Result 550 states and 851 transitions. [2021-08-26 08:30:34,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 08:30:34,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 50 [2021-08-26 08:30:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:34,153 INFO L225 Difference]: With dead ends: 550 [2021-08-26 08:30:34,153 INFO L226 Difference]: Without dead ends: 468 [2021-08-26 08:30:34,154 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 24.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:30:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-08-26 08:30:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 388. [2021-08-26 08:30:34,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 386 states have (on average 1.616580310880829) internal successors, (624), 387 states have internal predecessors, (624), 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:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 624 transitions. [2021-08-26 08:30:34,175 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 624 transitions. Word has length 50 [2021-08-26 08:30:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:34,175 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 624 transitions. [2021-08-26 08:30:34,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 624 transitions. [2021-08-26 08:30:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-26 08:30:34,176 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:34,177 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] [2021-08-26 08:30:34,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 08:30:34,177 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1663962474, now seen corresponding path program 1 times [2021-08-26 08:30:34,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:34,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423655384] [2021-08-26 08:30:34,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:34,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:34,249 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:34,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:34,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423655384] [2021-08-26 08:30:34,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423655384] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:34,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:34,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 08:30:34,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261468698] [2021-08-26 08:30:34,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 08:30:34,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:34,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 08:30:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:30:34,252 INFO L87 Difference]: Start difference. First operand 388 states and 624 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:34,658 INFO L93 Difference]: Finished difference Result 917 states and 1348 transitions. [2021-08-26 08:30:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-26 08:30:34,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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 51 [2021-08-26 08:30:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:34,661 INFO L225 Difference]: With dead ends: 917 [2021-08-26 08:30:34,661 INFO L226 Difference]: Without dead ends: 759 [2021-08-26 08:30:34,662 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 164.9ms TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2021-08-26 08:30:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2021-08-26 08:30:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 467. [2021-08-26 08:30:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.578494623655914) internal successors, (734), 466 states have internal predecessors, (734), 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:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 734 transitions. [2021-08-26 08:30:34,695 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 734 transitions. Word has length 51 [2021-08-26 08:30:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:34,696 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 734 transitions. [2021-08-26 08:30:34,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 734 transitions. [2021-08-26 08:30:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-26 08:30:34,697 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:34,697 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] [2021-08-26 08:30:34,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 08:30:34,697 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:34,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:34,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1224175828, now seen corresponding path program 1 times [2021-08-26 08:30:34,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:34,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773035280] [2021-08-26 08:30:34,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:34,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:34,731 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:34,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:34,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773035280] [2021-08-26 08:30:34,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773035280] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:34,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:34,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 08:30:34,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592035428] [2021-08-26 08:30:34,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 08:30:34,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:34,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 08:30:34,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 08:30:34,733 INFO L87 Difference]: Start difference. First operand 467 states and 734 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:34,766 INFO L93 Difference]: Finished difference Result 558 states and 850 transitions. [2021-08-26 08:30:34,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 08:30:34,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:34,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:34,768 INFO L225 Difference]: With dead ends: 558 [2021-08-26 08:30:34,768 INFO L226 Difference]: Without dead ends: 374 [2021-08-26 08:30:34,769 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:30:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-08-26 08:30:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 339. [2021-08-26 08:30:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 337 states have (on average 1.6112759643916914) internal successors, (543), 338 states have internal predecessors, (543), 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:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 543 transitions. [2021-08-26 08:30:34,787 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 543 transitions. Word has length 52 [2021-08-26 08:30:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:34,787 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 543 transitions. [2021-08-26 08:30:34,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 543 transitions. [2021-08-26 08:30:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-26 08:30:34,788 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:34,788 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:34,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 08:30:34,789 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:34,789 INFO L82 PathProgramCache]: Analyzing trace with hash -944544913, now seen corresponding path program 1 times [2021-08-26 08:30:34,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:34,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758241870] [2021-08-26 08:30:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:34,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:34,821 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:34,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:34,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758241870] [2021-08-26 08:30:34,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758241870] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:34,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:34,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:34,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030810766] [2021-08-26 08:30:34,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:34,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:34,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:34,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:34,823 INFO L87 Difference]: Start difference. First operand 339 states and 543 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:34,864 INFO L93 Difference]: Finished difference Result 911 states and 1459 transitions. [2021-08-26 08:30:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:34,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 57 [2021-08-26 08:30:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:34,867 INFO L225 Difference]: With dead ends: 911 [2021-08-26 08:30:34,867 INFO L226 Difference]: Without dead ends: 598 [2021-08-26 08:30:34,867 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-08-26 08:30:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 453. [2021-08-26 08:30:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 451 states have (on average 1.6563192904656319) internal successors, (747), 452 states have internal predecessors, (747), 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:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 747 transitions. [2021-08-26 08:30:34,890 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 747 transitions. Word has length 57 [2021-08-26 08:30:34,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:34,890 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 747 transitions. [2021-08-26 08:30:34,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 747 transitions. [2021-08-26 08:30:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-26 08:30:34,891 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:34,892 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:30:34,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 08:30:34,892 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:34,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:34,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1173566898, now seen corresponding path program 1 times [2021-08-26 08:30:34,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:34,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696070924] [2021-08-26 08:30:34,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:34,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-26 08:30:34,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:34,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696070924] [2021-08-26 08:30:34,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696070924] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:34,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:34,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:34,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405726427] [2021-08-26 08:30:34,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:34,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:34,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:34,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:34,922 INFO L87 Difference]: Start difference. First operand 453 states and 747 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:34,954 INFO L93 Difference]: Finished difference Result 855 states and 1347 transitions. [2021-08-26 08:30:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:34,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:34,957 INFO L225 Difference]: With dead ends: 855 [2021-08-26 08:30:34,957 INFO L226 Difference]: Without dead ends: 569 [2021-08-26 08:30:34,957 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:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-08-26 08:30:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 424. [2021-08-26 08:30:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 422 states have (on average 1.6374407582938388) internal successors, (691), 423 states have internal predecessors, (691), 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:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 691 transitions. [2021-08-26 08:30:34,979 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 691 transitions. Word has length 58 [2021-08-26 08:30:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:34,979 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 691 transitions. [2021-08-26 08:30:34,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 691 transitions. [2021-08-26 08:30:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-26 08:30:34,980 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:34,980 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:34,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 08:30:34,981 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:34,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:34,981 INFO L82 PathProgramCache]: Analyzing trace with hash 328528683, now seen corresponding path program 1 times [2021-08-26 08:30:34,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:34,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247278301] [2021-08-26 08:30:34,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:34,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:35,025 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:35,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:35,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247278301] [2021-08-26 08:30:35,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247278301] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:35,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:35,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:35,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52623192] [2021-08-26 08:30:35,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:35,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:35,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:35,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:35,027 INFO L87 Difference]: Start difference. First operand 424 states and 691 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:35,076 INFO L93 Difference]: Finished difference Result 1181 states and 1941 transitions. [2021-08-26 08:30:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:35,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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 58 [2021-08-26 08:30:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:35,079 INFO L225 Difference]: With dead ends: 1181 [2021-08-26 08:30:35,079 INFO L226 Difference]: Without dead ends: 787 [2021-08-26 08:30:35,080 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-08-26 08:30:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 642. [2021-08-26 08:30:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 640 states have (on average 1.6875) internal successors, (1080), 641 states have internal predecessors, (1080), 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:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1080 transitions. [2021-08-26 08:30:35,109 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1080 transitions. Word has length 58 [2021-08-26 08:30:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:35,109 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 1080 transitions. [2021-08-26 08:30:35,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1080 transitions. [2021-08-26 08:30:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-26 08:30:35,110 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:35,110 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:35,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 08:30:35,111 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash 87613521, now seen corresponding path program 1 times [2021-08-26 08:30:35,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:35,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369421556] [2021-08-26 08:30:35,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:35,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:35,142 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:35,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:35,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369421556] [2021-08-26 08:30:35,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369421556] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:35,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:35,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:35,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883991704] [2021-08-26 08:30:35,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:35,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:35,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:35,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:35,146 INFO L87 Difference]: Start difference. First operand 642 states and 1080 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:35,206 INFO L93 Difference]: Finished difference Result 1821 states and 3086 transitions. [2021-08-26 08:30:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:35,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:35,210 INFO L225 Difference]: With dead ends: 1821 [2021-08-26 08:30:35,210 INFO L226 Difference]: Without dead ends: 1213 [2021-08-26 08:30:35,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2021-08-26 08:30:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1068. [2021-08-26 08:30:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1066 states have (on average 1.7195121951219512) internal successors, (1833), 1067 states have internal predecessors, (1833), 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:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1833 transitions. [2021-08-26 08:30:35,258 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1833 transitions. Word has length 59 [2021-08-26 08:30:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:35,258 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 1833 transitions. [2021-08-26 08:30:35,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1833 transitions. [2021-08-26 08:30:35,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-26 08:30:35,260 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:35,260 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] [2021-08-26 08:30:35,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 08:30:35,260 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:35,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1318592951, now seen corresponding path program 1 times [2021-08-26 08:30:35,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:35,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372820815] [2021-08-26 08:30:35,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:35,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:35,297 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:35,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:35,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372820815] [2021-08-26 08:30:35,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372820815] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:35,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:35,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 08:30:35,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316957414] [2021-08-26 08:30:35,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 08:30:35,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:35,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 08:30:35,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 08:30:35,299 INFO L87 Difference]: Start difference. First operand 1068 states and 1833 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:35,379 INFO L93 Difference]: Finished difference Result 3077 states and 5307 transitions. [2021-08-26 08:30:35,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 08:30:35,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 60 [2021-08-26 08:30:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:35,386 INFO L225 Difference]: With dead ends: 3077 [2021-08-26 08:30:35,386 INFO L226 Difference]: Without dead ends: 2047 [2021-08-26 08:30:35,387 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:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2021-08-26 08:30:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1902. [2021-08-26 08:30:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1900 states have (on average 1.731578947368421) internal successors, (3290), 1901 states have internal predecessors, (3290), 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:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 3290 transitions. [2021-08-26 08:30:35,459 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 3290 transitions. Word has length 60 [2021-08-26 08:30:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:35,460 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 3290 transitions. [2021-08-26 08:30:35,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3290 transitions. [2021-08-26 08:30:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-26 08:30:35,462 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:30:35,462 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] [2021-08-26 08:30:35,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 08:30:35,463 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:30:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:30:35,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1559369011, now seen corresponding path program 1 times [2021-08-26 08:30:35,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:30:35,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590623609] [2021-08-26 08:30:35,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:30:35,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:30:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:30:35,510 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:35,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:30:35,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590623609] [2021-08-26 08:30:35,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590623609] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:30:35,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:30:35,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 08:30:35,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067641421] [2021-08-26 08:30:35,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 08:30:35,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:30:35,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 08:30:35,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 08:30:35,512 INFO L87 Difference]: Start difference. First operand 1902 states and 3290 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:30:35,606 INFO L93 Difference]: Finished difference Result 1933 states and 3332 transitions. [2021-08-26 08:30:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 08:30:35,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 61 [2021-08-26 08:30:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:30:35,606 INFO L225 Difference]: With dead ends: 1933 [2021-08-26 08:30:35,606 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 08:30:35,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:30:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 08:30:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 08:30:35,609 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:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 08:30:35,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2021-08-26 08:30:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:30:35,609 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 08:30:35,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 08:30:35,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 08:30:35,612 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 08:30:35,612 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 08:30:35,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 08:30:35,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 08:30:35,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:35,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:35,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:35,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:35,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:35,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:35,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:35,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:35,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:35,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:35,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:35,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:36,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:37,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 08:30:42,111 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 199) no Hoare annotation was computed. [2021-08-26 08:30:42,111 INFO L857 garLoopResultBuilder]: For program point L498(lines 498 502) no Hoare annotation was computed. [2021-08-26 08:30:42,111 INFO L853 garLoopResultBuilder]: At program point L498-2(lines 491 506) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1)) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:30:42,111 INFO L857 garLoopResultBuilder]: For program point L498-3(lines 498 502) no Hoare annotation was computed. [2021-08-26 08:30:42,111 INFO L853 garLoopResultBuilder]: At program point L498-5(lines 491 506) 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) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-08-26 08:30:42,112 INFO L857 garLoopResultBuilder]: For program point L498-6(lines 498 502) no Hoare annotation was computed. [2021-08-26 08:30:42,112 INFO L853 garLoopResultBuilder]: At program point L498-8(lines 491 506) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1))) (or (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:30:42,112 INFO L857 garLoopResultBuilder]: For program point L532(lines 532 540) no Hoare annotation was computed. [2021-08-26 08:30:42,112 INFO L857 garLoopResultBuilder]: For program point L532-2(lines 532 540) no Hoare annotation was computed. [2021-08-26 08:30:42,112 INFO L857 garLoopResultBuilder]: For program point L532-4(lines 532 540) no Hoare annotation was computed. [2021-08-26 08:30:42,112 INFO L857 garLoopResultBuilder]: For program point L2184(lines 2184 2200) no Hoare annotation was computed. [2021-08-26 08:30:42,112 INFO L857 garLoopResultBuilder]: For program point L2184-1(lines 2184 2200) no Hoare annotation was computed. [2021-08-26 08:30:42,112 INFO L857 garLoopResultBuilder]: For program point L368(lines 368 372) no Hoare annotation was computed. [2021-08-26 08:30:42,112 INFO L857 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2021-08-26 08:30:42,112 INFO L853 garLoopResultBuilder]: At program point L368-1(lines 243 386) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,112 INFO L857 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-08-26 08:30:42,112 INFO L853 garLoopResultBuilder]: At program point L535-2(lines 528 543) 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) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:30:42,113 INFO L857 garLoopResultBuilder]: For program point L535-3(lines 535 539) no Hoare annotation was computed. [2021-08-26 08:30:42,113 INFO L853 garLoopResultBuilder]: At program point L535-5(lines 528 543) 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 (= ULTIMATE.start_main_~tmp~1 1)) (.cse5 (= ~rjh~0 2)) (.cse6 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse7 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse8 (= 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 .cse7 .cse8 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_setEmailTo_~handle 1) .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-08-26 08:30:42,113 INFO L857 garLoopResultBuilder]: For program point L535-6(lines 535 539) no Hoare annotation was computed. [2021-08-26 08:30:42,113 INFO L853 garLoopResultBuilder]: At program point L535-8(lines 528 543) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:30:42,113 INFO L853 garLoopResultBuilder]: At program point L305(lines 295 381) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,113 INFO L853 garLoopResultBuilder]: At program point L272(lines 262 384) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,113 INFO L857 garLoopResultBuilder]: For program point L173(lines 173 180) no Hoare annotation was computed. [2021-08-26 08:30:42,113 INFO L857 garLoopResultBuilder]: For program point L2188(lines 2188 2199) no Hoare annotation was computed. [2021-08-26 08:30:42,113 INFO L860 garLoopResultBuilder]: At program point L173-1(lines 173 180) the Hoare annotation is: true [2021-08-26 08:30:42,114 INFO L857 garLoopResultBuilder]: For program point L2188-1(lines 2188 2199) no Hoare annotation was computed. [2021-08-26 08:30:42,114 INFO L857 garLoopResultBuilder]: For program point L2255(lines 2255 2267) no Hoare annotation was computed. [2021-08-26 08:30:42,114 INFO L857 garLoopResultBuilder]: For program point L2255-2(lines 2255 2267) no Hoare annotation was computed. [2021-08-26 08:30:42,114 INFO L857 garLoopResultBuilder]: For program point L2255-4(lines 2255 2267) no Hoare annotation was computed. [2021-08-26 08:30:42,114 INFO L857 garLoopResultBuilder]: For program point L439(lines 439 450) no Hoare annotation was computed. [2021-08-26 08:30:42,114 INFO L857 garLoopResultBuilder]: For program point L439-1(lines 439 450) no Hoare annotation was computed. [2021-08-26 08:30:42,114 INFO L853 garLoopResultBuilder]: At program point L341(lines 331 378) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,114 INFO L857 garLoopResultBuilder]: For program point L2258(lines 2258 2266) no Hoare annotation was computed. [2021-08-26 08:30:42,114 INFO L857 garLoopResultBuilder]: For program point L2258-2(lines 2258 2266) no Hoare annotation was computed. [2021-08-26 08:30:42,114 INFO L857 garLoopResultBuilder]: For program point L2192(lines 2192 2198) no Hoare annotation was computed. [2021-08-26 08:30:42,115 INFO L857 garLoopResultBuilder]: For program point L2258-4(lines 2258 2266) no Hoare annotation was computed. [2021-08-26 08:30:42,115 INFO L857 garLoopResultBuilder]: For program point L2192-1(lines 2192 2198) no Hoare annotation was computed. [2021-08-26 08:30:42,115 INFO L857 garLoopResultBuilder]: For program point L310(lines 310 317) no Hoare annotation was computed. [2021-08-26 08:30:42,115 INFO L853 garLoopResultBuilder]: At program point L2391(lines 2386 2394) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-08-26 08:30:42,115 INFO L857 garLoopResultBuilder]: For program point L277(lines 277 281) no Hoare annotation was computed. [2021-08-26 08:30:42,115 INFO L857 garLoopResultBuilder]: For program point L244(lines 243 386) no Hoare annotation was computed. [2021-08-26 08:30:42,115 INFO L857 garLoopResultBuilder]: For program point L476(lines 476 487) no Hoare annotation was computed. [2021-08-26 08:30:42,115 INFO L857 garLoopResultBuilder]: For program point L443(lines 443 449) no Hoare annotation was computed. [2021-08-26 08:30:42,115 INFO L857 garLoopResultBuilder]: For program point L476-1(lines 476 487) no Hoare annotation was computed. [2021-08-26 08:30:42,116 INFO L857 garLoopResultBuilder]: For program point L443-1(lines 443 449) no Hoare annotation was computed. [2021-08-26 08:30:42,116 INFO L857 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2021-08-26 08:30:42,116 INFO L857 garLoopResultBuilder]: For program point L2261(lines 2261 2265) no Hoare annotation was computed. [2021-08-26 08:30:42,116 INFO L857 garLoopResultBuilder]: For program point L2261-3(lines 2261 2265) no Hoare annotation was computed. [2021-08-26 08:30:42,116 INFO L853 garLoopResultBuilder]: At program point L2261-2(lines 1 2541) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (= ULTIMATE.start_main_~tmp~1 1) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,116 INFO L853 garLoopResultBuilder]: At program point L2261-5(lines 1 2541) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1)) (= ULTIMATE.start_setClientId_~handle 2)) [2021-08-26 08:30:42,116 INFO L857 garLoopResultBuilder]: For program point L2261-6(lines 2261 2265) no Hoare annotation was computed. [2021-08-26 08:30:42,116 INFO L853 garLoopResultBuilder]: At program point L2261-8(lines 1 2541) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_client_forwardReceiver1~0 0) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,116 INFO L857 garLoopResultBuilder]: For program point L346(lines 346 350) no Hoare annotation was computed. [2021-08-26 08:30:42,116 INFO L860 garLoopResultBuilder]: At program point L181(lines 163 183) the Hoare annotation is: true [2021-08-26 08:30:42,117 INFO L853 garLoopResultBuilder]: At program point L2197-1(lines 2180 2203) 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_main_~tmp~1 1)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_getClientForwardReceiver_#res| 0)) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_createEmail_~to) .cse3 .cse4 (= ~rjh~0 2) .cse5 .cse6))) [2021-08-26 08:30:42,117 INFO L853 garLoopResultBuilder]: At program point L2197(lines 2180 2203) 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) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1) (= 2 ULTIMATE.start_incoming_~client)) [2021-08-26 08:30:42,117 INFO L857 garLoopResultBuilder]: For program point L513(lines 513 524) no Hoare annotation was computed. [2021-08-26 08:30:42,117 INFO L857 garLoopResultBuilder]: For program point L480(lines 480 486) no Hoare annotation was computed. [2021-08-26 08:30:42,117 INFO L857 garLoopResultBuilder]: For program point L513-1(lines 513 524) no Hoare annotation was computed. [2021-08-26 08:30:42,117 INFO L857 garLoopResultBuilder]: For program point L513-2(lines 513 524) no Hoare annotation was computed. [2021-08-26 08:30:42,117 INFO L857 garLoopResultBuilder]: For program point L480-1(lines 480 486) no Hoare annotation was computed. [2021-08-26 08:30:42,117 INFO L857 garLoopResultBuilder]: For program point L513-3(lines 513 524) no Hoare annotation was computed. [2021-08-26 08:30:42,117 INFO L857 garLoopResultBuilder]: For program point L2231-1(lines 2231 2247) no Hoare annotation was computed. [2021-08-26 08:30:42,117 INFO L857 garLoopResultBuilder]: For program point L2231(lines 2231 2247) no Hoare annotation was computed. [2021-08-26 08:30:42,118 INFO L857 garLoopResultBuilder]: For program point L117(lines 117 125) no Hoare annotation was computed. [2021-08-26 08:30:42,118 INFO L853 garLoopResultBuilder]: At program point L448(lines 435 453) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse2 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ULTIMATE.start_main_~tmp~1 1)) (.cse7 (= ~rjh~0 2)) (.cse8 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse9 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse10 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_setEmailTo_~handle 1) .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse0 .cse1 .cse2 .cse3 (= ~__ste_email_to0~0 2) .cse4 .cse5 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:30:42,118 INFO L860 garLoopResultBuilder]: At program point L448-1(lines 435 453) the Hoare annotation is: true [2021-08-26 08:30:42,118 INFO L853 garLoopResultBuilder]: At program point L283(lines 273 383) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,118 INFO L853 garLoopResultBuilder]: At program point L2530(lines 1 2541) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,118 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 08:30:42,118 INFO L857 garLoopResultBuilder]: For program point L251(lines 251 385) no Hoare annotation was computed. [2021-08-26 08:30:42,118 INFO L857 garLoopResultBuilder]: For program point L517(lines 517 523) no Hoare annotation was computed. [2021-08-26 08:30:42,118 INFO L857 garLoopResultBuilder]: For program point L517-1(lines 517 523) no Hoare annotation was computed. [2021-08-26 08:30:42,119 INFO L857 garLoopResultBuilder]: For program point L517-2(lines 517 523) no Hoare annotation was computed. [2021-08-26 08:30:42,119 INFO L857 garLoopResultBuilder]: For program point L517-3(lines 517 523) no Hoare annotation was computed. [2021-08-26 08:30:42,119 INFO L853 garLoopResultBuilder]: At program point L2400(lines 2395 2403) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-08-26 08:30:42,119 INFO L853 garLoopResultBuilder]: At program point L352(lines 342 377) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,119 INFO L853 garLoopResultBuilder]: At program point L319(lines 306 380) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,119 INFO L857 garLoopResultBuilder]: For program point L2235-1(lines 2235 2246) no Hoare annotation was computed. [2021-08-26 08:30:42,119 INFO L857 garLoopResultBuilder]: For program point L2235(lines 2235 2246) no Hoare annotation was computed. [2021-08-26 08:30:42,119 INFO L853 garLoopResultBuilder]: At program point L485(lines 472 490) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse2 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ULTIMATE.start_main_~tmp~1 1)) (.cse7 (= ~rjh~0 2)) (.cse8 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse9 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse10 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_setEmailTo_~handle 1) .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse0 .cse1 .cse2 .cse3 (= ~__ste_email_to0~0 2) .cse4 .cse5 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:30:42,119 INFO L860 garLoopResultBuilder]: At program point L485-1(lines 472 490) the Hoare annotation is: true [2021-08-26 08:30:42,120 INFO L853 garLoopResultBuilder]: At program point L387(lines 242 388) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,120 INFO L857 garLoopResultBuilder]: For program point L288(lines 288 292) no Hoare annotation was computed. [2021-08-26 08:30:42,120 INFO L857 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2021-08-26 08:30:42,120 INFO L853 garLoopResultBuilder]: At program point L2337-1(lines 1 2541) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-08-26 08:30:42,120 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 08:30:42,120 INFO L857 garLoopResultBuilder]: For program point L2337(lines 2337 2344) no Hoare annotation was computed. [2021-08-26 08:30:42,120 INFO L857 garLoopResultBuilder]: For program point L2337-2(lines 2337 2344) no Hoare annotation was computed. [2021-08-26 08:30:42,120 INFO L853 garLoopResultBuilder]: At program point L2503(lines 2492 2506) 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) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:30:42,120 INFO L857 garLoopResultBuilder]: For program point L2239-1(lines 2239 2245) no Hoare annotation was computed. [2021-08-26 08:30:42,120 INFO L857 garLoopResultBuilder]: For program point L2239(lines 2239 2245) no Hoare annotation was computed. [2021-08-26 08:30:42,121 INFO L853 garLoopResultBuilder]: At program point L522(lines 509 527) 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) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-08-26 08:30:42,121 INFO L853 garLoopResultBuilder]: At program point L522-1(lines 509 527) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_main_~tmp~1 1)) (.cse6 (= ~rjh~0 2)) (.cse7 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse8 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse9 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-08-26 08:30:42,121 INFO L853 garLoopResultBuilder]: At program point L522-2(lines 509 527) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:30:42,121 INFO L860 garLoopResultBuilder]: At program point L522-3(lines 509 527) the Hoare annotation is: true [2021-08-26 08:30:42,121 INFO L860 garLoopResultBuilder]: At program point L2471-1(lines 2446 2473) the Hoare annotation is: true [2021-08-26 08:30:42,121 INFO L853 garLoopResultBuilder]: At program point L2471(lines 2446 2473) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_main_~tmp~1 1)) (.cse6 (= ~rjh~0 2)) (.cse7 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse8 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse9 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-08-26 08:30:42,121 INFO L857 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2021-08-26 08:30:42,121 INFO L857 garLoopResultBuilder]: For program point L324(lines 324 328) no Hoare annotation was computed. [2021-08-26 08:30:42,121 INFO L857 garLoopResultBuilder]: For program point L1183(lines 1183 1189) no Hoare annotation was computed. [2021-08-26 08:30:42,122 INFO L857 garLoopResultBuilder]: For program point L1183-2(lines 1183 1189) no Hoare annotation was computed. [2021-08-26 08:30:42,122 INFO L853 garLoopResultBuilder]: At program point L2538(lines 2533 2541) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,122 INFO L857 garLoopResultBuilder]: For program point L2208(lines 2208 2220) no Hoare annotation was computed. [2021-08-26 08:30:42,122 INFO L853 garLoopResultBuilder]: At program point L160(lines 140 162) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_client_forwardReceiver1~0 0) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,122 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 08:30:42,122 INFO L853 garLoopResultBuilder]: At program point L294(lines 284 382) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,122 INFO L853 garLoopResultBuilder]: At program point L261(lines 251 385) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,122 INFO L853 garLoopResultBuilder]: At program point L2409(lines 2404 2412) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse7 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-08-26 08:30:42,122 INFO L853 garLoopResultBuilder]: At program point L2244(lines 2227 2250) 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) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1)) [2021-08-26 08:30:42,123 INFO L857 garLoopResultBuilder]: For program point L2211(lines 2211 2219) no Hoare annotation was computed. [2021-08-26 08:30:42,123 INFO L853 garLoopResultBuilder]: At program point L2244-1(lines 2227 2250) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ULTIMATE.start_main_~tmp~1 1)) (.cse4 (= ~rjh~0 2)) (.cse5 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse6 (= ULTIMATE.start_createEmail_~msg~0 1))) (or (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0)) .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:30:42,123 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 08:30:42,123 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 199) no Hoare annotation was computed. [2021-08-26 08:30:42,123 INFO L857 garLoopResultBuilder]: For program point L495(lines 495 503) no Hoare annotation was computed. [2021-08-26 08:30:42,123 INFO L857 garLoopResultBuilder]: For program point L495-2(lines 495 503) no Hoare annotation was computed. [2021-08-26 08:30:42,123 INFO L853 garLoopResultBuilder]: At program point L363(lines 353 376) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,123 INFO L857 garLoopResultBuilder]: For program point L495-4(lines 495 503) no Hoare annotation was computed. [2021-08-26 08:30:42,123 INFO L853 garLoopResultBuilder]: At program point L330(lines 320 379) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,124 INFO L857 garLoopResultBuilder]: For program point L2214(lines 2214 2218) no Hoare annotation was computed. [2021-08-26 08:30:42,124 INFO L857 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2021-08-26 08:30:42,124 INFO L857 garLoopResultBuilder]: For program point L199-1(line 199) no Hoare annotation was computed. [2021-08-26 08:30:42,124 INFO L853 garLoopResultBuilder]: At program point L2214-2(lines 1 2541) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (not (= ~__ste_email_to0~0 1))) [2021-08-26 08:30:42,124 INFO L853 garLoopResultBuilder]: At program point L2479-1(lines 2474 2482) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_main_~tmp~1 1)) (.cse6 (= ~rjh~0 2)) (.cse7 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse8 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse9 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-08-26 08:30:42,124 INFO L853 garLoopResultBuilder]: At program point L2479(lines 2474 2482) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse2 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_main_~tmp~1 1)) (.cse6 (= ~rjh~0 2)) (.cse7 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse8 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse9 (= ULTIMATE.start_outgoing_~msg 1))) (or (and (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse0 .cse1 .cse2 .cse3 (= ~__ste_email_to0~0 2) .cse4 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-08-26 08:30:42,124 INFO L860 garLoopResultBuilder]: At program point L2479-3(lines 2474 2482) the Hoare annotation is: true [2021-08-26 08:30:42,124 INFO L853 garLoopResultBuilder]: At program point L2479-2(lines 2474 2482) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:30:42,124 INFO L857 garLoopResultBuilder]: For program point L299(lines 299 303) no Hoare annotation was computed. [2021-08-26 08:30:42,125 INFO L853 garLoopResultBuilder]: At program point L2314(lines 1 2541) 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) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1) (= ULTIMATE.start_outgoing_~msg 1) (= 2 ULTIMATE.start_incoming_~client)) [2021-08-26 08:30:42,125 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2021-08-26 08:30:42,125 INFO L853 garLoopResultBuilder]: At program point L200(lines 1175 1192) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse2 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (not (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 0))) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ULTIMATE.start_main_~tmp~1 1)) (.cse7 (= ~rjh~0 2)) (.cse8 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse9 (= ULTIMATE.start_createEmail_~msg~0 1)) (.cse10 (= ULTIMATE.start_outgoing_~msg 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_setEmailTo_~handle 1) .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse0 .cse1 .cse2 .cse3 (= ~__ste_email_to0~0 2) .cse4 .cse5 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_incoming_~client)))) [2021-08-26 08:30:42,125 INFO L853 garLoopResultBuilder]: At program point L2314-1(lines 1 2541) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_main_~tmp~1 1) (= ~rjh~0 2) (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_createEmail_~msg~0 1)) [2021-08-26 08:30:42,125 INFO L860 garLoopResultBuilder]: At program point L200-1(lines 1175 1192) the Hoare annotation is: true [2021-08-26 08:30:42,128 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 08:30:42,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:30:42 BoogieIcfgContainer [2021-08-26 08:30:42,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 08:30:42,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 08:30:42,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 08:30:42,149 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 08:30:42,149 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:31" (3/4) ... [2021-08-26 08:30:42,151 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 08:30:42,164 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2021-08-26 08:30:42,165 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2021-08-26 08:30:42,165 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-08-26 08:30:42,166 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-26 08:30:42,167 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 08:30:42,168 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 08:30:42,184 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,184 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && tmp == 1) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,184 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((__ste_client_forwardReceiver1 == 0 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1)) && handle == 2 [2021-08-26 08:30:42,184 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && __ste_client_forwardReceiver1 == 0) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,185 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && __ste_client_forwardReceiver1 == 0) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,185 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,185 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,185 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,185 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,185 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,187 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) [2021-08-26 08:30:42,187 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1)) && msg == 1 [2021-08-26 08:30:42,187 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-08-26 08:30:42,187 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-08-26 08:30:42,187 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 [2021-08-26 08:30:42,188 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 [2021-08-26 08:30:42,188 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) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 [2021-08-26 08:30:42,188 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) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client [2021-08-26 08:30:42,188 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) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client [2021-08-26 08:30:42,188 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-08-26 08:30:42,188 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) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || (((((((((handle == 3 && handle == 1) && \result == 1) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-08-26 08:30:42,189 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-08-26 08:30:42,189 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-08-26 08:30:42,189 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-08-26 08:30:42,189 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-08-26 08:30:42,189 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:30:42,189 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) || (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && 2 == client) [2021-08-26 08:30:42,190 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:30:42,190 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) || (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && 2 == client) [2021-08-26 08:30:42,190 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) [2021-08-26 08:30:42,190 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-08-26 08:30:42,190 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-08-26 08:30:42,190 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-08-26 08:30:42,190 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && !(rjh == 1)) && \result == 1) && !(to == 1)) && tmp == 1) && \result == 1) && msg == 1) && \result == 0) || ((((((((handle == 3 && !(rjh == 1)) && \result == 1) && 2 == to) && !(to == 1)) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) [2021-08-26 08:30:42,190 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-08-26 08:30:42,191 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) [2021-08-26 08:30:42,191 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-08-26 08:30:42,191 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && !(\result == 0)) && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 [2021-08-26 08:30:42,503 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 08:30:42,503 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 08:30:42,505 INFO L168 Benchmark]: Toolchain (without parser) took 12368.85 ms. Allocated memory was 58.7 MB in the beginning and 352.3 MB in the end (delta: 293.6 MB). Free memory was 35.4 MB in the beginning and 147.8 MB in the end (delta: -112.5 MB). Peak memory consumption was 179.7 MB. Max. memory is 16.1 GB. [2021-08-26 08:30:42,505 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 58.7 MB. Free memory was 41.0 MB in the beginning and 40.9 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 08:30:42,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.67 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 35.2 MB in the beginning and 36.3 MB in the end (delta: -1.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-26 08:30:42,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.88 ms. Allocated memory is still 75.5 MB. Free memory was 57.2 MB in the beginning and 52.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 08:30:42,506 INFO L168 Benchmark]: Boogie Preprocessor took 51.02 ms. Allocated memory is still 75.5 MB. Free memory was 52.3 MB in the beginning and 48.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 08:30:42,506 INFO L168 Benchmark]: RCFGBuilder took 864.17 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 48.8 MB in the beginning and 87.4 MB in the end (delta: -38.6 MB). Peak memory consumption was 35.5 MB. Max. memory is 16.1 GB. [2021-08-26 08:30:42,506 INFO L168 Benchmark]: TraceAbstraction took 10541.08 ms. Allocated memory was 111.1 MB in the beginning and 352.3 MB in the end (delta: 241.2 MB). Free memory was 87.0 MB in the beginning and 164.6 MB in the end (delta: -77.6 MB). Peak memory consumption was 216.1 MB. Max. memory is 16.1 GB. [2021-08-26 08:30:42,506 INFO L168 Benchmark]: Witness Printer took 355.12 ms. Allocated memory is still 352.3 MB. Free memory was 164.6 MB in the beginning and 147.8 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-26 08:30:42,507 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 58.7 MB. Free memory was 41.0 MB in the beginning and 40.9 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 481.67 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 35.2 MB in the beginning and 36.3 MB in the end (delta: -1.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.88 ms. Allocated memory is still 75.5 MB. Free memory was 57.2 MB in the beginning and 52.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.02 ms. Allocated memory is still 75.5 MB. Free memory was 52.3 MB in the beginning and 48.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 864.17 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 48.8 MB in the beginning and 87.4 MB in the end (delta: -38.6 MB). Peak memory consumption was 35.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10541.08 ms. Allocated memory was 111.1 MB in the beginning and 352.3 MB in the end (delta: 241.2 MB). Free memory was 87.0 MB in the beginning and 164.6 MB in the end (delta: -77.6 MB). Peak memory consumption was 216.1 MB. Max. memory is 16.1 GB. * Witness Printer took 355.12 ms. Allocated memory is still 352.3 MB. Free memory was 164.6 MB in the beginning and 147.8 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 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: 199]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 199]: 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, 134 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10471.9ms, OverallIterations: 17, TraceHistogramMax: 3, EmptinessCheckTime: 29.3ms, AutomataDifference: 1661.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 6498.1ms, InitialAbstractionConstructionTime: 11.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3584 SDtfs, 5529 SDslu, 5942 SDs, 0 SdLazy, 519 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 417.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 533.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1902occurred in iteration=16, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 362.4ms AutomataMinimizationTime, 17 MinimizatonAttempts, 1787 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 54 LocationsWithAnnotation, 54 PreInvPairs, 936 NumberOfFragments, 1830 HoareAnnotationTreeSize, 54 FomulaSimplifications, 23999192 FormulaSimplificationTreeSizeReduction, 1753.9ms HoareSimplificationTime, 54 FomulaSimplificationsInter, 732586 FormulaSimplificationTreeSizeReductionInter, 4723.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 121.3ms SsaConstructionTime, 380.6ms SatisfiabilityAnalysisTime, 852.4ms InterpolantComputationTime, 882 NumberOfCodeBlocks, 882 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 864 ConstructedInterpolants, 0 QuantifiedInterpolants, 1328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 734 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 98/102 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: 2474]: Loop Invariant Derived loop invariant: ((((((handle == 3 && !(\result == 0)) && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 2404]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 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: ((((handle == 3 && __ste_client_forwardReceiver1 == 0) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1175]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2474]: Loop Invariant Derived loop invariant: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((handle == 3 && __ste_client_forwardReceiver1 == 0) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2180]: Loop Invariant Derived loop invariant: (((((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__ste_client_forwardReceiver1 == 0 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1)) && handle == 2 - InvariantResult [Line: 2386]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && tmp == 1) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2474]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2474]: Loop Invariant Derived loop invariant: (((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2227]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) || (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1175]: Loop Invariant Derived loop invariant: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2492]: Loop Invariant Derived loop invariant: ((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2446]: Loop Invariant Derived loop invariant: 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) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((2 == \result && handle == 3) && handle == 1) && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || (((((((((handle == 3 && handle == 1) && \result == 1) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) || (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 2180]: Loop Invariant Derived loop invariant: (((((((handle == 3 && !(rjh == 1)) && \result == 1) && !(to == 1)) && tmp == 1) && \result == 1) && msg == 1) && \result == 0) || ((((((((handle == 3 && !(rjh == 1)) && \result == 1) && 2 == to) && !(to == 1)) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((handle == 3 && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 2533]: Loop Invariant Derived loop invariant: ((!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((((((handle == 3 && handle == 1) && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) || ((((((((((((((2 == \result && handle == 3) && handle == 1) && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) - InvariantResult [Line: 2227]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (((((handle == 3 && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1)) && msg == 1 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && value == 2) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1 - InvariantResult [Line: 2395]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && \result == 1) && __ste_email_to0 == 2) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 2446]: Loop Invariant Derived loop invariant: ((((((((((((handle == 3 && !(\result == 0)) && \result == 1) && __ste_email_to0 == 2) && !(tmp == 0)) && 2 == to) && 2 == handle) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) && 2 == client) || ((((((((((handle == 3 && !(\result == 0)) && \result == 1) && !(tmp == 0)) && 2 == to) && handle == 1) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1) && msg == 1) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((handle == 3 && \result == 1) && 2 == to) && tmp == 1) && rjh == 2) && \result == 1) && msg == 1 - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: (((handle == 3 && tmp == 1) && rjh == 2) && \result == 1) && !(__ste_email_to0 == 1) RESULT: Ultimate proved your program to be correct! [2021-08-26 08:30:42,562 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...