/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_NONE.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec0_product05.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:48:47,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:48:47,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:48:47,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:48:47,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:48:47,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:48:47,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:48:47,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:48:47,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:48:47,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:48:47,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:48:47,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:48:47,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:48:47,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:48:47,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:48:47,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:48:47,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:48:47,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:48:47,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:48:47,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:48:47,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:48:47,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:48:47,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:48:47,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:48:47,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:48:47,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:48:47,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:48:47,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:48:47,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:48:47,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:48:47,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:48:47,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:48:47,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:48:47,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:48:47,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:48:47,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:48:47,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:48:47,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:48:47,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:48:47,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:48:47,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:48:47,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:48:47,725 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:48:47,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:48:47,725 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:48:47,725 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:48:47,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:48:47,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:48:47,726 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:48:47,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:48:47,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:48:47,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:48:47,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:48:47,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:48:47,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:48:47,728 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:48:47,728 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:48:47,728 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:48:47,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:48:47,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:48:47,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:48:47,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:48:47,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:48:47,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:48:47,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:48:47,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:48:47,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:48:47,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:48:47,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:48:47,729 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:48:47,730 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:48:47,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:48:47,730 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:48:47,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:48:47,730 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:48:47,731 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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 23:48:47,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:48:47,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:48:47,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:48:47,972 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:48:47,973 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:48:47,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product05.cil.c [2022-01-10 23:48:48,013 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc0f4e82/dd0e3d9abcdc47b6b3e4e88368f87e66/FLAG8ff865787 [2022-01-10 23:48:48,411 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:48:48,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product05.cil.c [2022-01-10 23:48:48,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc0f4e82/dd0e3d9abcdc47b6b3e4e88368f87e66/FLAG8ff865787 [2022-01-10 23:48:48,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc0f4e82/dd0e3d9abcdc47b6b3e4e88368f87e66 [2022-01-10 23:48:48,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:48:48,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:48:48,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:48:48,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:48:48,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:48:48,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:48:48" (1/1) ... [2022-01-10 23:48:48,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2e406e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:48, skipping insertion in model container [2022-01-10 23:48:48,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:48:48" (1/1) ... [2022-01-10 23:48:48,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:48:48,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:48:48,994 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_spec0_product05.cil.c[4289,4302] [2022-01-10 23:48:49,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:48:49,225 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 23:48:49,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:48:49,251 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_spec0_product05.cil.c[4289,4302] [2022-01-10 23:48:49,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:48:49,303 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:48:49,312 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_spec0_product05.cil.c[4289,4302] [2022-01-10 23:48:49,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:48:49,379 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:48:49,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49 WrapperNode [2022-01-10 23:48:49,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:48:49,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:48:49,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:48:49,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:48:49,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49" (1/1) ... [2022-01-10 23:48:49,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49" (1/1) ... [2022-01-10 23:48:49,460 INFO L137 Inliner]: procedures = 109, calls = 125, calls flagged for inlining = 54, calls inlined = 63, statements flattened = 876 [2022-01-10 23:48:49,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:48:49,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:48:49,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:48:49,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:48:49,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49" (1/1) ... [2022-01-10 23:48:49,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49" (1/1) ... [2022-01-10 23:48:49,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49" (1/1) ... [2022-01-10 23:48:49,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49" (1/1) ... [2022-01-10 23:48:49,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49" (1/1) ... [2022-01-10 23:48:49,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49" (1/1) ... [2022-01-10 23:48:49,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49" (1/1) ... [2022-01-10 23:48:49,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:48:49,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:48:49,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:48:49,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:48:49,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49" (1/1) ... [2022-01-10 23:48:49,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:48:49,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:48:49,547 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 23:48:49,550 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 23:48:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2022-01-10 23:48:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:48:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:48:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:48:49,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:48:49,737 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:48:49,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:48:50,195 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:48:50,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:48:50,205 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 23:48:50,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:48:50 BoogieIcfgContainer [2022-01-10 23:48:50,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:48:50,207 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:48:50,207 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:48:50,208 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:48:50,210 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:48:50" (1/1) ... [2022-01-10 23:48:50,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:48:50 BasicIcfg [2022-01-10 23:48:50,373 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:48:50,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:48:50,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:48:50,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:48:50,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:48:48" (1/4) ... [2022-01-10 23:48:50,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566bab10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:48:50, skipping insertion in model container [2022-01-10 23:48:50,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:48:49" (2/4) ... [2022-01-10 23:48:50,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566bab10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:48:50, skipping insertion in model container [2022-01-10 23:48:50,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:48:50" (3/4) ... [2022-01-10 23:48:50,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566bab10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:48:50, skipping insertion in model container [2022-01-10 23:48:50,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:48:50" (4/4) ... [2022-01-10 23:48:50,380 INFO L111 eAbstractionObserver]: Analyzing ICFG email_spec0_product05.cil.cTransformedIcfg [2022-01-10 23:48:50,384 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:48:50,384 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 23:48:50,438 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:48:50,443 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 23:48:50,443 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 23:48:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 154 states have internal predecessors, (237), 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 23:48:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 23:48:50,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:50,459 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] [2022-01-10 23:48:50,459 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1818684326, now seen corresponding path program 1 times [2022-01-10 23:48:50,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:50,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296091079] [2022-01-10 23:48:50,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:50,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:50,737 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 23:48:50,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:50,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296091079] [2022-01-10 23:48:50,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296091079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:50,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:50,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:48:50,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25921239] [2022-01-10 23:48:50,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:50,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:48:50,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:50,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:48:50,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:48:50,773 INFO L87 Difference]: Start difference. First operand has 155 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 154 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:50,822 INFO L93 Difference]: Finished difference Result 256 states and 382 transitions. [2022-01-10 23:48:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:48:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-01-10 23:48:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:50,834 INFO L225 Difference]: With dead ends: 256 [2022-01-10 23:48:50,834 INFO L226 Difference]: Without dead ends: 130 [2022-01-10 23:48:50,837 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 23:48:50,841 INFO L933 BasicCegarLoop]: 231 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, 231 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 23:48:50,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:50,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-01-10 23:48:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-01-10 23:48:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.5546875) internal successors, (199), 129 states have internal predecessors, (199), 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 23:48:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 199 transitions. [2022-01-10 23:48:50,889 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 199 transitions. Word has length 39 [2022-01-10 23:48:50,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:50,890 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 199 transitions. [2022-01-10 23:48:50,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 199 transitions. [2022-01-10 23:48:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 23:48:50,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:50,894 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 23:48:50,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:48:50,894 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:50,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash 692729806, now seen corresponding path program 1 times [2022-01-10 23:48:50,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:50,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431504192] [2022-01-10 23:48:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:50,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:51,072 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 23:48:51,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:51,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431504192] [2022-01-10 23:48:51,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431504192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:51,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:51,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:48:51,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912749590] [2022-01-10 23:48:51,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:51,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:48:51,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:51,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:48:51,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:48:51,079 INFO L87 Difference]: Start difference. First operand 130 states and 199 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 23:48:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:51,157 INFO L93 Difference]: Finished difference Result 246 states and 378 transitions. [2022-01-10 23:48:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:48:51,157 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 23:48:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:51,161 INFO L225 Difference]: With dead ends: 246 [2022-01-10 23:48:51,161 INFO L226 Difference]: Without dead ends: 130 [2022-01-10 23:48:51,162 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 23:48:51,163 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 182 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:48:51,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 190 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-01-10 23:48:51,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-01-10 23:48:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.5390625) internal successors, (197), 129 states have internal predecessors, (197), 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 23:48:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 197 transitions. [2022-01-10 23:48:51,190 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 197 transitions. Word has length 40 [2022-01-10 23:48:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:51,190 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 197 transitions. [2022-01-10 23:48:51,190 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 23:48:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 197 transitions. [2022-01-10 23:48:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 23:48:51,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:51,192 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 23:48:51,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:48:51,192 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:51,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:51,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2122269524, now seen corresponding path program 1 times [2022-01-10 23:48:51,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:51,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317449096] [2022-01-10 23:48:51,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:51,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:51,304 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 23:48:51,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:51,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317449096] [2022-01-10 23:48:51,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317449096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:51,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:51,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:48:51,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161998562] [2022-01-10 23:48:51,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:51,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:48:51,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:51,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:48:51,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:48:51,308 INFO L87 Difference]: Start difference. First operand 130 states and 197 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:51,340 INFO L93 Difference]: Finished difference Result 245 states and 372 transitions. [2022-01-10 23:48:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:48:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-10 23:48:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:51,342 INFO L225 Difference]: With dead ends: 245 [2022-01-10 23:48:51,342 INFO L226 Difference]: Without dead ends: 134 [2022-01-10 23:48:51,346 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 23:48:51,348 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 176 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 203 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 23:48:51,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 203 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-01-10 23:48:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2022-01-10 23:48:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.53125) internal successors, (196), 129 states have internal predecessors, (196), 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 23:48:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 196 transitions. [2022-01-10 23:48:51,363 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 196 transitions. Word has length 42 [2022-01-10 23:48:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:51,363 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 196 transitions. [2022-01-10 23:48:51,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 196 transitions. [2022-01-10 23:48:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 23:48:51,365 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:51,365 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 23:48:51,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:48:51,366 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:51,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:51,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1160528197, now seen corresponding path program 1 times [2022-01-10 23:48:51,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:51,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840415388] [2022-01-10 23:48:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:51,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:51,509 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 23:48:51,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:51,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840415388] [2022-01-10 23:48:51,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840415388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:51,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:51,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:48:51,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770018489] [2022-01-10 23:48:51,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:51,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:48:51,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:51,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:48:51,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:48:51,512 INFO L87 Difference]: Start difference. First operand 130 states and 196 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 23:48:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:51,590 INFO L93 Difference]: Finished difference Result 375 states and 550 transitions. [2022-01-10 23:48:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 23:48:51,590 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 23:48:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:51,592 INFO L225 Difference]: With dead ends: 375 [2022-01-10 23:48:51,592 INFO L226 Difference]: Without dead ends: 318 [2022-01-10 23:48:51,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 23:48:51,597 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 346 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:48:51,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 760 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-01-10 23:48:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 229. [2022-01-10 23:48:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 227 states have (on average 1.5462555066079295) internal successors, (351), 228 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 351 transitions. [2022-01-10 23:48:51,615 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 351 transitions. Word has length 43 [2022-01-10 23:48:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:51,615 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 351 transitions. [2022-01-10 23:48:51,615 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 23:48:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 351 transitions. [2022-01-10 23:48:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 23:48:51,620 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:51,620 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, 1] [2022-01-10 23:48:51,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 23:48:51,620 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash -166232181, now seen corresponding path program 1 times [2022-01-10 23:48:51,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:51,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836804727] [2022-01-10 23:48:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:51,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:51,739 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 23:48:51,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:51,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836804727] [2022-01-10 23:48:51,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836804727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:51,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:51,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:48:51,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563001095] [2022-01-10 23:48:51,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:51,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:48:51,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:51,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:48:51,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:48:51,741 INFO L87 Difference]: Start difference. First operand 229 states and 351 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 23:48:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:51,838 INFO L93 Difference]: Finished difference Result 691 states and 1021 transitions. [2022-01-10 23:48:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 23:48:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2022-01-10 23:48:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:51,841 INFO L225 Difference]: With dead ends: 691 [2022-01-10 23:48:51,841 INFO L226 Difference]: Without dead ends: 596 [2022-01-10 23:48:51,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 23:48:51,842 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 289 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:48:51,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 782 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-01-10 23:48:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 424. [2022-01-10 23:48:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 422 states have (on average 1.566350710900474) internal successors, (661), 423 states have internal predecessors, (661), 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 23:48:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 661 transitions. [2022-01-10 23:48:51,870 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 661 transitions. Word has length 44 [2022-01-10 23:48:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:51,874 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 661 transitions. [2022-01-10 23:48:51,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 23:48:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 661 transitions. [2022-01-10 23:48:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 23:48:51,874 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:51,875 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, 1, 1] [2022-01-10 23:48:51,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 23:48:51,875 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:51,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1026520009, now seen corresponding path program 1 times [2022-01-10 23:48:51,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:51,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533678651] [2022-01-10 23:48:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:51,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:51,983 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 23:48:51,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:51,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533678651] [2022-01-10 23:48:51,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533678651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:51,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:51,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:48:51,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025214362] [2022-01-10 23:48:51,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:51,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:48:51,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:51,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:48:51,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:48:51,985 INFO L87 Difference]: Start difference. First operand 424 states and 661 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:52,122 INFO L93 Difference]: Finished difference Result 1287 states and 1921 transitions. [2022-01-10 23:48:52,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 23:48:52,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-10 23:48:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:52,126 INFO L225 Difference]: With dead ends: 1287 [2022-01-10 23:48:52,126 INFO L226 Difference]: Without dead ends: 1039 [2022-01-10 23:48:52,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 23:48:52,128 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 288 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:48:52,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 782 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2022-01-10 23:48:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 746. [2022-01-10 23:48:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 744 states have (on average 1.5833333333333333) internal successors, (1178), 745 states have internal predecessors, (1178), 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 23:48:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1178 transitions. [2022-01-10 23:48:52,171 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1178 transitions. Word has length 45 [2022-01-10 23:48:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:52,173 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 1178 transitions. [2022-01-10 23:48:52,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1178 transitions. [2022-01-10 23:48:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 23:48:52,175 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:52,175 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:48:52,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 23:48:52,175 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:52,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash 870803256, now seen corresponding path program 1 times [2022-01-10 23:48:52,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:52,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117430095] [2022-01-10 23:48:52,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:52,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:48:52,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:52,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117430095] [2022-01-10 23:48:52,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117430095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:52,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:52,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:48:52,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238471399] [2022-01-10 23:48:52,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:52,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:48:52,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:52,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:48:52,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:48:52,230 INFO L87 Difference]: Start difference. First operand 746 states and 1178 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:52,297 INFO L93 Difference]: Finished difference Result 2186 states and 3462 transitions. [2022-01-10 23:48:52,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:48:52,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-10 23:48:52,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:52,303 INFO L225 Difference]: With dead ends: 2186 [2022-01-10 23:48:52,303 INFO L226 Difference]: Without dead ends: 1462 [2022-01-10 23:48:52,304 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 23:48:52,305 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 162 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:48:52,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 384 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2022-01-10 23:48:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 978. [2022-01-10 23:48:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 976 states have (on average 1.6383196721311475) internal successors, (1599), 977 states have internal predecessors, (1599), 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 23:48:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1599 transitions. [2022-01-10 23:48:52,365 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1599 transitions. Word has length 56 [2022-01-10 23:48:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:52,365 INFO L470 AbstractCegarLoop]: Abstraction has 978 states and 1599 transitions. [2022-01-10 23:48:52,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1599 transitions. [2022-01-10 23:48:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 23:48:52,367 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:52,367 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:48:52,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 23:48:52,368 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash -314087393, now seen corresponding path program 1 times [2022-01-10 23:48:52,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:52,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789855296] [2022-01-10 23:48:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:52,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:48:52,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:52,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789855296] [2022-01-10 23:48:52,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789855296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:52,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:52,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:48:52,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650910838] [2022-01-10 23:48:52,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:52,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:48:52,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:52,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:48:52,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:48:52,431 INFO L87 Difference]: Start difference. First operand 978 states and 1599 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:52,524 INFO L93 Difference]: Finished difference Result 2874 states and 4709 transitions. [2022-01-10 23:48:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:48:52,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-01-10 23:48:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:52,530 INFO L225 Difference]: With dead ends: 2874 [2022-01-10 23:48:52,530 INFO L226 Difference]: Without dead ends: 1918 [2022-01-10 23:48:52,533 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 23:48:52,534 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 160 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:48:52,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 384 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2022-01-10 23:48:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1434. [2022-01-10 23:48:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1432 states have (on average 1.687849162011173) internal successors, (2417), 1433 states have internal predecessors, (2417), 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 23:48:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2417 transitions. [2022-01-10 23:48:52,599 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2417 transitions. Word has length 57 [2022-01-10 23:48:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:52,599 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 2417 transitions. [2022-01-10 23:48:52,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2417 transitions. [2022-01-10 23:48:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 23:48:52,600 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:52,600 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:48:52,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 23:48:52,601 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:52,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2031531005, now seen corresponding path program 1 times [2022-01-10 23:48:52,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:52,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042335249] [2022-01-10 23:48:52,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:52,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:48:52,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:52,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042335249] [2022-01-10 23:48:52,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042335249] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:52,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:52,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:48:52,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609226639] [2022-01-10 23:48:52,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:52,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:48:52,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:52,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:48:52,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:48:52,652 INFO L87 Difference]: Start difference. First operand 1434 states and 2417 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 23:48:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:52,759 INFO L93 Difference]: Finished difference Result 4226 states and 7131 transitions. [2022-01-10 23:48:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:48:52,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-01-10 23:48:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:52,768 INFO L225 Difference]: With dead ends: 4226 [2022-01-10 23:48:52,768 INFO L226 Difference]: Without dead ends: 2814 [2022-01-10 23:48:52,770 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 23:48:52,770 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 158 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:48:52,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 384 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2022-01-10 23:48:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 2330. [2022-01-10 23:48:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2328 states have (on average 1.7203608247422681) internal successors, (4005), 2329 states have internal predecessors, (4005), 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 23:48:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 4005 transitions. [2022-01-10 23:48:52,858 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 4005 transitions. Word has length 58 [2022-01-10 23:48:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:52,858 INFO L470 AbstractCegarLoop]: Abstraction has 2330 states and 4005 transitions. [2022-01-10 23:48:52,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 23:48:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 4005 transitions. [2022-01-10 23:48:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 23:48:52,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:52,860 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:48:52,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 23:48:52,860 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:52,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:52,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1162271844, now seen corresponding path program 1 times [2022-01-10 23:48:52,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:52,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043084196] [2022-01-10 23:48:52,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:52,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:48:52,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:52,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043084196] [2022-01-10 23:48:52,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043084196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:52,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:52,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:48:52,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423158041] [2022-01-10 23:48:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:52,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:48:52,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:52,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:48:52,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:48:52,896 INFO L87 Difference]: Start difference. First operand 2330 states and 4005 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 23:48:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:53,070 INFO L93 Difference]: Finished difference Result 6882 states and 11831 transitions. [2022-01-10 23:48:53,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:48:53,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-01-10 23:48:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:53,083 INFO L225 Difference]: With dead ends: 6882 [2022-01-10 23:48:53,084 INFO L226 Difference]: Without dead ends: 4574 [2022-01-10 23:48:53,087 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 23:48:53,087 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 156 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:48:53,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 384 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2022-01-10 23:48:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4090. [2022-01-10 23:48:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4090 states, 4088 states have (on average 1.7331213307240705) internal successors, (7085), 4089 states have internal predecessors, (7085), 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 23:48:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4090 states to 4090 states and 7085 transitions. [2022-01-10 23:48:53,268 INFO L78 Accepts]: Start accepts. Automaton has 4090 states and 7085 transitions. Word has length 59 [2022-01-10 23:48:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:53,268 INFO L470 AbstractCegarLoop]: Abstraction has 4090 states and 7085 transitions. [2022-01-10 23:48:53,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 23:48:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4090 states and 7085 transitions. [2022-01-10 23:48:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 23:48:53,270 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:53,270 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:48:53,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 23:48:53,271 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:53,271 INFO L85 PathProgramCache]: Analyzing trace with hash 118473921, now seen corresponding path program 1 times [2022-01-10 23:48:53,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:53,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902624100] [2022-01-10 23:48:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:53,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:48:53,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:53,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902624100] [2022-01-10 23:48:53,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902624100] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:53,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:53,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:48:53,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792271358] [2022-01-10 23:48:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:53,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:48:53,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:53,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:48:53,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:48:53,312 INFO L87 Difference]: Start difference. First operand 4090 states and 7085 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:53,631 INFO L93 Difference]: Finished difference Result 12098 states and 20943 transitions. [2022-01-10 23:48:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:48:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-10 23:48:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:53,656 INFO L225 Difference]: With dead ends: 12098 [2022-01-10 23:48:53,656 INFO L226 Difference]: Without dead ends: 8030 [2022-01-10 23:48:53,662 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 23:48:53,663 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 154 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:48:53,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 384 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8030 states. [2022-01-10 23:48:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8030 to 7546. [2022-01-10 23:48:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7546 states, 7544 states have (on average 1.7302492046659597) internal successors, (13053), 7545 states have internal predecessors, (13053), 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 23:48:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7546 states to 7546 states and 13053 transitions. [2022-01-10 23:48:53,952 INFO L78 Accepts]: Start accepts. Automaton has 7546 states and 13053 transitions. Word has length 60 [2022-01-10 23:48:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:53,953 INFO L470 AbstractCegarLoop]: Abstraction has 7546 states and 13053 transitions. [2022-01-10 23:48:53,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 7546 states and 13053 transitions. [2022-01-10 23:48:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-10 23:48:53,956 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:53,956 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:48:53,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 23:48:53,957 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:53,957 INFO L85 PathProgramCache]: Analyzing trace with hash -435836297, now seen corresponding path program 1 times [2022-01-10 23:48:53,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:53,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976943038] [2022-01-10 23:48:53,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:53,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:48:54,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:54,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976943038] [2022-01-10 23:48:54,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976943038] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:54,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:54,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:48:54,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631314092] [2022-01-10 23:48:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:54,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 23:48:54,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:54,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 23:48:54,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:48:54,027 INFO L87 Difference]: Start difference. First operand 7546 states and 13053 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:54,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:54,197 INFO L93 Difference]: Finished difference Result 8281 states and 14269 transitions. [2022-01-10 23:48:54,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 23:48:54,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-01-10 23:48:54,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:54,222 INFO L225 Difference]: With dead ends: 8281 [2022-01-10 23:48:54,222 INFO L226 Difference]: Without dead ends: 4478 [2022-01-10 23:48:54,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:48:54,227 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 199 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:48:54,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 312 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2022-01-10 23:48:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 3758. [2022-01-10 23:48:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3756 states have (on average 1.6831735889243877) internal successors, (6322), 3757 states have internal predecessors, (6322), 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 23:48:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 6322 transitions. [2022-01-10 23:48:54,379 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 6322 transitions. Word has length 61 [2022-01-10 23:48:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:54,379 INFO L470 AbstractCegarLoop]: Abstraction has 3758 states and 6322 transitions. [2022-01-10 23:48:54,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 6322 transitions. [2022-01-10 23:48:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-10 23:48:54,384 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:48:54,384 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:48:54,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 23:48:54,384 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:48:54,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:48:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1925984322, now seen corresponding path program 1 times [2022-01-10 23:48:54,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:48:54,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157299102] [2022-01-10 23:48:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:48:54,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:48:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:48:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:48:54,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:48:54,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157299102] [2022-01-10 23:48:54,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157299102] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:48:54,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:48:54,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:48:54,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405322700] [2022-01-10 23:48:54,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:48:54,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 23:48:54,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:48:54,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 23:48:54,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:48:54,465 INFO L87 Difference]: Start difference. First operand 3758 states and 6322 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:48:54,594 INFO L93 Difference]: Finished difference Result 3830 states and 6418 transitions. [2022-01-10 23:48:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 23:48:54,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-01-10 23:48:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:48:54,595 INFO L225 Difference]: With dead ends: 3830 [2022-01-10 23:48:54,595 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 23:48:54,599 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 23:48:54,600 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 117 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:48:54,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 551 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:48:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 23:48:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 23:48:54,600 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 23:48:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 23:48:54,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2022-01-10 23:48:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:48:54,601 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 23:48:54,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:48:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 23:48:54,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 23:48:54,603 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 23:48:54,603 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 23:48:54,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 23:48:54,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 23:49:15,336 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 23:49:15,336 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 23:49:15,337 INFO L854 garLoopResultBuilder]: At program point L2538(lines 2534 2540) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0)) [2022-01-10 23:49:15,337 INFO L854 garLoopResultBuilder]: At program point L2531(lines 2527 2533) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0)) [2022-01-10 23:49:15,337 INFO L854 garLoopResultBuilder]: At program point L2546(lines 2541 2549) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0)) [2022-01-10 23:49:15,337 INFO L858 garLoopResultBuilder]: For program point L181(lines 181 188) no Hoare annotation was computed. [2022-01-10 23:49:15,337 INFO L858 garLoopResultBuilder]: For program point L2263(lines 2263 2275) no Hoare annotation was computed. [2022-01-10 23:49:15,337 INFO L858 garLoopResultBuilder]: For program point L181-2(lines 181 188) no Hoare annotation was computed. [2022-01-10 23:49:15,337 INFO L854 garLoopResultBuilder]: At program point L2269-2(lines 2259 2278) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0)) [2022-01-10 23:49:15,337 INFO L858 garLoopResultBuilder]: For program point L2266(lines 2266 2274) no Hoare annotation was computed. [2022-01-10 23:49:15,337 INFO L861 garLoopResultBuilder]: At program point L189(lines 171 191) the Hoare annotation is: true [2022-01-10 23:49:15,337 INFO L854 garLoopResultBuilder]: At program point L91(lines 84 93) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0)) [2022-01-10 23:49:15,337 INFO L858 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2022-01-10 23:49:15,337 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 23:49:15,337 INFO L858 garLoopResultBuilder]: For program point L2263-2(lines 2263 2275) no Hoare annotation was computed. [2022-01-10 23:49:15,337 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 23:49:15,338 INFO L854 garLoopResultBuilder]: At program point L2269-5(lines 2259 2278) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|) (<= ~__ste_client_forwardReceiver2~0Int 0) (= ~rjh~0Int 2)) [2022-01-10 23:49:15,338 INFO L858 garLoopResultBuilder]: For program point L2266-2(lines 2266 2274) no Hoare annotation was computed. [2022-01-10 23:49:15,338 INFO L854 garLoopResultBuilder]: At program point L101(lines 94 103) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|) (<= ~__ste_client_forwardReceiver2~0Int 0) (= ~rjh~0Int 2)) [2022-01-10 23:49:15,338 INFO L858 garLoopResultBuilder]: For program point L2269-3(lines 2269 2273) no Hoare annotation was computed. [2022-01-10 23:49:15,338 INFO L858 garLoopResultBuilder]: For program point L2263-4(lines 2263 2275) no Hoare annotation was computed. [2022-01-10 23:49:15,338 INFO L854 garLoopResultBuilder]: At program point L2269-8(lines 2259 2278) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,338 INFO L858 garLoopResultBuilder]: For program point L2266-4(lines 2266 2274) no Hoare annotation was computed. [2022-01-10 23:49:15,338 INFO L854 garLoopResultBuilder]: At program point L111(lines 104 113) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,338 INFO L858 garLoopResultBuilder]: For program point L2269-6(lines 2269 2273) no Hoare annotation was computed. [2022-01-10 23:49:15,338 INFO L854 garLoopResultBuilder]: At program point L168(lines 148 170) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,338 INFO L854 garLoopResultBuilder]: At program point L376-1(lines 251 394) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,338 INFO L854 garLoopResultBuilder]: At program point L395(lines 250 396) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,338 INFO L858 garLoopResultBuilder]: For program point L252(lines 251 394) no Hoare annotation was computed. [2022-01-10 23:49:15,338 INFO L858 garLoopResultBuilder]: For program point L503(lines 503 511) no Hoare annotation was computed. [2022-01-10 23:49:15,338 INFO L858 garLoopResultBuilder]: For program point L253(lines 253 257) no Hoare annotation was computed. [2022-01-10 23:49:15,339 INFO L854 garLoopResultBuilder]: At program point L506-2(lines 499 514) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,339 INFO L858 garLoopResultBuilder]: For program point L506(lines 506 510) no Hoare annotation was computed. [2022-01-10 23:49:15,339 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 393) no Hoare annotation was computed. [2022-01-10 23:49:15,339 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 548) no Hoare annotation was computed. [2022-01-10 23:49:15,339 INFO L858 garLoopResultBuilder]: For program point L263(lines 263 267) no Hoare annotation was computed. [2022-01-10 23:49:15,339 INFO L854 garLoopResultBuilder]: At program point L269(lines 259 393) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,339 INFO L854 garLoopResultBuilder]: At program point L543-2(lines 536 551) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,339 INFO L858 garLoopResultBuilder]: For program point L543(lines 543 547) no Hoare annotation was computed. [2022-01-10 23:49:15,339 INFO L858 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2022-01-10 23:49:15,339 INFO L854 garLoopResultBuilder]: At program point L280(lines 270 392) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,339 INFO L854 garLoopResultBuilder]: At program point L2511(lines 2500 2514) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,339 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 289) no Hoare annotation was computed. [2022-01-10 23:49:15,339 INFO L854 garLoopResultBuilder]: At program point L291(lines 281 391) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,339 INFO L858 garLoopResultBuilder]: For program point L2239(lines 2239 2255) no Hoare annotation was computed. [2022-01-10 23:49:15,339 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 300) no Hoare annotation was computed. [2022-01-10 23:49:15,339 INFO L854 garLoopResultBuilder]: At program point L302(lines 292 390) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,339 INFO L854 garLoopResultBuilder]: At program point L2252(lines 2235 2258) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,339 INFO L858 garLoopResultBuilder]: For program point L2243(lines 2243 2254) no Hoare annotation was computed. [2022-01-10 23:49:15,340 INFO L858 garLoopResultBuilder]: For program point L307(lines 307 311) no Hoare annotation was computed. [2022-01-10 23:49:15,340 INFO L854 garLoopResultBuilder]: At program point L313(lines 303 389) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,340 INFO L858 garLoopResultBuilder]: For program point L503-2(lines 503 511) no Hoare annotation was computed. [2022-01-10 23:49:15,340 INFO L858 garLoopResultBuilder]: For program point L2247(lines 2247 2253) no Hoare annotation was computed. [2022-01-10 23:49:15,340 INFO L858 garLoopResultBuilder]: For program point L318(lines 318 325) no Hoare annotation was computed. [2022-01-10 23:49:15,340 INFO L854 garLoopResultBuilder]: At program point L327(lines 314 388) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,340 INFO L854 garLoopResultBuilder]: At program point L506-5(lines 499 514) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,340 INFO L858 garLoopResultBuilder]: For program point L506-3(lines 506 510) no Hoare annotation was computed. [2022-01-10 23:49:15,340 INFO L858 garLoopResultBuilder]: For program point L2216(lines 2216 2228) no Hoare annotation was computed. [2022-01-10 23:49:15,340 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2022-01-10 23:49:15,340 INFO L854 garLoopResultBuilder]: At program point L338(lines 328 387) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,340 INFO L858 garLoopResultBuilder]: For program point L521(lines 521 532) no Hoare annotation was computed. [2022-01-10 23:49:15,340 INFO L854 garLoopResultBuilder]: At program point L2222-2(lines 2212 2231) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,340 INFO L858 garLoopResultBuilder]: For program point L2219(lines 2219 2227) no Hoare annotation was computed. [2022-01-10 23:49:15,340 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 347) no Hoare annotation was computed. [2022-01-10 23:49:15,340 INFO L854 garLoopResultBuilder]: At program point L349(lines 339 386) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,340 INFO L854 garLoopResultBuilder]: At program point L530(lines 517 535) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,340 INFO L858 garLoopResultBuilder]: For program point L525(lines 525 531) no Hoare annotation was computed. [2022-01-10 23:49:15,341 INFO L854 garLoopResultBuilder]: At program point L199(lines 192 201) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,341 INFO L858 garLoopResultBuilder]: For program point L2222(lines 2222 2226) no Hoare annotation was computed. [2022-01-10 23:49:15,341 INFO L858 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2022-01-10 23:49:15,341 INFO L854 garLoopResultBuilder]: At program point L360(lines 350 385) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,341 INFO L854 garLoopResultBuilder]: At program point L2322(lines 2315 2324) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,341 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2022-01-10 23:49:15,341 INFO L854 garLoopResultBuilder]: At program point L371(lines 361 384) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,341 INFO L854 garLoopResultBuilder]: At program point L2332(lines 2325 2334) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,341 INFO L858 garLoopResultBuilder]: For program point L376(lines 376 380) no Hoare annotation was computed. [2022-01-10 23:49:15,341 INFO L858 garLoopResultBuilder]: For program point L2192(lines 2192 2208) no Hoare annotation was computed. [2022-01-10 23:49:15,341 INFO L854 garLoopResultBuilder]: At program point L2205(lines 2188 2211) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_getClientForwardReceiver_#res#1Int| 0) (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,341 INFO L858 garLoopResultBuilder]: For program point L2196(lines 2196 2207) no Hoare annotation was computed. [2022-01-10 23:49:15,341 INFO L858 garLoopResultBuilder]: For program point L2345(lines 2345 2352) no Hoare annotation was computed. [2022-01-10 23:49:15,341 INFO L858 garLoopResultBuilder]: For program point L2200(lines 2200 2206) no Hoare annotation was computed. [2022-01-10 23:49:15,341 INFO L858 garLoopResultBuilder]: For program point L540-2(lines 540 548) no Hoare annotation was computed. [2022-01-10 23:49:15,341 INFO L854 garLoopResultBuilder]: At program point L2345-2(lines 2335 2355) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 1)) (<= ~__ste_client_forwardReceiver2~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 0) .cse1 .cse2) (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2))) [2022-01-10 23:49:15,341 INFO L854 garLoopResultBuilder]: At program point L543-5(lines 536 551) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,341 INFO L858 garLoopResultBuilder]: For program point L543-3(lines 543 547) no Hoare annotation was computed. [2022-01-10 23:49:15,342 INFO L854 garLoopResultBuilder]: At program point L2300(lines 2291 2302) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 1)) (<= ~__ste_client_forwardReceiver2~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 0) .cse1 .cse2) (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2))) [2022-01-10 23:49:15,342 INFO L854 garLoopResultBuilder]: At program point L2487(lines 2482 2490) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,342 INFO L854 garLoopResultBuilder]: At program point L2312(lines 2303 2314) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 1)) (<= ~__ste_client_forwardReceiver2~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 0) .cse1 .cse2) (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2))) [2022-01-10 23:49:15,342 INFO L858 garLoopResultBuilder]: For program point L1191(lines 1191 1197) no Hoare annotation was computed. [2022-01-10 23:49:15,342 INFO L854 garLoopResultBuilder]: At program point L2381(lines 2371 2383) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 1)) (<= ~__ste_client_forwardReceiver2~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 0) .cse1 .cse2) (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2))) [2022-01-10 23:49:15,342 INFO L854 garLoopResultBuilder]: At program point L1191-2(lines 1183 1200) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,342 INFO L858 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-01-10 23:49:15,342 INFO L854 garLoopResultBuilder]: At program point L2399(lines 2394 2402) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 1)) (<= ~__ste_client_forwardReceiver2~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 0) .cse1 .cse2) (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2))) [2022-01-10 23:49:15,342 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 458) no Hoare annotation was computed. [2022-01-10 23:49:15,342 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-01-10 23:49:15,342 INFO L854 garLoopResultBuilder]: At program point L208(lines 203 210) the Hoare annotation is: false [2022-01-10 23:49:15,342 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 133) no Hoare annotation was computed. [2022-01-10 23:49:15,342 INFO L854 garLoopResultBuilder]: At program point L456(lines 443 461) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,342 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 457) no Hoare annotation was computed. [2022-01-10 23:49:15,342 INFO L861 garLoopResultBuilder]: At program point L125-2(lines 114 136) the Hoare annotation is: true [2022-01-10 23:49:15,342 INFO L854 garLoopResultBuilder]: At program point L2417(lines 2412 2420) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 1)) (<= ~__ste_client_forwardReceiver2~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 0) .cse1 .cse2) (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2))) [2022-01-10 23:49:15,343 INFO L858 garLoopResultBuilder]: For program point L484(lines 484 495) no Hoare annotation was computed. [2022-01-10 23:49:15,343 INFO L861 garLoopResultBuilder]: At program point L400(lines 212 402) the Hoare annotation is: true [2022-01-10 23:49:15,343 INFO L854 garLoopResultBuilder]: At program point L2408(lines 2403 2411) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 1)) (<= ~__ste_client_forwardReceiver2~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 0) .cse1 .cse2) (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2))) [2022-01-10 23:49:15,343 INFO L854 garLoopResultBuilder]: At program point L493(lines 480 498) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,343 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 494) no Hoare annotation was computed. [2022-01-10 23:49:15,343 INFO L858 garLoopResultBuilder]: For program point L2239-1(lines 2239 2255) no Hoare annotation was computed. [2022-01-10 23:49:15,343 INFO L858 garLoopResultBuilder]: For program point L521-1(lines 521 532) no Hoare annotation was computed. [2022-01-10 23:49:15,343 INFO L854 garLoopResultBuilder]: At program point L2252-1(lines 2235 2258) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 1)) (<= ~__ste_client_forwardReceiver2~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 0) .cse1 .cse2) (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2))) [2022-01-10 23:49:15,343 INFO L858 garLoopResultBuilder]: For program point L2243-1(lines 2243 2254) no Hoare annotation was computed. [2022-01-10 23:49:15,343 INFO L854 garLoopResultBuilder]: At program point L530-1(lines 517 535) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,343 INFO L858 garLoopResultBuilder]: For program point L525-1(lines 525 531) no Hoare annotation was computed. [2022-01-10 23:49:15,343 INFO L858 garLoopResultBuilder]: For program point L503-4(lines 503 511) no Hoare annotation was computed. [2022-01-10 23:49:15,343 INFO L858 garLoopResultBuilder]: For program point L2247-1(lines 2247 2253) no Hoare annotation was computed. [2022-01-10 23:49:15,343 INFO L854 garLoopResultBuilder]: At program point L2487-1(lines 2482 2490) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,343 INFO L854 garLoopResultBuilder]: At program point L506-8(lines 499 514) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 1)) (<= ~__ste_client_forwardReceiver2~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 0) .cse1 .cse2) (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2))) [2022-01-10 23:49:15,343 INFO L858 garLoopResultBuilder]: For program point L506-6(lines 506 510) no Hoare annotation was computed. [2022-01-10 23:49:15,343 INFO L854 garLoopResultBuilder]: At program point L2479(lines 2454 2481) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,343 INFO L858 garLoopResultBuilder]: For program point L521-2(lines 521 532) no Hoare annotation was computed. [2022-01-10 23:49:15,344 INFO L854 garLoopResultBuilder]: At program point L2391(lines 2384 2393) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,344 INFO L854 garLoopResultBuilder]: At program point L530-2(lines 517 535) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 1)) (<= ~__ste_client_forwardReceiver2~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_incoming_~fwreceiver~0#1Int| 0) .cse1 .cse2) (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2))) [2022-01-10 23:49:15,344 INFO L858 garLoopResultBuilder]: For program point L525-2(lines 525 531) no Hoare annotation was computed. [2022-01-10 23:49:15,344 INFO L854 garLoopResultBuilder]: At program point L2432(lines 2421 2434) the Hoare annotation is: (and (<= ~__ste_client_forwardReceiver0~0Int 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,344 INFO L854 garLoopResultBuilder]: At program point L2322-1(lines 2315 2324) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,344 INFO L854 garLoopResultBuilder]: At program point L2332-1(lines 2325 2334) the Hoare annotation is: (let ((.cse0 (<= ~__ste_client_forwardReceiver0~0Int 0)) (.cse1 (= ~rjh~0Int 2)) (.cse2 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and .cse0 (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse1 .cse2) (and .cse0 (<= ~__ste_client_forwardReceiver1~0Int 0) (<= ~__ste_client_forwardReceiver2~0Int 0) .cse1 .cse2))) [2022-01-10 23:49:15,344 INFO L858 garLoopResultBuilder]: For program point L2192-1(lines 2192 2208) no Hoare annotation was computed. [2022-01-10 23:49:15,344 INFO L854 garLoopResultBuilder]: At program point L2205-1(lines 2188 2211) the Hoare annotation is: (let ((.cse0 (= ~rjh~0Int 2)) (.cse1 (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_getClientForwardReceiver_#res#1Int| 0) .cse0 .cse1) (and (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) .cse0 .cse1))) [2022-01-10 23:49:15,344 INFO L858 garLoopResultBuilder]: For program point L2196-1(lines 2196 2207) no Hoare annotation was computed. [2022-01-10 23:49:15,344 INFO L858 garLoopResultBuilder]: For program point L2345-3(lines 2345 2352) no Hoare annotation was computed. [2022-01-10 23:49:15,344 INFO L858 garLoopResultBuilder]: For program point L2200-1(lines 2200 2206) no Hoare annotation was computed. [2022-01-10 23:49:15,344 INFO L858 garLoopResultBuilder]: For program point L540-4(lines 540 548) no Hoare annotation was computed. [2022-01-10 23:49:15,344 INFO L861 garLoopResultBuilder]: At program point L2345-5(lines 2335 2355) the Hoare annotation is: true [2022-01-10 23:49:15,344 INFO L854 garLoopResultBuilder]: At program point L543-8(lines 536 551) the Hoare annotation is: (and (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,344 INFO L858 garLoopResultBuilder]: For program point L543-6(lines 543 547) no Hoare annotation was computed. [2022-01-10 23:49:15,344 INFO L861 garLoopResultBuilder]: At program point L2300-1(lines 2291 2302) the Hoare annotation is: true [2022-01-10 23:49:15,344 INFO L854 garLoopResultBuilder]: At program point L2487-2(lines 2482 2490) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ULTIMATE.start_isReadable_#res#1Int|) (<= ~rjh~0Int |ULTIMATE.start_ULTIMATE.start_setClientForwardReceiver_~handle#1Int|) (= ~rjh~0Int 2) (<= 3 |ULTIMATE.start_ULTIMATE.start_setClientId_~handle#1Int|)) [2022-01-10 23:49:15,344 INFO L861 garLoopResultBuilder]: At program point L2312-1(lines 2303 2314) the Hoare annotation is: true [2022-01-10 23:49:15,345 INFO L858 garLoopResultBuilder]: For program point L1191-3(lines 1191 1197) no Hoare annotation was computed. [2022-01-10 23:49:15,345 INFO L861 garLoopResultBuilder]: At program point L1191-5(lines 1183 1200) the Hoare annotation is: true [2022-01-10 23:49:15,345 INFO L858 garLoopResultBuilder]: For program point L207-1(line 207) no Hoare annotation was computed. [2022-01-10 23:49:15,345 INFO L858 garLoopResultBuilder]: For program point L447-1(lines 447 458) no Hoare annotation was computed. [2022-01-10 23:49:15,345 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-01-10 23:49:15,345 INFO L854 garLoopResultBuilder]: At program point L208-1(lines 203 210) the Hoare annotation is: false [2022-01-10 23:49:15,345 INFO L861 garLoopResultBuilder]: At program point L456-1(lines 443 461) the Hoare annotation is: true [2022-01-10 23:49:15,345 INFO L858 garLoopResultBuilder]: For program point L451-1(lines 451 457) no Hoare annotation was computed. [2022-01-10 23:49:15,345 INFO L858 garLoopResultBuilder]: For program point L484-1(lines 484 495) no Hoare annotation was computed. [2022-01-10 23:49:15,345 INFO L861 garLoopResultBuilder]: At program point L493-1(lines 480 498) the Hoare annotation is: true [2022-01-10 23:49:15,345 INFO L858 garLoopResultBuilder]: For program point L488-1(lines 488 494) no Hoare annotation was computed. [2022-01-10 23:49:15,345 INFO L858 garLoopResultBuilder]: For program point L521-3(lines 521 532) no Hoare annotation was computed. [2022-01-10 23:49:15,345 INFO L861 garLoopResultBuilder]: At program point L530-3(lines 517 535) the Hoare annotation is: true [2022-01-10 23:49:15,345 INFO L858 garLoopResultBuilder]: For program point L525-3(lines 525 531) no Hoare annotation was computed. [2022-01-10 23:49:15,345 INFO L861 garLoopResultBuilder]: At program point L2487-3(lines 2482 2490) the Hoare annotation is: true [2022-01-10 23:49:15,345 INFO L861 garLoopResultBuilder]: At program point L2479-1(lines 2454 2481) the Hoare annotation is: true [2022-01-10 23:49:15,345 INFO L861 garLoopResultBuilder]: At program point L2391-1(lines 2384 2393) the Hoare annotation is: true [2022-01-10 23:49:15,345 INFO L861 garLoopResultBuilder]: At program point L2432-1(lines 2421 2434) the Hoare annotation is: true [2022-01-10 23:49:15,348 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:49:15,349 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 23:49:15,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:49:15 BasicIcfg [2022-01-10 23:49:15,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 23:49:15,412 INFO L158 Benchmark]: Toolchain (without parser) took 26660.65ms. Allocated memory was 209.7MB in the beginning and 600.8MB in the end (delta: 391.1MB). Free memory was 151.6MB in the beginning and 282.1MB in the end (delta: -130.5MB). Peak memory consumption was 354.9MB. Max. memory is 8.0GB. [2022-01-10 23:49:15,412 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 23:49:15,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.80ms. Allocated memory was 209.7MB in the beginning and 262.1MB in the end (delta: 52.4MB). Free memory was 151.5MB in the beginning and 194.7MB in the end (delta: -43.2MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-01-10 23:49:15,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.94ms. Allocated memory is still 262.1MB. Free memory was 194.7MB in the beginning and 189.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 23:49:15,412 INFO L158 Benchmark]: Boogie Preprocessor took 46.61ms. Allocated memory is still 262.1MB. Free memory was 189.4MB in the beginning and 186.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 23:49:15,413 INFO L158 Benchmark]: RCFGBuilder took 698.64ms. Allocated memory is still 262.1MB. Free memory was 186.3MB in the beginning and 151.7MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-01-10 23:49:15,413 INFO L158 Benchmark]: IcfgTransformer took 166.36ms. Allocated memory is still 262.1MB. Free memory was 151.7MB in the beginning and 134.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-10 23:49:15,413 INFO L158 Benchmark]: TraceAbstraction took 25036.78ms. Allocated memory was 262.1MB in the beginning and 600.8MB in the end (delta: 338.7MB). Free memory was 134.4MB in the beginning and 282.1MB in the end (delta: -147.7MB). Peak memory consumption was 287.5MB. Max. memory is 8.0GB. [2022-01-10 23:49:15,414 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 209.7MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 627.80ms. Allocated memory was 209.7MB in the beginning and 262.1MB in the end (delta: 52.4MB). Free memory was 151.5MB in the beginning and 194.7MB in the end (delta: -43.2MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.94ms. Allocated memory is still 262.1MB. Free memory was 194.7MB in the beginning and 189.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.61ms. Allocated memory is still 262.1MB. Free memory was 189.4MB in the beginning and 186.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 698.64ms. Allocated memory is still 262.1MB. Free memory was 186.3MB in the beginning and 151.7MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * IcfgTransformer took 166.36ms. Allocated memory is still 262.1MB. Free memory was 151.7MB in the beginning and 134.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 25036.78ms. Allocated memory was 262.1MB in the beginning and 600.8MB in the end (delta: 338.7MB). Free memory was 134.4MB in the beginning and 282.1MB in the end (delta: -147.7MB). Peak memory consumption was 287.5MB. 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: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: 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, 155 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 20.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2387 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2387 mSDsluCounter, 5731 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3065 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 2666 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7546occurred in iteration=11, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 3698 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 74 PreInvPairs, 1935 NumberOfFragments, 1470 HoareAnnotationTreeSize, 74 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 8.2s HoareSimplificationTime, 74 FomulaSimplificationsInter, 1507684 FormulaSimplificationTreeSizeReductionInter, 12.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 667 NumberOfCodeBlocks, 667 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 654 ConstructedInterpolants, 0 QuantifiedInterpolants, 1104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 14/14 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: 480]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2259]: Loop Invariant Derived loop invariant: (((~bvule32(__ste_client_forwardReceiver1, 0bv32) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 2325]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: ((((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(fwreceiver, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(fwreceiver), 1bv33))) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(1bv32, tmp)) && ~bvule32(1bv32, \result)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2412]: Loop Invariant Derived loop invariant: ((((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(fwreceiver, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(fwreceiver), 1bv33))) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: ((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(1bv32, tmp)) && ~bvule32(1bv32, \result)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2188]: Loop Invariant Derived loop invariant: (((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(\result, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2527]: Loop Invariant Derived loop invariant: (~bvule32(__ste_client_forwardReceiver1, 0bv32) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2482]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(1bv32, tmp)) && ~bvule32(1bv32, \result)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh - InvariantResult [Line: 2454]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (~bvule32(__ste_client_forwardReceiver1, 0bv32) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32) - InvariantResult [Line: 2259]: Loop Invariant Derived loop invariant: (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(1bv32, tmp)) && ~bvule32(1bv32, \result)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 2188]: Loop Invariant Derived loop invariant: ((~bvule32(3bv32, handle) && ~bvule32(rjh, handle)) && 2bv32 == rjh) || ((~bvule32(3bv32, handle) && ~bvule32(\result, 0bv32)) && 2bv32 == rjh) - InvariantResult [Line: 2384]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(1bv32, tmp)) && ~bvule32(1bv32, \result)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 2291]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2315]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2454]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(1bv32, tmp)) && ~bvule32(1bv32, \result)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: (~bvule32(__ste_client_forwardReceiver1, 0bv32) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32) - InvariantResult [Line: 2500]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2384]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1183]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2482]: Loop Invariant Derived loop invariant: (((~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(1bv32, tmp)) && ~bvule32(1bv32, \result)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2325]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2335]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2403]: Loop Invariant Derived loop invariant: ((((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(fwreceiver, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(fwreceiver), 1bv33))) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2482]: Loop Invariant Derived loop invariant: ((~bvule32(3bv32, handle) && ~bvule32(1bv32, \result)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 2291]: Loop Invariant Derived loop invariant: ((((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(fwreceiver, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(fwreceiver), 1bv33))) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2315]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(fwreceiver, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(fwreceiver), 1bv33))) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2303]: Loop Invariant Derived loop invariant: ((((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(fwreceiver, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(fwreceiver), 1bv33))) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2482]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2259]: Loop Invariant Derived loop invariant: (~bvule32(__ste_client_forwardReceiver1, 0bv32) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: (((~bvule32(__ste_client_forwardReceiver1, 0bv32) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 2303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2235]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2534]: Loop Invariant Derived loop invariant: (~bvule32(__ste_client_forwardReceiver1, 0bv32) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32) - InvariantResult [Line: 2394]: Loop Invariant Derived loop invariant: ((((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(fwreceiver, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(fwreceiver), 1bv33))) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2212]: Loop Invariant Derived loop invariant: ((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: (~bvule32(3bv32, handle) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 2371]: Loop Invariant Derived loop invariant: ((((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(fwreceiver, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(fwreceiver), 1bv33))) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 1183]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(1bv32, tmp)) && ~bvule32(1bv32, \result)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh - InvariantResult [Line: 2235]: Loop Invariant Derived loop invariant: ((((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(fwreceiver, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(fwreceiver), 1bv33))) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) - InvariantResult [Line: 2335]: Loop Invariant Derived loop invariant: ((((((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver1, 0bv32)) && ~bvule32(fwreceiver, 0bv32)) && ~bvule32(__ste_client_forwardReceiver2, 0bv32)) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(fwreceiver), 1bv33))) && 2bv32 == rjh) || (((~bvule32(3bv32, handle) && ~bvule32(__ste_client_forwardReceiver0, 0bv32)) && ~bvule32(rjh, handle)) && 2bv32 == rjh) RESULT: Ultimate proved your program to be correct! [2022-01-10 23:49:15,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...