/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec11_product10.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 18:00:54,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 18:00:54,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 18:00:54,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 18:00:54,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 18:00:54,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 18:00:54,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 18:00:54,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 18:00:54,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 18:00:54,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 18:00:54,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 18:00:54,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 18:00:54,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 18:00:54,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 18:00:54,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 18:00:54,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 18:00:54,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 18:00:54,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 18:00:54,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 18:00:54,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 18:00:54,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 18:00:54,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 18:00:54,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 18:00:54,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 18:00:54,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 18:00:54,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 18:00:54,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 18:00:54,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 18:00:54,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 18:00:54,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 18:00:54,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 18:00:54,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 18:00:54,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 18:00:54,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 18:00:54,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 18:00:54,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 18:00:54,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 18:00:54,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 18:00:54,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 18:00:54,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 18:00:54,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 18:00:54,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 18:00:54,342 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 18:00:54,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 18:00:54,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 18:00:54,343 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 18:00:54,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 18:00:54,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 18:00:54,347 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 18:00:54,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 18:00:54,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 18:00:54,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 18:00:54,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 18:00:54,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 18:00:54,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 18:00:54,348 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 18:00:54,348 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 18:00:54,348 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 18:00:54,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 18:00:54,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 18:00:54,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 18:00:54,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 18:00:54,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 18:00:54,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:00:54,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 18:00:54,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 18:00:54,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 18:00:54,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 18:00:54,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 18:00:54,350 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 18:00:54,351 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 18:00:54,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 18:00:54,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 18:00:54,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 18:00:54,352 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 18:00:54,352 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 18:00:54,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 18:00:54,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 18:00:54,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 18:00:54,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 18:00:54,549 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 18:00:54,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product10.cil.c [2022-01-10 18:00:54,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b378ba467/ffa377b13b0341209bac479ed09a35af/FLAGe89e8f57f [2022-01-10 18:00:55,012 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 18:00:55,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product10.cil.c [2022-01-10 18:00:55,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b378ba467/ffa377b13b0341209bac479ed09a35af/FLAGe89e8f57f [2022-01-10 18:00:55,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b378ba467/ffa377b13b0341209bac479ed09a35af [2022-01-10 18:00:55,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 18:00:55,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 18:00:55,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 18:00:55,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 18:00:55,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 18:00:55,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b26730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55, skipping insertion in model container [2022-01-10 18:00:55,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 18:00:55,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 18:00:55,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product10.cil.c[53446,53459] [2022-01-10 18:00:55,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:00:55,442 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 18:00:55,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 18:00:55,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product10.cil.c[53446,53459] [2022-01-10 18:00:55,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:00:55,559 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 18:00:55,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product10.cil.c[53446,53459] [2022-01-10 18:00:55,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:00:55,667 INFO L208 MainTranslator]: Completed translation [2022-01-10 18:00:55,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55 WrapperNode [2022-01-10 18:00:55,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 18:00:55,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 18:00:55,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 18:00:55,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 18:00:55,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,757 INFO L137 Inliner]: procedures = 112, calls = 135, calls flagged for inlining = 62, calls inlined = 77, statements flattened = 1035 [2022-01-10 18:00:55,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 18:00:55,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 18:00:55,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 18:00:55,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 18:00:55,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 18:00:55,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 18:00:55,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 18:00:55,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 18:00:55,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55" (1/1) ... [2022-01-10 18:00:55,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:00:55,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:00:55,867 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) [2022-01-10 18:00:55,878 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 [2022-01-10 18:00:55,896 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2022-01-10 18:00:55,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 18:00:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 18:00:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 18:00:55,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 18:00:56,027 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 18:00:56,028 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 18:00:56,537 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 18:00:56,544 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 18:00:56,545 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 18:00:56,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:00:56 BoogieIcfgContainer [2022-01-10 18:00:56,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 18:00:56,548 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 18:00:56,548 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 18:00:56,549 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 18:00:56,550 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:00:56" (1/1) ... [2022-01-10 18:00:56,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:00:56 BasicIcfg [2022-01-10 18:00:56,762 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 18:00:56,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 18:00:56,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 18:00:56,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 18:00:56,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:00:55" (1/4) ... [2022-01-10 18:00:56,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4b55b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:00:56, skipping insertion in model container [2022-01-10 18:00:56,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:55" (2/4) ... [2022-01-10 18:00:56,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4b55b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:00:56, skipping insertion in model container [2022-01-10 18:00:56,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:00:56" (3/4) ... [2022-01-10 18:00:56,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4b55b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:00:56, skipping insertion in model container [2022-01-10 18:00:56,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:00:56" (4/4) ... [2022-01-10 18:00:56,767 INFO L111 eAbstractionObserver]: Analyzing ICFG email_spec11_product10.cil.cTransformedIcfg [2022-01-10 18:00:56,771 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 18:00:56,771 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 18:00:56,814 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 18:00:56,821 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 18:00:56,821 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 18:00:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 185 states have (on average 1.5621621621621622) internal successors, (289), 187 states have internal predecessors, (289), 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) [2022-01-10 18:00:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 18:00:56,844 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:00:56,844 INFO L514 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] [2022-01-10 18:00:56,844 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:00:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:00:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash 697381946, now seen corresponding path program 1 times [2022-01-10 18:00:56,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:00:56,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265067830] [2022-01-10 18:00:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:00:56,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:00:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:00:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:00:57,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:00:57,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265067830] [2022-01-10 18:00:57,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265067830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:00:57,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:00:57,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 18:00:57,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996790116] [2022-01-10 18:00:57,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:00:57,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 18:00:57,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:00:57,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 18:00:57,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 18:00:57,145 INFO L87 Difference]: Start difference. First operand has 188 states, 185 states have (on average 1.5621621621621622) internal successors, (289), 187 states have internal predecessors, (289), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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) [2022-01-10 18:00:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:00:57,167 INFO L93 Difference]: Finished difference Result 317 states and 478 transitions. [2022-01-10 18:00:57,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 18:00:57,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2022-01-10 18:00:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:00:57,174 INFO L225 Difference]: With dead ends: 317 [2022-01-10 18:00:57,174 INFO L226 Difference]: Without dead ends: 146 [2022-01-10 18:00:57,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 18:00:57,183 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:00:57,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:00:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-01-10 18:00:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-01-10 18:00:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 145 states have internal predecessors, (224), 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) [2022-01-10 18:00:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2022-01-10 18:00:57,246 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 37 [2022-01-10 18:00:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:00:57,246 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2022-01-10 18:00:57,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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) [2022-01-10 18:00:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2022-01-10 18:00:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 18:00:57,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:00:57,247 INFO L514 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] [2022-01-10 18:00:57,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 18:00:57,248 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:00:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:00:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash -307563474, now seen corresponding path program 1 times [2022-01-10 18:00:57,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:00:57,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640988204] [2022-01-10 18:00:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:00:57,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:00:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:00:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:00:57,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:00:57,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640988204] [2022-01-10 18:00:57,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640988204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:00:57,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:00:57,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:00:57,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519417979] [2022-01-10 18:00:57,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:00:57,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:00:57,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:00:57,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:00:57,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:00:57,591 INFO L87 Difference]: Start difference. First operand 146 states and 224 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) [2022-01-10 18:00:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:00:57,658 INFO L93 Difference]: Finished difference Result 278 states and 428 transitions. [2022-01-10 18:00:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:00:57,663 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 [2022-01-10 18:00:57,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:00:57,666 INFO L225 Difference]: With dead ends: 278 [2022-01-10 18:00:57,666 INFO L226 Difference]: Without dead ends: 146 [2022-01-10 18:00:57,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:00:57,670 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 207 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:00:57,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 214 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:00:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-01-10 18:00:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-01-10 18:00:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 144 states have (on average 1.5416666666666667) internal successors, (222), 145 states have internal predecessors, (222), 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) [2022-01-10 18:00:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2022-01-10 18:00:57,685 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 38 [2022-01-10 18:00:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:00:57,686 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2022-01-10 18:00:57,686 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) [2022-01-10 18:00:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2022-01-10 18:00:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 18:00:57,687 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:00:57,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:00:57,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 18:00:57,690 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:00:57,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:00:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1749887116, now seen corresponding path program 1 times [2022-01-10 18:00:57,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:00:57,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046007834] [2022-01-10 18:00:57,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:00:57,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:00:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:00:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:00:57,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:00:57,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046007834] [2022-01-10 18:00:57,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046007834] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:00:57,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:00:57,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:00:57,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884848424] [2022-01-10 18:00:57,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:00:57,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:00:57,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:00:57,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:00:57,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:00:57,824 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:00:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:00:57,866 INFO L93 Difference]: Finished difference Result 277 states and 422 transitions. [2022-01-10 18:00:57,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:00:57,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-01-10 18:00:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:00:57,867 INFO L225 Difference]: With dead ends: 277 [2022-01-10 18:00:57,868 INFO L226 Difference]: Without dead ends: 150 [2022-01-10 18:00:57,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:00:57,874 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 201 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:00:57,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 228 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:00:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-01-10 18:00:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2022-01-10 18:00:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 144 states have (on average 1.5347222222222223) internal successors, (221), 145 states have internal predecessors, (221), 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) [2022-01-10 18:00:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2022-01-10 18:00:57,896 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 40 [2022-01-10 18:00:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:00:57,897 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2022-01-10 18:00:57,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:00:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2022-01-10 18:00:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 18:00:57,900 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:00:57,900 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:00:57,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 18:00:57,900 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:00:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:00:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash -950213925, now seen corresponding path program 1 times [2022-01-10 18:00:57,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:00:57,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809717348] [2022-01-10 18:00:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:00:57,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:00:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:00:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:00:58,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:00:58,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809717348] [2022-01-10 18:00:58,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809717348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:00:58,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:00:58,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:00:58,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004602546] [2022-01-10 18:00:58,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:00:58,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 18:00:58,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:00:58,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 18:00:58,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:00:58,034 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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) [2022-01-10 18:00:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:00:58,156 INFO L93 Difference]: Finished difference Result 460 states and 687 transitions. [2022-01-10 18:00:58,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 18:00:58,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2022-01-10 18:00:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:00:58,158 INFO L225 Difference]: With dead ends: 460 [2022-01-10 18:00:58,158 INFO L226 Difference]: Without dead ends: 394 [2022-01-10 18:00:58,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 18:00:58,159 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 546 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 18:00:58,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [546 Valid, 833 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 18:00:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-01-10 18:00:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 262. [2022-01-10 18:00:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 260 states have (on average 1.5576923076923077) internal successors, (405), 261 states have internal predecessors, (405), 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) [2022-01-10 18:00:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 405 transitions. [2022-01-10 18:00:58,176 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 405 transitions. Word has length 41 [2022-01-10 18:00:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:00:58,176 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 405 transitions. [2022-01-10 18:00:58,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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) [2022-01-10 18:00:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 405 transitions. [2022-01-10 18:00:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 18:00:58,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:00:58,177 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:00:58,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 18:00:58,177 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:00:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:00:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1521380365, now seen corresponding path program 1 times [2022-01-10 18:00:58,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:00:58,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398837056] [2022-01-10 18:00:58,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:00:58,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:00:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:00:58,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:00:58,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:00:58,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398837056] [2022-01-10 18:00:58,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398837056] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:00:58,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:00:58,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:00:58,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069161419] [2022-01-10 18:00:58,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:00:58,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 18:00:58,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:00:58,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 18:00:58,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:00:58,289 INFO L87 Difference]: Start difference. First operand 262 states and 405 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:00:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:00:58,423 INFO L93 Difference]: Finished difference Result 870 states and 1315 transitions. [2022-01-10 18:00:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 18:00:58,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-10 18:00:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:00:58,427 INFO L225 Difference]: With dead ends: 870 [2022-01-10 18:00:58,427 INFO L226 Difference]: Without dead ends: 750 [2022-01-10 18:00:58,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 18:00:58,428 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 423 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:00:58,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 892 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:00:58,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-01-10 18:00:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 495. [2022-01-10 18:00:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 493 states have (on average 1.5720081135902637) internal successors, (775), 494 states have internal predecessors, (775), 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) [2022-01-10 18:00:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 775 transitions. [2022-01-10 18:00:58,461 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 775 transitions. Word has length 42 [2022-01-10 18:00:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:00:58,462 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 775 transitions. [2022-01-10 18:00:58,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:00:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 775 transitions. [2022-01-10 18:00:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 18:00:58,463 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:00:58,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:00:58,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 18:00:58,464 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:00:58,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:00:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash 945908631, now seen corresponding path program 1 times [2022-01-10 18:00:58,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:00:58,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83616668] [2022-01-10 18:00:58,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:00:58,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:00:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:00:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:00:58,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:00:58,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83616668] [2022-01-10 18:00:58,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83616668] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:00:58,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:00:58,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:00:58,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41508097] [2022-01-10 18:00:58,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:00:58,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 18:00:58,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:00:58,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 18:00:58,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:00:58,593 INFO L87 Difference]: Start difference. First operand 495 states and 775 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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) [2022-01-10 18:00:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:00:58,765 INFO L93 Difference]: Finished difference Result 1693 states and 2577 transitions. [2022-01-10 18:00:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 18:00:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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 [2022-01-10 18:00:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:00:58,772 INFO L225 Difference]: With dead ends: 1693 [2022-01-10 18:00:58,772 INFO L226 Difference]: Without dead ends: 1464 [2022-01-10 18:00:58,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 18:00:58,775 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 422 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:00:58,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 892 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:00:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-01-10 18:00:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 962. [2022-01-10 18:00:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 1.5802083333333334) internal successors, (1517), 961 states have internal predecessors, (1517), 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) [2022-01-10 18:00:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1517 transitions. [2022-01-10 18:00:58,882 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1517 transitions. Word has length 43 [2022-01-10 18:00:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:00:58,882 INFO L470 AbstractCegarLoop]: Abstraction has 962 states and 1517 transitions. [2022-01-10 18:00:58,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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) [2022-01-10 18:00:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1517 transitions. [2022-01-10 18:00:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 18:00:58,887 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:00:58,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:00:58,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 18:00:58,888 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:00:58,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:00:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash 974537782, now seen corresponding path program 1 times [2022-01-10 18:00:58,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:00:58,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291651977] [2022-01-10 18:00:58,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:00:58,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:00:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:00:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:00:59,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:00:59,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291651977] [2022-01-10 18:00:59,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291651977] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:00:59,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:00:59,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:00:59,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233491716] [2022-01-10 18:00:59,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:00:59,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:00:59,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:00:59,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:00:59,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:00:59,028 INFO L87 Difference]: Start difference. First operand 962 states and 1517 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2022-01-10 18:00:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:00:59,221 INFO L93 Difference]: Finished difference Result 1490 states and 2267 transitions. [2022-01-10 18:00:59,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:00:59,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 [2022-01-10 18:00:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:00:59,235 INFO L225 Difference]: With dead ends: 1490 [2022-01-10 18:00:59,236 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 18:00:59,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:00:59,243 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 199 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:00:59,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 707 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:00:59,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 18:00:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 18:00:59,245 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) [2022-01-10 18:00:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 18:00:59,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-01-10 18:00:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:00:59,245 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 18:00:59,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2022-01-10 18:00:59,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 18:00:59,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 18:00:59,247 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 18:00:59,248 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 18:00:59,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 18:00:59,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 18:01:07,163 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 18:01:07,163 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 18:01:07,164 INFO L854 garLoopResultBuilder]: At program point L2590(lines 2586 2592) the Hoare annotation is: (and (<= ~__ste_client_autoResponse1~0Int 0) (<= ~__ste_client_autoResponse0~0Int 0) (<= ~__ste_client_autoResponse2~0Int 0)) [2022-01-10 18:01:07,164 INFO L854 garLoopResultBuilder]: At program point L2583(lines 2579 2585) the Hoare annotation is: (and (<= ~__ste_client_autoResponse1~0Int 0) (<= ~__ste_client_autoResponse0~0Int 0) (<= ~__ste_client_autoResponse2~0Int 0)) [2022-01-10 18:01:07,164 INFO L854 garLoopResultBuilder]: At program point L2598(lines 2593 2601) the Hoare annotation is: (and (<= ~__ste_client_autoResponse1~0Int 0) (<= ~__ste_client_autoResponse0~0Int 0) (<= ~__ste_client_autoResponse2~0Int 0)) [2022-01-10 18:01:07,164 INFO L858 garLoopResultBuilder]: For program point L2473(lines 2473 2480) no Hoare annotation was computed. [2022-01-10 18:01:07,167 INFO L858 garLoopResultBuilder]: For program point L1542(lines 1542 1554) no Hoare annotation was computed. [2022-01-10 18:01:07,167 INFO L858 garLoopResultBuilder]: For program point L2473-2(lines 2473 2480) no Hoare annotation was computed. [2022-01-10 18:01:07,168 INFO L854 garLoopResultBuilder]: At program point L1548-2(lines 1538 1557) the Hoare annotation is: (and (<= ~__ste_client_autoResponse1~0Int 0) (<= ~__ste_client_autoResponse0~0Int 0) (<= ~__ste_client_autoResponse2~0Int 0)) [2022-01-10 18:01:07,168 INFO L858 garLoopResultBuilder]: For program point L1545(lines 1545 1553) no Hoare annotation was computed. [2022-01-10 18:01:07,168 INFO L861 garLoopResultBuilder]: At program point L2481(lines 2463 2483) the Hoare annotation is: true [2022-01-10 18:01:07,168 INFO L854 garLoopResultBuilder]: At program point L2383(lines 2376 2385) the Hoare annotation is: (and (<= ~__ste_client_autoResponse1~0Int 0) (<= ~__ste_client_autoResponse0~0Int 0) (<= ~__ste_client_autoResponse2~0Int 0)) [2022-01-10 18:01:07,168 INFO L858 garLoopResultBuilder]: For program point L1548(lines 1548 1552) no Hoare annotation was computed. [2022-01-10 18:01:07,168 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 18:01:07,168 INFO L858 garLoopResultBuilder]: For program point L1542-2(lines 1542 1554) no Hoare annotation was computed. [2022-01-10 18:01:07,168 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 18:01:07,168 INFO L854 garLoopResultBuilder]: At program point L1548-5(lines 1538 1557) the Hoare annotation is: (and (<= ~__ste_client_autoResponse1~0Int 0) (<= ~__ste_client_autoResponse0~0Int 0) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|) (<= ~__ste_client_autoResponse2~0Int 0) (= ~rjh~0Int 2)) [2022-01-10 18:01:07,169 INFO L858 garLoopResultBuilder]: For program point L1545-2(lines 1545 1553) no Hoare annotation was computed. [2022-01-10 18:01:07,169 INFO L854 garLoopResultBuilder]: At program point L2393(lines 2386 2395) the Hoare annotation is: (and (<= ~__ste_client_autoResponse1~0Int 0) (<= ~__ste_client_autoResponse0~0Int 0) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|) (<= ~__ste_client_autoResponse2~0Int 0) (= ~rjh~0Int 2)) [2022-01-10 18:01:07,169 INFO L858 garLoopResultBuilder]: For program point L1548-3(lines 1548 1552) no Hoare annotation was computed. [2022-01-10 18:01:07,169 INFO L858 garLoopResultBuilder]: For program point L1542-4(lines 1542 1554) no Hoare annotation was computed. [2022-01-10 18:01:07,169 INFO L854 garLoopResultBuilder]: At program point L1548-8(lines 1538 1557) the Hoare annotation is: (and (<= ~__ste_client_autoResponse1~0Int 0) (<= ~__ste_client_autoResponse0~0Int 0) (<= ~__ste_client_autoResponse2~0Int 0) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,169 INFO L858 garLoopResultBuilder]: For program point L1545-4(lines 1545 1553) no Hoare annotation was computed. [2022-01-10 18:01:07,179 INFO L854 garLoopResultBuilder]: At program point L2403(lines 2396 2405) the Hoare annotation is: (and (<= ~__ste_client_autoResponse1~0Int 0) (<= ~__ste_client_autoResponse0~0Int 0) (<= ~__ste_client_autoResponse2~0Int 0) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,179 INFO L858 garLoopResultBuilder]: For program point L1548-6(lines 1548 1552) no Hoare annotation was computed. [2022-01-10 18:01:07,179 INFO L854 garLoopResultBuilder]: At program point L2460(lines 2440 2462) the Hoare annotation is: (and (<= ~__ste_client_autoResponse1~0Int 0) (<= ~__ste_client_autoResponse0~0Int 0) (<= ~__ste_client_autoResponse2~0Int 0) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,180 INFO L854 garLoopResultBuilder]: At program point L1940-1(lines 1812 1958) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,180 INFO L854 garLoopResultBuilder]: At program point L1959(lines 1811 1960) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,180 INFO L858 garLoopResultBuilder]: For program point L1813(lines 1812 1958) no Hoare annotation was computed. [2022-01-10 18:01:07,181 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 156) no Hoare annotation was computed. [2022-01-10 18:01:07,181 INFO L858 garLoopResultBuilder]: For program point L1814(lines 1814 1818) no Hoare annotation was computed. [2022-01-10 18:01:07,183 INFO L854 garLoopResultBuilder]: At program point L151-2(lines 144 159) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,183 INFO L858 garLoopResultBuilder]: For program point L151(lines 151 155) no Hoare annotation was computed. [2022-01-10 18:01:07,183 INFO L858 garLoopResultBuilder]: For program point L1820(lines 1820 1957) no Hoare annotation was computed. [2022-01-10 18:01:07,183 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 193) no Hoare annotation was computed. [2022-01-10 18:01:07,183 INFO L858 garLoopResultBuilder]: For program point L1824(lines 1824 1828) no Hoare annotation was computed. [2022-01-10 18:01:07,183 INFO L854 garLoopResultBuilder]: At program point L1830(lines 1820 1957) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,183 INFO L854 garLoopResultBuilder]: At program point L188-2(lines 181 196) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,183 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 192) no Hoare annotation was computed. [2022-01-10 18:01:07,183 INFO L858 garLoopResultBuilder]: For program point L1835(lines 1835 1842) no Hoare annotation was computed. [2022-01-10 18:01:07,183 INFO L854 garLoopResultBuilder]: At program point L1844(lines 1831 1956) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,184 INFO L854 garLoopResultBuilder]: At program point L2563(lines 2552 2566) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,184 INFO L858 garLoopResultBuilder]: For program point L1060(lines 1060 1072) no Hoare annotation was computed. [2022-01-10 18:01:07,184 INFO L858 garLoopResultBuilder]: For program point L1849(lines 1849 1853) no Hoare annotation was computed. [2022-01-10 18:01:07,185 INFO L854 garLoopResultBuilder]: At program point L1855(lines 1845 1955) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,185 INFO L858 garLoopResultBuilder]: For program point L1518(lines 1518 1534) no Hoare annotation was computed. [2022-01-10 18:01:07,187 INFO L854 garLoopResultBuilder]: At program point L1066-2(lines 1056 1075) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,187 INFO L858 garLoopResultBuilder]: For program point L1063(lines 1063 1071) no Hoare annotation was computed. [2022-01-10 18:01:07,187 INFO L858 garLoopResultBuilder]: For program point L1860(lines 1860 1864) no Hoare annotation was computed. [2022-01-10 18:01:07,187 INFO L854 garLoopResultBuilder]: At program point L1866(lines 1856 1954) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,187 INFO L854 garLoopResultBuilder]: At program point L1531(lines 1514 1537) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,193 INFO L858 garLoopResultBuilder]: For program point L1522(lines 1522 1533) no Hoare annotation was computed. [2022-01-10 18:01:07,193 INFO L854 garLoopResultBuilder]: At program point L2491(lines 2484 2493) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,193 INFO L858 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2022-01-10 18:01:07,193 INFO L858 garLoopResultBuilder]: For program point L1871(lines 1871 1875) no Hoare annotation was computed. [2022-01-10 18:01:07,193 INFO L854 garLoopResultBuilder]: At program point L1877(lines 1867 1953) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,193 INFO L858 garLoopResultBuilder]: For program point L148-2(lines 148 156) no Hoare annotation was computed. [2022-01-10 18:01:07,193 INFO L858 garLoopResultBuilder]: For program point L1526(lines 1526 1532) no Hoare annotation was computed. [2022-01-10 18:01:07,193 INFO L858 garLoopResultBuilder]: For program point L1882(lines 1882 1889) no Hoare annotation was computed. [2022-01-10 18:01:07,194 INFO L854 garLoopResultBuilder]: At program point L1891(lines 1878 1952) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,194 INFO L854 garLoopResultBuilder]: At program point L151-5(lines 144 159) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,194 INFO L858 garLoopResultBuilder]: For program point L151-3(lines 151 155) no Hoare annotation was computed. [2022-01-10 18:01:07,194 INFO L858 garLoopResultBuilder]: For program point L1495(lines 1495 1507) no Hoare annotation was computed. [2022-01-10 18:01:07,194 INFO L858 garLoopResultBuilder]: For program point L1896(lines 1896 1900) no Hoare annotation was computed. [2022-01-10 18:01:07,195 INFO L854 garLoopResultBuilder]: At program point L1902(lines 1892 1951) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,195 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 177) no Hoare annotation was computed. [2022-01-10 18:01:07,195 INFO L854 garLoopResultBuilder]: At program point L1501-2(lines 1491 1510) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,195 INFO L858 garLoopResultBuilder]: For program point L1498(lines 1498 1506) no Hoare annotation was computed. [2022-01-10 18:01:07,195 INFO L858 garLoopResultBuilder]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2022-01-10 18:01:07,195 INFO L854 garLoopResultBuilder]: At program point L1913(lines 1903 1950) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,195 INFO L854 garLoopResultBuilder]: At program point L175(lines 162 180) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,195 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 176) no Hoare annotation was computed. [2022-01-10 18:01:07,195 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2494 2503) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,195 INFO L858 garLoopResultBuilder]: For program point L1501(lines 1501 1505) no Hoare annotation was computed. [2022-01-10 18:01:07,195 INFO L858 garLoopResultBuilder]: For program point L1918(lines 1918 1922) no Hoare annotation was computed. [2022-01-10 18:01:07,195 INFO L854 garLoopResultBuilder]: At program point L1924(lines 1914 1949) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,195 INFO L854 garLoopResultBuilder]: At program point L1619(lines 1612 1621) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,195 INFO L858 garLoopResultBuilder]: For program point L1929(lines 1929 1933) no Hoare annotation was computed. [2022-01-10 18:01:07,196 INFO L854 garLoopResultBuilder]: At program point L1935(lines 1925 1948) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,196 INFO L854 garLoopResultBuilder]: At program point L1629(lines 1622 1631) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,196 INFO L858 garLoopResultBuilder]: For program point L1940(lines 1940 1944) no Hoare annotation was computed. [2022-01-10 18:01:07,196 INFO L858 garLoopResultBuilder]: For program point L1036(lines 1036 1052) no Hoare annotation was computed. [2022-01-10 18:01:07,196 INFO L854 garLoopResultBuilder]: At program point L1049(lines 1032 1055) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,196 INFO L858 garLoopResultBuilder]: For program point L1040(lines 1040 1051) no Hoare annotation was computed. [2022-01-10 18:01:07,196 INFO L858 garLoopResultBuilder]: For program point L1640(lines 1640 1646) no Hoare annotation was computed. [2022-01-10 18:01:07,196 INFO L858 garLoopResultBuilder]: For program point L1044(lines 1044 1050) no Hoare annotation was computed. [2022-01-10 18:01:07,196 INFO L854 garLoopResultBuilder]: At program point L2539(lines 2534 2542) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,196 INFO L854 garLoopResultBuilder]: At program point L1640-2(lines 1632 1649) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,196 INFO L858 garLoopResultBuilder]: For program point L2344(lines 2344 2350) no Hoare annotation was computed. [2022-01-10 18:01:07,196 INFO L858 garLoopResultBuilder]: For program point L1471(lines 1471 1487) no Hoare annotation was computed. [2022-01-10 18:01:07,196 INFO L854 garLoopResultBuilder]: At program point L2344-2(lines 2336 2353) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,196 INFO L858 garLoopResultBuilder]: For program point L2359(line 2359) no Hoare annotation was computed. [2022-01-10 18:01:07,196 INFO L854 garLoopResultBuilder]: At program point L1484(lines 1467 1490) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,196 INFO L858 garLoopResultBuilder]: For program point L1475(lines 1475 1486) no Hoare annotation was computed. [2022-01-10 18:01:07,197 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 140) no Hoare annotation was computed. [2022-01-10 18:01:07,197 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2359) no Hoare annotation was computed. [2022-01-10 18:01:07,197 INFO L854 garLoopResultBuilder]: At program point L2360(lines 2355 2362) the Hoare annotation is: false [2022-01-10 18:01:07,197 INFO L858 garLoopResultBuilder]: For program point L1660(lines 1660 1667) no Hoare annotation was computed. [2022-01-10 18:01:07,197 INFO L858 garLoopResultBuilder]: For program point L1479(lines 1479 1485) no Hoare annotation was computed. [2022-01-10 18:01:07,197 INFO L854 garLoopResultBuilder]: At program point L138(lines 125 143) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,197 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 139) no Hoare annotation was computed. [2022-01-10 18:01:07,197 INFO L858 garLoopResultBuilder]: For program point L185-4(lines 185 193) no Hoare annotation was computed. [2022-01-10 18:01:07,197 INFO L854 garLoopResultBuilder]: At program point L1660-2(lines 1650 1670) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,197 INFO L858 garLoopResultBuilder]: For program point L185-2(lines 185 193) no Hoare annotation was computed. [2022-01-10 18:01:07,197 INFO L854 garLoopResultBuilder]: At program point L188-8(lines 181 196) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,197 INFO L858 garLoopResultBuilder]: For program point L188-6(lines 188 192) no Hoare annotation was computed. [2022-01-10 18:01:07,197 INFO L854 garLoopResultBuilder]: At program point L1597(lines 1588 1599) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,198 INFO L854 garLoopResultBuilder]: At program point L188-5(lines 181 196) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,198 INFO L858 garLoopResultBuilder]: For program point L188-3(lines 188 192) no Hoare annotation was computed. [2022-01-10 18:01:07,198 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 103) no Hoare annotation was computed. [2022-01-10 18:01:07,198 INFO L854 garLoopResultBuilder]: At program point L1609(lines 1600 1611) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,198 INFO L854 garLoopResultBuilder]: At program point L1706(lines 1699 1708) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,198 INFO L854 garLoopResultBuilder]: At program point L101(lines 88 106) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,198 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 102) no Hoare annotation was computed. [2022-01-10 18:01:07,198 INFO L854 garLoopResultBuilder]: At program point L1696(lines 1686 1698) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,198 INFO L854 garLoopResultBuilder]: At program point L1754(lines 1737 1756) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,198 INFO L858 garLoopResultBuilder]: For program point L129-1(lines 129 140) no Hoare annotation was computed. [2022-01-10 18:01:07,198 INFO L854 garLoopResultBuilder]: At program point L1714(lines 1709 1717) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,198 INFO L854 garLoopResultBuilder]: At program point L138-1(lines 125 143) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,198 INFO L858 garLoopResultBuilder]: For program point L133-1(lines 133 139) no Hoare annotation was computed. [2022-01-10 18:01:07,198 INFO L858 garLoopResultBuilder]: For program point L2417(lines 2417 2425) no Hoare annotation was computed. [2022-01-10 18:01:07,198 INFO L858 garLoopResultBuilder]: For program point L166-1(lines 166 177) no Hoare annotation was computed. [2022-01-10 18:01:07,198 INFO L861 garLoopResultBuilder]: At program point L2417-2(lines 2406 2428) the Hoare annotation is: true [2022-01-10 18:01:07,199 INFO L854 garLoopResultBuilder]: At program point L1732(lines 1727 1735) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,199 INFO L854 garLoopResultBuilder]: At program point L175-1(lines 162 180) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,199 INFO L858 garLoopResultBuilder]: For program point L170-1(lines 170 176) no Hoare annotation was computed. [2022-01-10 18:01:07,199 INFO L861 garLoopResultBuilder]: At program point L1964(lines 1773 1966) the Hoare annotation is: true [2022-01-10 18:01:07,199 INFO L854 garLoopResultBuilder]: At program point L1723(lines 1718 1726) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,199 INFO L854 garLoopResultBuilder]: At program point L2539-1(lines 2534 2542) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,199 INFO L858 garLoopResultBuilder]: For program point L1518-1(lines 1518 1534) no Hoare annotation was computed. [2022-01-10 18:01:07,199 INFO L854 garLoopResultBuilder]: At program point L2531(lines 2506 2533) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,199 INFO L854 garLoopResultBuilder]: At program point L1531-1(lines 1514 1537) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,199 INFO L858 garLoopResultBuilder]: For program point L1522-1(lines 1522 1533) no Hoare annotation was computed. [2022-01-10 18:01:07,199 INFO L854 garLoopResultBuilder]: At program point L1706-1(lines 1699 1708) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,199 INFO L858 garLoopResultBuilder]: For program point L148-4(lines 148 156) no Hoare annotation was computed. [2022-01-10 18:01:07,199 INFO L858 garLoopResultBuilder]: For program point L1526-1(lines 1526 1532) no Hoare annotation was computed. [2022-01-10 18:01:07,199 INFO L854 garLoopResultBuilder]: At program point L1766(lines 1757 1768) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,199 INFO L854 garLoopResultBuilder]: At program point L151-8(lines 144 159) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,200 INFO L858 garLoopResultBuilder]: For program point L151-6(lines 151 155) no Hoare annotation was computed. [2022-01-10 18:01:07,200 INFO L858 garLoopResultBuilder]: For program point L166-2(lines 166 177) no Hoare annotation was computed. [2022-01-10 18:01:07,200 INFO L854 garLoopResultBuilder]: At program point L175-2(lines 162 180) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,200 INFO L858 garLoopResultBuilder]: For program point L170-2(lines 170 176) no Hoare annotation was computed. [2022-01-10 18:01:07,200 INFO L854 garLoopResultBuilder]: At program point L1619-1(lines 1612 1621) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,200 INFO L854 garLoopResultBuilder]: At program point L1629-1(lines 1622 1631) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,200 INFO L858 garLoopResultBuilder]: For program point L1036-1(lines 1036 1052) no Hoare annotation was computed. [2022-01-10 18:01:07,200 INFO L854 garLoopResultBuilder]: At program point L1049-1(lines 1032 1055) the Hoare annotation is: (and (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,200 INFO L858 garLoopResultBuilder]: For program point L1040-1(lines 1040 1051) no Hoare annotation was computed. [2022-01-10 18:01:07,200 INFO L858 garLoopResultBuilder]: For program point L1640-3(lines 1640 1646) no Hoare annotation was computed. [2022-01-10 18:01:07,200 INFO L858 garLoopResultBuilder]: For program point L1044-1(lines 1044 1050) no Hoare annotation was computed. [2022-01-10 18:01:07,200 INFO L854 garLoopResultBuilder]: At program point L2539-2(lines 2534 2542) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 18:01:07,200 INFO L861 garLoopResultBuilder]: At program point L1640-5(lines 1632 1649) the Hoare annotation is: true [2022-01-10 18:01:07,200 INFO L858 garLoopResultBuilder]: For program point L2344-3(lines 2344 2350) no Hoare annotation was computed. [2022-01-10 18:01:07,200 INFO L858 garLoopResultBuilder]: For program point L1471-1(lines 1471 1487) no Hoare annotation was computed. [2022-01-10 18:01:07,200 INFO L861 garLoopResultBuilder]: At program point L2344-5(lines 2336 2353) the Hoare annotation is: true [2022-01-10 18:01:07,201 INFO L858 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2022-01-10 18:01:07,201 INFO L861 garLoopResultBuilder]: At program point L1484-1(lines 1467 1490) the Hoare annotation is: true [2022-01-10 18:01:07,201 INFO L858 garLoopResultBuilder]: For program point L1475-1(lines 1475 1486) no Hoare annotation was computed. [2022-01-10 18:01:07,201 INFO L858 garLoopResultBuilder]: For program point L129-2(lines 129 140) no Hoare annotation was computed. [2022-01-10 18:01:07,201 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2359) no Hoare annotation was computed. [2022-01-10 18:01:07,201 INFO L854 garLoopResultBuilder]: At program point L2360-1(lines 2355 2362) the Hoare annotation is: false [2022-01-10 18:01:07,201 INFO L858 garLoopResultBuilder]: For program point L1660-3(lines 1660 1667) no Hoare annotation was computed. [2022-01-10 18:01:07,201 INFO L858 garLoopResultBuilder]: For program point L1479-1(lines 1479 1485) no Hoare annotation was computed. [2022-01-10 18:01:07,201 INFO L861 garLoopResultBuilder]: At program point L138-2(lines 125 143) the Hoare annotation is: true [2022-01-10 18:01:07,201 INFO L858 garLoopResultBuilder]: For program point L133-2(lines 133 139) no Hoare annotation was computed. [2022-01-10 18:01:07,201 INFO L858 garLoopResultBuilder]: For program point L185-8(lines 185 193) no Hoare annotation was computed. [2022-01-10 18:01:07,201 INFO L861 garLoopResultBuilder]: At program point L1660-5(lines 1650 1670) the Hoare annotation is: true [2022-01-10 18:01:07,201 INFO L858 garLoopResultBuilder]: For program point L185-6(lines 185 193) no Hoare annotation was computed. [2022-01-10 18:01:07,201 INFO L861 garLoopResultBuilder]: At program point L188-14(lines 181 196) the Hoare annotation is: true [2022-01-10 18:01:07,201 INFO L858 garLoopResultBuilder]: For program point L188-12(lines 188 192) no Hoare annotation was computed. [2022-01-10 18:01:07,201 INFO L861 garLoopResultBuilder]: At program point L1597-1(lines 1588 1599) the Hoare annotation is: true [2022-01-10 18:01:07,202 INFO L861 garLoopResultBuilder]: At program point L188-11(lines 181 196) the Hoare annotation is: true [2022-01-10 18:01:07,202 INFO L858 garLoopResultBuilder]: For program point L188-9(lines 188 192) no Hoare annotation was computed. [2022-01-10 18:01:07,202 INFO L858 garLoopResultBuilder]: For program point L92-1(lines 92 103) no Hoare annotation was computed. [2022-01-10 18:01:07,202 INFO L861 garLoopResultBuilder]: At program point L1609-1(lines 1600 1611) the Hoare annotation is: true [2022-01-10 18:01:07,202 INFO L861 garLoopResultBuilder]: At program point L1706-2(lines 1699 1708) the Hoare annotation is: true [2022-01-10 18:01:07,202 INFO L861 garLoopResultBuilder]: At program point L101-1(lines 88 106) the Hoare annotation is: true [2022-01-10 18:01:07,202 INFO L858 garLoopResultBuilder]: For program point L96-1(lines 96 102) no Hoare annotation was computed. [2022-01-10 18:01:07,202 INFO L861 garLoopResultBuilder]: At program point L1754-1(lines 1737 1756) the Hoare annotation is: true [2022-01-10 18:01:07,202 INFO L858 garLoopResultBuilder]: For program point L129-3(lines 129 140) no Hoare annotation was computed. [2022-01-10 18:01:07,202 INFO L861 garLoopResultBuilder]: At program point L138-3(lines 125 143) the Hoare annotation is: true [2022-01-10 18:01:07,202 INFO L858 garLoopResultBuilder]: For program point L133-3(lines 133 139) no Hoare annotation was computed. [2022-01-10 18:01:07,202 INFO L858 garLoopResultBuilder]: For program point L166-3(lines 166 177) no Hoare annotation was computed. [2022-01-10 18:01:07,202 INFO L861 garLoopResultBuilder]: At program point L175-3(lines 162 180) the Hoare annotation is: true [2022-01-10 18:01:07,202 INFO L858 garLoopResultBuilder]: For program point L170-3(lines 170 176) no Hoare annotation was computed. [2022-01-10 18:01:07,202 INFO L861 garLoopResultBuilder]: At program point L2539-3(lines 2534 2542) the Hoare annotation is: true [2022-01-10 18:01:07,202 INFO L861 garLoopResultBuilder]: At program point L2531-1(lines 2506 2533) the Hoare annotation is: true [2022-01-10 18:01:07,202 INFO L861 garLoopResultBuilder]: At program point L1706-3(lines 1699 1708) the Hoare annotation is: true [2022-01-10 18:01:07,203 INFO L861 garLoopResultBuilder]: At program point L1766-1(lines 1757 1768) the Hoare annotation is: true [2022-01-10 18:01:07,205 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:01:07,206 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 18:01:07,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:01:07 BasicIcfg [2022-01-10 18:01:07,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 18:01:07,280 INFO L158 Benchmark]: Toolchain (without parser) took 12239.12ms. Allocated memory was 192.9MB in the beginning and 547.4MB in the end (delta: 354.4MB). Free memory was 138.8MB in the beginning and 342.6MB in the end (delta: -203.9MB). Peak memory consumption was 305.9MB. Max. memory is 8.0GB. [2022-01-10 18:01:07,280 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 18:01:07,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.27ms. Allocated memory is still 192.9MB. Free memory was 138.5MB in the beginning and 128.2MB in the end (delta: 10.4MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. [2022-01-10 18:01:07,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.10ms. Allocated memory is still 192.9MB. Free memory was 128.2MB in the beginning and 122.6MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 18:01:07,281 INFO L158 Benchmark]: Boogie Preprocessor took 72.02ms. Allocated memory is still 192.9MB. Free memory was 122.6MB in the beginning and 119.1MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 18:01:07,281 INFO L158 Benchmark]: RCFGBuilder took 716.57ms. Allocated memory was 192.9MB in the beginning and 237.0MB in the end (delta: 44.0MB). Free memory was 119.1MB in the beginning and 188.9MB in the end (delta: -69.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-01-10 18:01:07,281 INFO L158 Benchmark]: IcfgTransformer took 214.16ms. Allocated memory is still 237.0MB. Free memory was 188.9MB in the beginning and 169.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-01-10 18:01:07,282 INFO L158 Benchmark]: TraceAbstraction took 10516.94ms. Allocated memory was 237.0MB in the beginning and 547.4MB in the end (delta: 310.4MB). Free memory was 168.5MB in the beginning and 342.6MB in the end (delta: -174.1MB). Peak memory consumption was 292.0MB. Max. memory is 8.0GB. [2022-01-10 18:01:07,282 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.09ms. Allocated memory is still 192.9MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 625.27ms. Allocated memory is still 192.9MB. Free memory was 138.5MB in the beginning and 128.2MB in the end (delta: 10.4MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 89.10ms. Allocated memory is still 192.9MB. Free memory was 128.2MB in the beginning and 122.6MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.02ms. Allocated memory is still 192.9MB. Free memory was 122.6MB in the beginning and 119.1MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 716.57ms. Allocated memory was 192.9MB in the beginning and 237.0MB in the end (delta: 44.0MB). Free memory was 119.1MB in the beginning and 188.9MB in the end (delta: -69.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * IcfgTransformer took 214.16ms. Allocated memory is still 237.0MB. Free memory was 188.9MB in the beginning and 169.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 10516.94ms. Allocated memory was 237.0MB in the beginning and 547.4MB in the end (delta: 310.4MB). Free memory was 168.5MB in the beginning and 342.6MB in the end (delta: -174.1MB). Peak memory consumption was 292.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2359]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2359]: 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, 188 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1998 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1998 mSDsluCounter, 4049 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2279 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 1770 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=962occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 893 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 824 NumberOfFragments, 586 HoareAnnotationTreeSize, 88 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 88 FomulaSimplificationsInter, 160749 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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: 2484]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1588]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2494]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1632]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1757]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1538]: Loop Invariant Derived loop invariant: (((~bvule32(__ste_client_autoResponse1, 0bv32) && ~bvule32(__ste_client_autoResponse0, 0bv32)) && ~bvule32(__ste_client_autoResponse2, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 1867]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1467]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2386]: Loop Invariant Derived loop invariant: (((~bvule32(__ste_client_autoResponse1, 0bv32) && ~bvule32(__ste_client_autoResponse0, 0bv32)) && ~bvule32(__ste_client_autoResponse2, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2534]: Loop Invariant Derived loop invariant: (~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && 2bv32 == rjh - InvariantResult [Line: 1727]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1737]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1914]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1538]: Loop Invariant Derived loop invariant: (~bvule32(__ste_client_autoResponse1, 0bv32) && ~bvule32(__ste_client_autoResponse0, 0bv32)) && ~bvule32(__ste_client_autoResponse2, 0bv32) - InvariantResult [Line: 1709]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1650]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2579]: Loop Invariant Derived loop invariant: (~bvule32(__ste_client_autoResponse1, 0bv32) && ~bvule32(__ste_client_autoResponse0, 0bv32)) && ~bvule32(__ste_client_autoResponse2, 0bv32) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2406]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1612]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2506]: Loop Invariant Derived loop invariant: (~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && 2bv32 == rjh - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && ~bvule32(1bv32, tmp)) && 2bv32 == rjh - InvariantResult [Line: 2440]: Loop Invariant Derived loop invariant: (((~bvule32(__ste_client_autoResponse1, 0bv32) && ~bvule32(3bv32, handle)) && ~bvule32(__ste_client_autoResponse0, 0bv32)) && ~bvule32(__ste_client_autoResponse2, 0bv32)) && 2bv32 == rjh - InvariantResult [Line: 1600]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1831]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 88]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1514]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1925]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1514]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2534]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1467]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1812]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2336]: Loop Invariant Derived loop invariant: ((~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && ~bvule32(1bv32, tmp)) && 2bv32 == rjh - InvariantResult [Line: 1878]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1588]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2534]: Loop Invariant Derived loop invariant: (~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && 2bv32 == rjh - InvariantResult [Line: 1699]: Loop Invariant Derived loop invariant: (~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && 2bv32 == rjh - InvariantResult [Line: 1699]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1686]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2534]: Loop Invariant Derived loop invariant: (~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && 2bv32 == rjh - InvariantResult [Line: 1491]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1903]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2506]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1632]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2463]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1699]: Loop Invariant Derived loop invariant: ((~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && ~bvule32(1bv32, tmp)) && 2bv32 == rjh - InvariantResult [Line: 1820]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1650]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2336]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1856]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1056]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2396]: Loop Invariant Derived loop invariant: (((~bvule32(__ste_client_autoResponse1, 0bv32) && ~bvule32(3bv32, handle)) && ~bvule32(__ste_client_autoResponse0, 0bv32)) && ~bvule32(__ste_client_autoResponse2, 0bv32)) && 2bv32 == rjh - InvariantResult [Line: 1032]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1737]: Loop Invariant Derived loop invariant: ((~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && ~bvule32(1bv32, tmp)) && 2bv32 == rjh - InvariantResult [Line: 1622]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1892]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 88]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1699]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2593]: Loop Invariant Derived loop invariant: (~bvule32(__ste_client_autoResponse1, 0bv32) && ~bvule32(__ste_client_autoResponse0, 0bv32)) && ~bvule32(__ste_client_autoResponse2, 0bv32) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (~bvule32(__ste_client_autoResponse1, 0bv32) && ~bvule32(__ste_client_autoResponse0, 0bv32)) && ~bvule32(__ste_client_autoResponse2, 0bv32) - InvariantResult [Line: 1757]: Loop Invariant Derived loop invariant: (~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && 2bv32 == rjh - InvariantResult [Line: 1538]: Loop Invariant Derived loop invariant: (((~bvule32(__ste_client_autoResponse1, 0bv32) && ~bvule32(3bv32, handle)) && ~bvule32(__ste_client_autoResponse0, 0bv32)) && ~bvule32(__ste_client_autoResponse2, 0bv32)) && 2bv32 == rjh - InvariantResult [Line: 1032]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2355]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2376]: Loop Invariant Derived loop invariant: (~bvule32(__ste_client_autoResponse1, 0bv32) && ~bvule32(__ste_client_autoResponse0, 0bv32)) && ~bvule32(__ste_client_autoResponse2, 0bv32) - InvariantResult [Line: 2355]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1622]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1845]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1612]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 1718]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && ~bvule32(1bv32, tmp)) && 2bv32 == rjh - InvariantResult [Line: 1811]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh - InvariantResult [Line: 2552]: Loop Invariant Derived loop invariant: ~bvule32(3bv32, handle) && 2bv32 == rjh RESULT: Ultimate proved your program to be correct! [2022-01-10 18:01:07,359 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...