/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_6.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 15:52:43,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 15:52:43,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 15:52:43,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 15:52:43,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 15:52:43,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 15:52:43,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 15:52:43,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 15:52:43,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 15:52:43,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 15:52:43,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 15:52:43,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 15:52:43,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 15:52:43,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 15:52:43,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 15:52:43,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 15:52:43,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 15:52:43,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 15:52:43,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 15:52:43,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 15:52:43,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 15:52:43,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 15:52:43,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 15:52:43,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 15:52:43,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 15:52:43,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 15:52:43,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 15:52:43,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 15:52:43,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 15:52:43,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 15:52:43,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 15:52:43,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 15:52:43,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 15:52:43,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 15:52:43,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 15:52:43,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 15:52:43,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 15:52:43,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 15:52:43,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 15:52:43,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 15:52:43,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 15:52:43,787 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 15:52:43,817 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 15:52:43,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 15:52:43,818 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 15:52:43,818 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 15:52:43,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 15:52:43,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 15:52:43,819 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 15:52:43,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 15:52:43,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 15:52:43,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 15:52:43,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 15:52:43,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 15:52:43,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 15:52:43,820 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 15:52:43,820 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 15:52:43,820 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 15:52:43,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 15:52:43,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 15:52:43,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 15:52:43,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 15:52:43,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 15:52:43,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:52:43,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 15:52:43,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 15:52:43,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 15:52:43,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 15:52:43,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 15:52:43,822 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 15:52:43,822 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 15:52:43,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 15:52:43,822 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 15:52:43,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 15:52:43,823 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 15:52:43,823 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 15:52:44,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 15:52:44,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 15:52:44,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 15:52:44,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 15:52:44,082 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 15:52:44,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_6.cil-2.c [2022-01-10 15:52:44,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3fd5d13/07ed7b40e1b64b83ad2f7a7cce0524ff/FLAG70e9a83de [2022-01-10 15:52:44,514 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 15:52:44,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_6.cil-2.c [2022-01-10 15:52:44,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3fd5d13/07ed7b40e1b64b83ad2f7a7cce0524ff/FLAG70e9a83de [2022-01-10 15:52:44,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3fd5d13/07ed7b40e1b64b83ad2f7a7cce0524ff [2022-01-10 15:52:44,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 15:52:44,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 15:52:44,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 15:52:44,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 15:52:44,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 15:52:44,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:44,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7922ff41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44, skipping insertion in model container [2022-01-10 15:52:44,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:44,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 15:52:44,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 15:52:44,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_6.cil-2.c[48455,48468] [2022-01-10 15:52:44,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:52:44,897 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 15:52:44,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_6.cil-2.c[48455,48468] [2022-01-10 15:52:44,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:52:44,972 INFO L208 MainTranslator]: Completed translation [2022-01-10 15:52:44,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44 WrapperNode [2022-01-10 15:52:44,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 15:52:44,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 15:52:44,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 15:52:44,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 15:52:44,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:45,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:45,033 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 534 [2022-01-10 15:52:45,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 15:52:45,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 15:52:45,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 15:52:45,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 15:52:45,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:45,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:45,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:45,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:45,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:45,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:45,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:45,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 15:52:45,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 15:52:45,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 15:52:45,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 15:52:45,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:45,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:52:45,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:45,125 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 15:52:45,127 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 15:52:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 15:52:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 15:52:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 15:52:45,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 15:52:45,281 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 15:52:45,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 15:52:45,295 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:52:45,761 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-10 15:52:45,762 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-10 15:52:45,762 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 15:52:45,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 15:52:45,772 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 15:52:45,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:45 BoogieIcfgContainer [2022-01-10 15:52:45,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 15:52:45,774 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 15:52:45,774 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 15:52:45,778 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 15:52:45,781 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:45" (1/1) ... [2022-01-10 15:52:45,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:52:45 BasicIcfg [2022-01-10 15:52:45,949 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 15:52:45,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 15:52:45,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 15:52:45,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 15:52:45,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:52:44" (1/4) ... [2022-01-10 15:52:45,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a65ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:52:45, skipping insertion in model container [2022-01-10 15:52:45,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:44" (2/4) ... [2022-01-10 15:52:45,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a65ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:52:45, skipping insertion in model container [2022-01-10 15:52:45,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:45" (3/4) ... [2022-01-10 15:52:45,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a65ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:52:45, skipping insertion in model container [2022-01-10 15:52:45,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:52:45" (4/4) ... [2022-01-10 15:52:45,959 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_6.cil-2.cTransformedIcfg [2022-01-10 15:52:45,963 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 15:52:45,963 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 15:52:46,006 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 15:52:46,011 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 15:52:46,011 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 15:52:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 156 states have (on average 1.7564102564102564) internal successors, (274), 157 states have internal predecessors, (274), 0 states have call successors, (0), 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 15:52:46,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 15:52:46,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:46,031 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 15:52:46,032 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:46,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:46,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1983893156, now seen corresponding path program 1 times [2022-01-10 15:52:46,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:46,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987931765] [2022-01-10 15:52:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:46,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:46,324 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 15:52:46,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:46,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987931765] [2022-01-10 15:52:46,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987931765] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:46,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:46,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:46,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863690666] [2022-01-10 15:52:46,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:46,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:46,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:46,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:46,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:46,364 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.7564102564102564) internal successors, (274), 157 states have internal predecessors, (274), 0 states have call successors, (0), 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 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 15:52:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:46,552 INFO L93 Difference]: Finished difference Result 455 states and 792 transitions. [2022-01-10 15:52:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:46,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 15:52:46,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:46,571 INFO L225 Difference]: With dead ends: 455 [2022-01-10 15:52:46,571 INFO L226 Difference]: Without dead ends: 279 [2022-01-10 15:52:46,575 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 15:52:46,580 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 203 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:46,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 464 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-01-10 15:52:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-01-10 15:52:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.525179856115108) internal successors, (424), 278 states have internal predecessors, (424), 0 states have call successors, (0), 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 15:52:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 424 transitions. [2022-01-10 15:52:46,652 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 424 transitions. Word has length 44 [2022-01-10 15:52:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:46,653 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 424 transitions. [2022-01-10 15:52:46,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 15:52:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 424 transitions. [2022-01-10 15:52:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 15:52:46,656 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:46,656 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:46,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 15:52:46,657 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:46,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash -251962637, now seen corresponding path program 1 times [2022-01-10 15:52:46,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:46,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021863807] [2022-01-10 15:52:46,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:46,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:52:46,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:46,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021863807] [2022-01-10 15:52:46,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021863807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:46,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:46,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:46,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974555591] [2022-01-10 15:52:46,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:46,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:46,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:46,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:46,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:46,781 INFO L87 Difference]: Start difference. First operand 279 states and 424 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 15:52:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:46,940 INFO L93 Difference]: Finished difference Result 445 states and 691 transitions. [2022-01-10 15:52:46,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:46,941 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 15:52:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:46,943 INFO L225 Difference]: With dead ends: 445 [2022-01-10 15:52:46,943 INFO L226 Difference]: Without dead ends: 308 [2022-01-10 15:52:46,950 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 15:52:46,951 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 13 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:46,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 376 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-01-10 15:52:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2022-01-10 15:52:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.5050167224080269) internal successors, (450), 299 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 450 transitions. [2022-01-10 15:52:46,972 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 450 transitions. Word has length 60 [2022-01-10 15:52:46,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:46,972 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 450 transitions. [2022-01-10 15:52:46,972 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 15:52:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 450 transitions. [2022-01-10 15:52:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 15:52:46,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:46,976 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:46,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 15:52:46,976 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:46,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:46,977 INFO L85 PathProgramCache]: Analyzing trace with hash 372036454, now seen corresponding path program 1 times [2022-01-10 15:52:46,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:46,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726843462] [2022-01-10 15:52:46,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:46,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 15:52:47,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:47,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726843462] [2022-01-10 15:52:47,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726843462] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:47,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:47,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:47,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670659507] [2022-01-10 15:52:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:47,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:47,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:47,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:47,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:47,075 INFO L87 Difference]: Start difference. First operand 300 states and 450 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 15:52:47,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:47,281 INFO L93 Difference]: Finished difference Result 702 states and 1080 transitions. [2022-01-10 15:52:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:47,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 81 [2022-01-10 15:52:47,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:47,285 INFO L225 Difference]: With dead ends: 702 [2022-01-10 15:52:47,285 INFO L226 Difference]: Without dead ends: 410 [2022-01-10 15:52:47,288 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 15:52:47,292 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 47 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:47,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 354 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 15:52:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-01-10 15:52:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 382. [2022-01-10 15:52:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.4383202099737533) internal successors, (548), 381 states have internal predecessors, (548), 0 states have call successors, (0), 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 15:52:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 548 transitions. [2022-01-10 15:52:47,312 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 548 transitions. Word has length 81 [2022-01-10 15:52:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:47,313 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 548 transitions. [2022-01-10 15:52:47,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 15:52:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 548 transitions. [2022-01-10 15:52:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 15:52:47,319 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:47,320 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:47,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 15:52:47,320 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:47,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:47,322 INFO L85 PathProgramCache]: Analyzing trace with hash 496109701, now seen corresponding path program 1 times [2022-01-10 15:52:47,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:47,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162794238] [2022-01-10 15:52:47,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:47,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 15:52:47,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:47,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162794238] [2022-01-10 15:52:47,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162794238] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:47,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:47,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:47,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171097743] [2022-01-10 15:52:47,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:47,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:47,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:47,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:47,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:47,424 INFO L87 Difference]: Start difference. First operand 382 states and 548 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 15:52:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:47,544 INFO L93 Difference]: Finished difference Result 812 states and 1181 transitions. [2022-01-10 15:52:47,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:47,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 81 [2022-01-10 15:52:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:47,548 INFO L225 Difference]: With dead ends: 812 [2022-01-10 15:52:47,548 INFO L226 Difference]: Without dead ends: 438 [2022-01-10 15:52:47,549 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 15:52:47,554 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 15 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:47,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 377 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:47,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-01-10 15:52:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 428. [2022-01-10 15:52:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.414519906323185) internal successors, (604), 427 states have internal predecessors, (604), 0 states have call successors, (0), 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 15:52:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 604 transitions. [2022-01-10 15:52:47,567 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 604 transitions. Word has length 81 [2022-01-10 15:52:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:47,568 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 604 transitions. [2022-01-10 15:52:47,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 15:52:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 604 transitions. [2022-01-10 15:52:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-10 15:52:47,570 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:47,570 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:47,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 15:52:47,571 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:47,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1737261980, now seen corresponding path program 1 times [2022-01-10 15:52:47,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:47,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090084754] [2022-01-10 15:52:47,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:47,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 15:52:47,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:47,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090084754] [2022-01-10 15:52:47,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090084754] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:47,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:47,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:47,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325119568] [2022-01-10 15:52:47,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:47,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:47,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:47,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:47,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:47,666 INFO L87 Difference]: Start difference. First operand 428 states and 604 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 15:52:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:47,820 INFO L93 Difference]: Finished difference Result 1046 states and 1496 transitions. [2022-01-10 15:52:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:47,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 94 [2022-01-10 15:52:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:47,825 INFO L225 Difference]: With dead ends: 1046 [2022-01-10 15:52:47,825 INFO L226 Difference]: Without dead ends: 620 [2022-01-10 15:52:47,826 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 15:52:47,826 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 182 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:47,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 208 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-01-10 15:52:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 604. [2022-01-10 15:52:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 1.4228855721393034) internal successors, (858), 603 states have internal predecessors, (858), 0 states have call successors, (0), 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 15:52:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 858 transitions. [2022-01-10 15:52:47,845 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 858 transitions. Word has length 94 [2022-01-10 15:52:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:47,845 INFO L470 AbstractCegarLoop]: Abstraction has 604 states and 858 transitions. [2022-01-10 15:52:47,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 15:52:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 858 transitions. [2022-01-10 15:52:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-10 15:52:47,847 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:47,847 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:47,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 15:52:47,848 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash -805921165, now seen corresponding path program 1 times [2022-01-10 15:52:47,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:47,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179550548] [2022-01-10 15:52:47,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:47,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 15:52:47,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:47,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179550548] [2022-01-10 15:52:47,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179550548] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:47,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:47,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:47,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102775909] [2022-01-10 15:52:47,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:47,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:47,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:47,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:47,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:47,926 INFO L87 Difference]: Start difference. First operand 604 states and 858 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 15:52:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:48,043 INFO L93 Difference]: Finished difference Result 1278 states and 1835 transitions. [2022-01-10 15:52:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:48,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 102 [2022-01-10 15:52:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:48,049 INFO L225 Difference]: With dead ends: 1278 [2022-01-10 15:52:48,049 INFO L226 Difference]: Without dead ends: 682 [2022-01-10 15:52:48,049 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 15:52:48,051 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 31 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:48,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 376 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-01-10 15:52:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 654. [2022-01-10 15:52:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.4058192955589586) internal successors, (918), 653 states have internal predecessors, (918), 0 states have call successors, (0), 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 15:52:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 918 transitions. [2022-01-10 15:52:48,066 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 918 transitions. Word has length 102 [2022-01-10 15:52:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:48,067 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 918 transitions. [2022-01-10 15:52:48,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 15:52:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 918 transitions. [2022-01-10 15:52:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-10 15:52:48,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:48,068 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:48,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 15:52:48,069 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:48,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1110135581, now seen corresponding path program 1 times [2022-01-10 15:52:48,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:48,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877579342] [2022-01-10 15:52:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:48,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-01-10 15:52:48,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:48,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877579342] [2022-01-10 15:52:48,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877579342] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:48,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:48,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:48,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271675538] [2022-01-10 15:52:48,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:48,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:48,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:48,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:48,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:48,148 INFO L87 Difference]: Start difference. First operand 654 states and 918 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 15:52:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:48,308 INFO L93 Difference]: Finished difference Result 1372 states and 1947 transitions. [2022-01-10 15:52:48,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:48,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 128 [2022-01-10 15:52:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:48,311 INFO L225 Difference]: With dead ends: 1372 [2022-01-10 15:52:48,311 INFO L226 Difference]: Without dead ends: 726 [2022-01-10 15:52:48,312 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 15:52:48,313 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 20 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:48,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 376 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-01-10 15:52:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 708. [2022-01-10 15:52:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.388967468175389) internal successors, (982), 707 states have internal predecessors, (982), 0 states have call successors, (0), 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 15:52:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 982 transitions. [2022-01-10 15:52:48,332 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 982 transitions. Word has length 128 [2022-01-10 15:52:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:48,333 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 982 transitions. [2022-01-10 15:52:48,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 15:52:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 982 transitions. [2022-01-10 15:52:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 15:52:48,337 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:48,337 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:48,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 15:52:48,338 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1910138808, now seen corresponding path program 1 times [2022-01-10 15:52:48,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:48,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526687287] [2022-01-10 15:52:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:48,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 15:52:48,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:48,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526687287] [2022-01-10 15:52:48,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526687287] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:48,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:48,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:48,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680905119] [2022-01-10 15:52:48,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:48,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:48,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:48,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:48,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:48,402 INFO L87 Difference]: Start difference. First operand 708 states and 982 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 15:52:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:48,487 INFO L93 Difference]: Finished difference Result 1430 states and 2001 transitions. [2022-01-10 15:52:48,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:48,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 134 [2022-01-10 15:52:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:48,492 INFO L225 Difference]: With dead ends: 1430 [2022-01-10 15:52:48,492 INFO L226 Difference]: Without dead ends: 1068 [2022-01-10 15:52:48,492 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 15:52:48,493 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 165 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:48,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 380 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-01-10 15:52:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2022-01-10 15:52:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1067 states have (on average 1.379568884723524) internal successors, (1472), 1067 states have internal predecessors, (1472), 0 states have call successors, (0), 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 15:52:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1472 transitions. [2022-01-10 15:52:48,517 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1472 transitions. Word has length 134 [2022-01-10 15:52:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:48,518 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 1472 transitions. [2022-01-10 15:52:48,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 15:52:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1472 transitions. [2022-01-10 15:52:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-10 15:52:48,520 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:48,520 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:48,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 15:52:48,521 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:48,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:48,521 INFO L85 PathProgramCache]: Analyzing trace with hash -868413884, now seen corresponding path program 1 times [2022-01-10 15:52:48,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:48,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470431091] [2022-01-10 15:52:48,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:48,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 15:52:48,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:48,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470431091] [2022-01-10 15:52:48,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470431091] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:48,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:48,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:48,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732177677] [2022-01-10 15:52:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:48,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:48,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:48,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:48,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:48,581 INFO L87 Difference]: Start difference. First operand 1068 states and 1472 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 15:52:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:48,720 INFO L93 Difference]: Finished difference Result 2221 states and 3091 transitions. [2022-01-10 15:52:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:48,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 153 [2022-01-10 15:52:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:48,725 INFO L225 Difference]: With dead ends: 2221 [2022-01-10 15:52:48,725 INFO L226 Difference]: Without dead ends: 1161 [2022-01-10 15:52:48,726 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 15:52:48,728 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 10 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:48,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 376 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-01-10 15:52:48,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1155. [2022-01-10 15:52:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.3639514731369151) internal successors, (1574), 1154 states have internal predecessors, (1574), 0 states have call successors, (0), 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 15:52:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1574 transitions. [2022-01-10 15:52:48,753 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1574 transitions. Word has length 153 [2022-01-10 15:52:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:48,753 INFO L470 AbstractCegarLoop]: Abstraction has 1155 states and 1574 transitions. [2022-01-10 15:52:48,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 15:52:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1574 transitions. [2022-01-10 15:52:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 15:52:48,756 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:48,756 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:48,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 15:52:48,756 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:48,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1637183231, now seen corresponding path program 1 times [2022-01-10 15:52:48,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:48,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791637228] [2022-01-10 15:52:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:48,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-01-10 15:52:48,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:48,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791637228] [2022-01-10 15:52:48,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791637228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:48,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:48,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:48,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360666850] [2022-01-10 15:52:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:48,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:48,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:48,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:48,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:48,842 INFO L87 Difference]: Start difference. First operand 1155 states and 1574 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 15:52:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:48,927 INFO L93 Difference]: Finished difference Result 2324 states and 3185 transitions. [2022-01-10 15:52:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:48,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 159 [2022-01-10 15:52:48,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:48,933 INFO L225 Difference]: With dead ends: 2324 [2022-01-10 15:52:48,934 INFO L226 Difference]: Without dead ends: 1544 [2022-01-10 15:52:48,936 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 15:52:48,937 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 169 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:48,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 379 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2022-01-10 15:52:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2022-01-10 15:52:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.3603370058327933) internal successors, (2099), 1543 states have internal predecessors, (2099), 0 states have call successors, (0), 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 15:52:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2099 transitions. [2022-01-10 15:52:48,974 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2099 transitions. Word has length 159 [2022-01-10 15:52:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:48,975 INFO L470 AbstractCegarLoop]: Abstraction has 1544 states and 2099 transitions. [2022-01-10 15:52:48,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 15:52:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2099 transitions. [2022-01-10 15:52:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 15:52:49,015 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:49,016 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:49,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 15:52:49,016 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:49,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash 387127648, now seen corresponding path program 1 times [2022-01-10 15:52:49,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:49,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012760571] [2022-01-10 15:52:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:49,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-01-10 15:52:49,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:49,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012760571] [2022-01-10 15:52:49,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012760571] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:49,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:49,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:49,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337505166] [2022-01-10 15:52:49,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:49,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:49,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:49,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:49,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:49,083 INFO L87 Difference]: Start difference. First operand 1544 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 15:52:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:49,131 INFO L93 Difference]: Finished difference Result 4588 states and 6221 transitions. [2022-01-10 15:52:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:49,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 160 [2022-01-10 15:52:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:49,142 INFO L225 Difference]: With dead ends: 4588 [2022-01-10 15:52:49,142 INFO L226 Difference]: Without dead ends: 3052 [2022-01-10 15:52:49,145 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 15:52:49,145 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 215 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:49,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 643 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2022-01-10 15:52:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 1548. [2022-01-10 15:52:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1547 states have (on average 1.3594053005817712) internal successors, (2103), 1547 states have internal predecessors, (2103), 0 states have call successors, (0), 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 15:52:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2103 transitions. [2022-01-10 15:52:49,199 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2103 transitions. Word has length 160 [2022-01-10 15:52:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:49,200 INFO L470 AbstractCegarLoop]: Abstraction has 1548 states and 2103 transitions. [2022-01-10 15:52:49,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 15:52:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2103 transitions. [2022-01-10 15:52:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 15:52:49,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:49,203 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:49,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 15:52:49,204 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:49,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:49,204 INFO L85 PathProgramCache]: Analyzing trace with hash -479924577, now seen corresponding path program 1 times [2022-01-10 15:52:49,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:49,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219738115] [2022-01-10 15:52:49,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:49,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 15:52:49,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:49,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219738115] [2022-01-10 15:52:49,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219738115] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:49,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:49,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:49,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622326383] [2022-01-10 15:52:49,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:49,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:49,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:49,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:49,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:49,272 INFO L87 Difference]: Start difference. First operand 1548 states and 2103 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 15:52:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:49,429 INFO L93 Difference]: Finished difference Result 3212 states and 4414 transitions. [2022-01-10 15:52:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:49,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 160 [2022-01-10 15:52:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:49,435 INFO L225 Difference]: With dead ends: 3212 [2022-01-10 15:52:49,436 INFO L226 Difference]: Without dead ends: 1672 [2022-01-10 15:52:49,438 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 15:52:49,438 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 15 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:49,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 358 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2022-01-10 15:52:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2022-01-10 15:52:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.3447037701974864) internal successors, (2247), 1671 states have internal predecessors, (2247), 0 states have call successors, (0), 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 15:52:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2247 transitions. [2022-01-10 15:52:49,482 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2247 transitions. Word has length 160 [2022-01-10 15:52:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:49,482 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 2247 transitions. [2022-01-10 15:52:49,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 15:52:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2247 transitions. [2022-01-10 15:52:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-10 15:52:49,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:49,486 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:49,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 15:52:49,486 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:49,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:49,487 INFO L85 PathProgramCache]: Analyzing trace with hash 702980728, now seen corresponding path program 1 times [2022-01-10 15:52:49,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:49,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820531389] [2022-01-10 15:52:49,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:49,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 15:52:49,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:49,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820531389] [2022-01-10 15:52:49,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820531389] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:49,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309453525] [2022-01-10 15:52:49,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:49,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:49,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:49,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:52:49,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 15:52:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:49,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 15:52:49,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-01-10 15:52:50,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:52:50,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309453525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:50,194 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:52:50,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:52:50,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163276069] [2022-01-10 15:52:50,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:50,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:50,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:50,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:50,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:50,195 INFO L87 Difference]: Start difference. First operand 1672 states and 2247 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 15:52:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:50,327 INFO L93 Difference]: Finished difference Result 3358 states and 4531 transitions. [2022-01-10 15:52:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:50,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 188 [2022-01-10 15:52:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:50,335 INFO L225 Difference]: With dead ends: 3358 [2022-01-10 15:52:50,335 INFO L226 Difference]: Without dead ends: 2093 [2022-01-10 15:52:50,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:50,337 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 163 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:50,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 377 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2022-01-10 15:52:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 2093. [2022-01-10 15:52:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 2092 states have (on average 1.3436902485659656) internal successors, (2811), 2092 states have internal predecessors, (2811), 0 states have call successors, (0), 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 15:52:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2811 transitions. [2022-01-10 15:52:50,389 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2811 transitions. Word has length 188 [2022-01-10 15:52:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:50,389 INFO L470 AbstractCegarLoop]: Abstraction has 2093 states and 2811 transitions. [2022-01-10 15:52:50,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 15:52:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2811 transitions. [2022-01-10 15:52:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-01-10 15:52:50,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:50,394 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2022-01-10 15:52:50,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 15:52:50,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-10 15:52:50,618 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:50,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1253196677, now seen corresponding path program 1 times [2022-01-10 15:52:50,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:50,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666418385] [2022-01-10 15:52:50,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:50,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2022-01-10 15:52:50,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:50,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666418385] [2022-01-10 15:52:50,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666418385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:50,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:50,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:50,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332856349] [2022-01-10 15:52:50,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:50,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:50,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:50,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:50,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:50,701 INFO L87 Difference]: Start difference. First operand 2093 states and 2811 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 15:52:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:50,851 INFO L93 Difference]: Finished difference Result 4292 states and 5793 transitions. [2022-01-10 15:52:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:50,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 219 [2022-01-10 15:52:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:50,860 INFO L225 Difference]: With dead ends: 4292 [2022-01-10 15:52:50,860 INFO L226 Difference]: Without dead ends: 2207 [2022-01-10 15:52:50,863 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 15:52:50,863 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 12 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:50,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 380 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2022-01-10 15:52:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2193. [2022-01-10 15:52:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 2192 states have (on average 1.3394160583941606) internal successors, (2936), 2192 states have internal predecessors, (2936), 0 states have call successors, (0), 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 15:52:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 2936 transitions. [2022-01-10 15:52:50,964 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 2936 transitions. Word has length 219 [2022-01-10 15:52:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:50,964 INFO L470 AbstractCegarLoop]: Abstraction has 2193 states and 2936 transitions. [2022-01-10 15:52:50,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 15:52:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2936 transitions. [2022-01-10 15:52:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-01-10 15:52:50,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:50,973 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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, 1] [2022-01-10 15:52:50,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 15:52:50,974 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash -718004850, now seen corresponding path program 1 times [2022-01-10 15:52:50,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:50,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772688992] [2022-01-10 15:52:50,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:50,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2022-01-10 15:52:51,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:51,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772688992] [2022-01-10 15:52:51,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772688992] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:51,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:51,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:51,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641356008] [2022-01-10 15:52:51,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:51,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:51,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:51,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:51,060 INFO L87 Difference]: Start difference. First operand 2193 states and 2936 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 15:52:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:51,243 INFO L93 Difference]: Finished difference Result 4563 states and 6181 transitions. [2022-01-10 15:52:51,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:51,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 221 [2022-01-10 15:52:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:51,253 INFO L225 Difference]: With dead ends: 4563 [2022-01-10 15:52:51,253 INFO L226 Difference]: Without dead ends: 2378 [2022-01-10 15:52:51,257 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 15:52:51,258 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 12 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:51,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 376 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:51,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2022-01-10 15:52:51,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2363. [2022-01-10 15:52:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2362 states have (on average 1.325571549534293) internal successors, (3131), 2362 states have internal predecessors, (3131), 0 states have call successors, (0), 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 15:52:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3131 transitions. [2022-01-10 15:52:51,332 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3131 transitions. Word has length 221 [2022-01-10 15:52:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:51,333 INFO L470 AbstractCegarLoop]: Abstraction has 2363 states and 3131 transitions. [2022-01-10 15:52:51,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 15:52:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3131 transitions. [2022-01-10 15:52:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-10 15:52:51,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:51,339 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:51,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 15:52:51,339 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash 308158102, now seen corresponding path program 1 times [2022-01-10 15:52:51,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:51,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951437427] [2022-01-10 15:52:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:51,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-01-10 15:52:51,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:51,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951437427] [2022-01-10 15:52:51,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951437427] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:51,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:51,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:51,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874473750] [2022-01-10 15:52:51,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:51,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:51,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:51,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:51,420 INFO L87 Difference]: Start difference. First operand 2363 states and 3131 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 15:52:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:51,598 INFO L93 Difference]: Finished difference Result 4913 states and 6591 transitions. [2022-01-10 15:52:51,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:51,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 253 [2022-01-10 15:52:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:51,607 INFO L225 Difference]: With dead ends: 4913 [2022-01-10 15:52:51,607 INFO L226 Difference]: Without dead ends: 2558 [2022-01-10 15:52:51,610 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 15:52:51,610 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 12 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:51,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 376 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2022-01-10 15:52:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2543. [2022-01-10 15:52:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2542 states have (on average 1.3123524783634932) internal successors, (3336), 2542 states have internal predecessors, (3336), 0 states have call successors, (0), 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 15:52:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3336 transitions. [2022-01-10 15:52:51,674 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3336 transitions. Word has length 253 [2022-01-10 15:52:51,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:51,674 INFO L470 AbstractCegarLoop]: Abstraction has 2543 states and 3336 transitions. [2022-01-10 15:52:51,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 15:52:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3336 transitions. [2022-01-10 15:52:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-01-10 15:52:51,681 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:51,681 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:51,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 15:52:51,681 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:51,682 INFO L85 PathProgramCache]: Analyzing trace with hash -429458205, now seen corresponding path program 1 times [2022-01-10 15:52:51,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:51,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273864954] [2022-01-10 15:52:51,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:51,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2022-01-10 15:52:51,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:51,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273864954] [2022-01-10 15:52:51,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273864954] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:51,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:51,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:51,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791738466] [2022-01-10 15:52:51,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:51,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:51,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:51,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:51,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:51,816 INFO L87 Difference]: Start difference. First operand 2543 states and 3336 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 15:52:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:51,929 INFO L93 Difference]: Finished difference Result 5092 states and 6696 transitions. [2022-01-10 15:52:51,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:51,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 287 [2022-01-10 15:52:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:51,940 INFO L225 Difference]: With dead ends: 5092 [2022-01-10 15:52:51,940 INFO L226 Difference]: Without dead ends: 3046 [2022-01-10 15:52:51,943 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 15:52:51,943 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 151 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:51,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 583 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2022-01-10 15:52:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 3046. [2022-01-10 15:52:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3046 states, 3045 states have (on average 1.3103448275862069) internal successors, (3990), 3045 states have internal predecessors, (3990), 0 states have call successors, (0), 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 15:52:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 3990 transitions. [2022-01-10 15:52:52,012 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 3990 transitions. Word has length 287 [2022-01-10 15:52:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:52,013 INFO L470 AbstractCegarLoop]: Abstraction has 3046 states and 3990 transitions. [2022-01-10 15:52:52,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 15:52:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 3990 transitions. [2022-01-10 15:52:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-01-10 15:52:52,020 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:52,020 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:52,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 15:52:52,020 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:52,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:52,021 INFO L85 PathProgramCache]: Analyzing trace with hash -305384958, now seen corresponding path program 1 times [2022-01-10 15:52:52,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:52,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370137016] [2022-01-10 15:52:52,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:52,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-01-10 15:52:52,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:52,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370137016] [2022-01-10 15:52:52,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370137016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:52,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:52,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:52,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483977047] [2022-01-10 15:52:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:52,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:52,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:52,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:52,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:52,110 INFO L87 Difference]: Start difference. First operand 3046 states and 3990 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 15:52:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:52,192 INFO L93 Difference]: Finished difference Result 5634 states and 7377 transitions. [2022-01-10 15:52:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 287 [2022-01-10 15:52:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:52,204 INFO L225 Difference]: With dead ends: 5634 [2022-01-10 15:52:52,204 INFO L226 Difference]: Without dead ends: 3085 [2022-01-10 15:52:52,208 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 15:52:52,209 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 10 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:52,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 457 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2022-01-10 15:52:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 3085. [2022-01-10 15:52:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3085 states, 3084 states have (on average 1.308041504539559) internal successors, (4034), 3084 states have internal predecessors, (4034), 0 states have call successors, (0), 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 15:52:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 4034 transitions. [2022-01-10 15:52:52,279 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 4034 transitions. Word has length 287 [2022-01-10 15:52:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:52,280 INFO L470 AbstractCegarLoop]: Abstraction has 3085 states and 4034 transitions. [2022-01-10 15:52:52,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 15:52:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 4034 transitions. [2022-01-10 15:52:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-01-10 15:52:52,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:52,287 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:52,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 15:52:52,288 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:52,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:52,288 INFO L85 PathProgramCache]: Analyzing trace with hash 803430241, now seen corresponding path program 1 times [2022-01-10 15:52:52,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:52,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777189569] [2022-01-10 15:52:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:52,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-01-10 15:52:52,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:52,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777189569] [2022-01-10 15:52:52,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777189569] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:52,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:52,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:52,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007804735] [2022-01-10 15:52:52,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:52,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:52,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:52,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:52,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:52,365 INFO L87 Difference]: Start difference. First operand 3085 states and 4034 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 15:52:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:52,458 INFO L93 Difference]: Finished difference Result 5710 states and 7463 transitions. [2022-01-10 15:52:52,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:52,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 287 [2022-01-10 15:52:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:52,467 INFO L225 Difference]: With dead ends: 5710 [2022-01-10 15:52:52,467 INFO L226 Difference]: Without dead ends: 3122 [2022-01-10 15:52:52,470 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 15:52:52,471 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 10 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:52,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 455 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2022-01-10 15:52:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3122. [2022-01-10 15:52:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 3121 states have (on average 1.305991669336751) internal successors, (4076), 3121 states have internal predecessors, (4076), 0 states have call successors, (0), 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 15:52:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4076 transitions. [2022-01-10 15:52:52,556 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4076 transitions. Word has length 287 [2022-01-10 15:52:52,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:52,556 INFO L470 AbstractCegarLoop]: Abstraction has 3122 states and 4076 transitions. [2022-01-10 15:52:52,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 15:52:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4076 transitions. [2022-01-10 15:52:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-01-10 15:52:52,564 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:52,564 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:52,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 15:52:52,564 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:52,565 INFO L85 PathProgramCache]: Analyzing trace with hash -183152448, now seen corresponding path program 1 times [2022-01-10 15:52:52,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:52,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181644798] [2022-01-10 15:52:52,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:52,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2022-01-10 15:52:52,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:52,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181644798] [2022-01-10 15:52:52,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181644798] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:52,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:52,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:52,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775843479] [2022-01-10 15:52:52,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:52,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:52,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:52,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:52,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:52,642 INFO L87 Difference]: Start difference. First operand 3122 states and 4076 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 15:52:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:52,756 INFO L93 Difference]: Finished difference Result 6223 states and 8149 transitions. [2022-01-10 15:52:52,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:52,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 287 [2022-01-10 15:52:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:52,769 INFO L225 Difference]: With dead ends: 6223 [2022-01-10 15:52:52,770 INFO L226 Difference]: Without dead ends: 3598 [2022-01-10 15:52:52,773 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 15:52:52,774 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 191 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:52,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 586 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2022-01-10 15:52:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 3598. [2022-01-10 15:52:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3598 states, 3597 states have (on average 1.3063664164581597) internal successors, (4699), 3597 states have internal predecessors, (4699), 0 states have call successors, (0), 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 15:52:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 3598 states and 4699 transitions. [2022-01-10 15:52:52,847 INFO L78 Accepts]: Start accepts. Automaton has 3598 states and 4699 transitions. Word has length 287 [2022-01-10 15:52:52,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:52,848 INFO L470 AbstractCegarLoop]: Abstraction has 3598 states and 4699 transitions. [2022-01-10 15:52:52,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 15:52:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3598 states and 4699 transitions. [2022-01-10 15:52:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-01-10 15:52:52,856 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:52,856 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:52:52,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 15:52:52,857 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash 280925373, now seen corresponding path program 1 times [2022-01-10 15:52:52,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:52,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684075898] [2022-01-10 15:52:52,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:52,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2022-01-10 15:52:52,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:52,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684075898] [2022-01-10 15:52:52,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684075898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:52,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:52,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:52,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398638142] [2022-01-10 15:52:52,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:52,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:52,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:52,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:52,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:52,958 INFO L87 Difference]: Start difference. First operand 3598 states and 4699 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 15:52:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:53,073 INFO L93 Difference]: Finished difference Result 10552 states and 13807 transitions. [2022-01-10 15:52:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:53,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 325 [2022-01-10 15:52:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:53,088 INFO L225 Difference]: With dead ends: 10552 [2022-01-10 15:52:53,088 INFO L226 Difference]: Without dead ends: 6962 [2022-01-10 15:52:53,093 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 15:52:53,094 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 135 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 644 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 15:52:53,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 644 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6962 states. [2022-01-10 15:52:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6962 to 6960. [2022-01-10 15:52:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6960 states, 6959 states have (on average 1.3075154476217847) internal successors, (9099), 6959 states have internal predecessors, (9099), 0 states have call successors, (0), 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 15:52:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6960 states to 6960 states and 9099 transitions. [2022-01-10 15:52:53,232 INFO L78 Accepts]: Start accepts. Automaton has 6960 states and 9099 transitions. Word has length 325 [2022-01-10 15:52:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:53,233 INFO L470 AbstractCegarLoop]: Abstraction has 6960 states and 9099 transitions. [2022-01-10 15:52:53,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 15:52:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6960 states and 9099 transitions. [2022-01-10 15:52:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2022-01-10 15:52:53,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:53,249 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:52:53,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 15:52:53,250 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:53,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash 838700802, now seen corresponding path program 1 times [2022-01-10 15:52:53,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:53,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573453874] [2022-01-10 15:52:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:53,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2022-01-10 15:52:53,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:53,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573453874] [2022-01-10 15:52:53,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573453874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:53,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:53,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:53,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004508922] [2022-01-10 15:52:53,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:53,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:53,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:53,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:53,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:53,347 INFO L87 Difference]: Start difference. First operand 6960 states and 9099 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 15:52:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:53,625 INFO L93 Difference]: Finished difference Result 14066 states and 18390 transitions. [2022-01-10 15:52:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:53,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 378 [2022-01-10 15:52:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:53,638 INFO L225 Difference]: With dead ends: 14066 [2022-01-10 15:52:53,638 INFO L226 Difference]: Without dead ends: 7100 [2022-01-10 15:52:53,645 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 15:52:53,646 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 192 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:53,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 200 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7100 states. [2022-01-10 15:52:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7100 to 7002. [2022-01-10 15:52:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7002 states, 7001 states have (on average 1.303670904156549) internal successors, (9127), 7001 states have internal predecessors, (9127), 0 states have call successors, (0), 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 15:52:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7002 states to 7002 states and 9127 transitions. [2022-01-10 15:52:53,812 INFO L78 Accepts]: Start accepts. Automaton has 7002 states and 9127 transitions. Word has length 378 [2022-01-10 15:52:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:53,812 INFO L470 AbstractCegarLoop]: Abstraction has 7002 states and 9127 transitions. [2022-01-10 15:52:53,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 15:52:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 7002 states and 9127 transitions. [2022-01-10 15:52:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2022-01-10 15:52:53,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:53,831 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:52:53,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 15:52:53,831 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1909730203, now seen corresponding path program 1 times [2022-01-10 15:52:53,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:53,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605739664] [2022-01-10 15:52:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:53,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 572 proven. 26 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-01-10 15:52:53,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:53,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605739664] [2022-01-10 15:52:53,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605739664] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:53,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767271182] [2022-01-10 15:52:53,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:53,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:53,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:53,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:52:53,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 15:52:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:54,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 1669 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 15:52:54,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 572 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2022-01-10 15:52:54,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:52:54,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767271182] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:54,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:52:54,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:52:54,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953727044] [2022-01-10 15:52:54,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:54,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:54,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:54,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:54,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:54,898 INFO L87 Difference]: Start difference. First operand 7002 states and 9127 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 15:52:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:55,092 INFO L93 Difference]: Finished difference Result 14040 states and 18340 transitions. [2022-01-10 15:52:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:55,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 435 [2022-01-10 15:52:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:55,108 INFO L225 Difference]: With dead ends: 14040 [2022-01-10 15:52:55,108 INFO L226 Difference]: Without dead ends: 8003 [2022-01-10 15:52:55,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:55,117 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 161 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:55,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 370 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8003 states. [2022-01-10 15:52:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8003 to 8003. [2022-01-10 15:52:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8003 states, 8002 states have (on average 1.3056735816045988) internal successors, (10448), 8002 states have internal predecessors, (10448), 0 states have call successors, (0), 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 15:52:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 10448 transitions. [2022-01-10 15:52:55,270 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 10448 transitions. Word has length 435 [2022-01-10 15:52:55,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:55,271 INFO L470 AbstractCegarLoop]: Abstraction has 8003 states and 10448 transitions. [2022-01-10 15:52:55,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 15:52:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 10448 transitions. [2022-01-10 15:52:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2022-01-10 15:52:55,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:55,287 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:52:55,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 15:52:55,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-10 15:52:55,504 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash -838886548, now seen corresponding path program 1 times [2022-01-10 15:52:55,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:55,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568220405] [2022-01-10 15:52:55,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:55,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2322 backedges. 1281 proven. 18 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2022-01-10 15:52:55,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:55,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568220405] [2022-01-10 15:52:55,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568220405] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:55,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767508697] [2022-01-10 15:52:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:55,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:55,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:55,612 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:52:55,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 15:52:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:55,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 1807 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 15:52:55,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2322 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 1629 trivial. 0 not checked. [2022-01-10 15:52:56,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:52:56,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767508697] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:56,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:52:56,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:52:56,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522416229] [2022-01-10 15:52:56,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:56,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:56,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:56,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:56,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:56,503 INFO L87 Difference]: Start difference. First operand 8003 states and 10448 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 15:52:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:56,684 INFO L93 Difference]: Finished difference Result 16042 states and 20964 transitions. [2022-01-10 15:52:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:56,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 480 [2022-01-10 15:52:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:56,701 INFO L225 Difference]: With dead ends: 16042 [2022-01-10 15:52:56,701 INFO L226 Difference]: Without dead ends: 9004 [2022-01-10 15:52:56,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:56,711 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 167 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:56,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 372 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9004 states. [2022-01-10 15:52:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9004 to 9004. [2022-01-10 15:52:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9004 states, 9003 states have (on average 1.3067866266799955) internal successors, (11765), 9003 states have internal predecessors, (11765), 0 states have call successors, (0), 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 15:52:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9004 states to 9004 states and 11765 transitions. [2022-01-10 15:52:56,896 INFO L78 Accepts]: Start accepts. Automaton has 9004 states and 11765 transitions. Word has length 480 [2022-01-10 15:52:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:56,896 INFO L470 AbstractCegarLoop]: Abstraction has 9004 states and 11765 transitions. [2022-01-10 15:52:56,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 15:52:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 9004 states and 11765 transitions. [2022-01-10 15:52:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2022-01-10 15:52:56,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:56,915 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:52:56,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 15:52:57,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:57,128 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:57,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1986315104, now seen corresponding path program 1 times [2022-01-10 15:52:57,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:57,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687765583] [2022-01-10 15:52:57,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:57,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1996 proven. 26 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2022-01-10 15:52:57,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:57,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687765583] [2022-01-10 15:52:57,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687765583] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:57,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750786835] [2022-01-10 15:52:57,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:57,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:57,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:57,292 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:52:57,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 15:52:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:57,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 2191 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:57,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 809 proven. 0 refuted. 0 times theorem prover too weak. 2753 trivial. 0 not checked. [2022-01-10 15:52:58,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:52:58,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750786835] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:58,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:52:58,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:52:58,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990876267] [2022-01-10 15:52:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:58,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:58,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:58,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:58,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:58,391 INFO L87 Difference]: Start difference. First operand 9004 states and 11765 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 15:52:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:58,579 INFO L93 Difference]: Finished difference Result 17995 states and 23557 transitions. [2022-01-10 15:52:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:58,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 586 [2022-01-10 15:52:58,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:58,599 INFO L225 Difference]: With dead ends: 17995 [2022-01-10 15:52:58,599 INFO L226 Difference]: Without dead ends: 9956 [2022-01-10 15:52:58,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:58,609 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 146 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:58,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 583 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2022-01-10 15:52:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 9956. [2022-01-10 15:52:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9956 states, 9955 states have (on average 1.3063787041687593) internal successors, (13005), 9955 states have internal predecessors, (13005), 0 states have call successors, (0), 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 15:52:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9956 states to 9956 states and 13005 transitions. [2022-01-10 15:52:58,842 INFO L78 Accepts]: Start accepts. Automaton has 9956 states and 13005 transitions. Word has length 586 [2022-01-10 15:52:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:58,843 INFO L470 AbstractCegarLoop]: Abstraction has 9956 states and 13005 transitions. [2022-01-10 15:52:58,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 15:52:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 9956 states and 13005 transitions. [2022-01-10 15:52:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2022-01-10 15:52:58,863 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:58,865 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:52:58,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 15:52:59,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:59,080 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:59,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:59,080 INFO L85 PathProgramCache]: Analyzing trace with hash -489828746, now seen corresponding path program 1 times [2022-01-10 15:52:59,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:59,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097396230] [2022-01-10 15:52:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:59,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1996 proven. 26 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2022-01-10 15:52:59,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:59,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097396230] [2022-01-10 15:52:59,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097396230] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:59,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261002816] [2022-01-10 15:52:59,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:59,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:59,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:59,221 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:52:59,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 15:52:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:59,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 2194 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:59,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:53:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1212 proven. 0 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2022-01-10 15:53:00,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:53:00,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261002816] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:00,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:53:00,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:53:00,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221166293] [2022-01-10 15:53:00,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:00,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:00,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:00,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:00,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:00,244 INFO L87 Difference]: Start difference. First operand 9956 states and 13005 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 15:53:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:00,443 INFO L93 Difference]: Finished difference Result 19053 states and 24889 transitions. [2022-01-10 15:53:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 587 [2022-01-10 15:53:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:00,462 INFO L225 Difference]: With dead ends: 19053 [2022-01-10 15:53:00,462 INFO L226 Difference]: Without dead ends: 10062 [2022-01-10 15:53:00,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 587 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:00,473 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 18 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:00,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 468 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:53:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10062 states. [2022-01-10 15:53:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10062 to 10062. [2022-01-10 15:53:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10062 states, 10061 states have (on average 1.304542292018686) internal successors, (13125), 10061 states have internal predecessors, (13125), 0 states have call successors, (0), 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 15:53:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10062 states to 10062 states and 13125 transitions. [2022-01-10 15:53:00,644 INFO L78 Accepts]: Start accepts. Automaton has 10062 states and 13125 transitions. Word has length 587 [2022-01-10 15:53:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:00,644 INFO L470 AbstractCegarLoop]: Abstraction has 10062 states and 13125 transitions. [2022-01-10 15:53:00,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 15:53:00,645 INFO L276 IsEmpty]: Start isEmpty. Operand 10062 states and 13125 transitions. [2022-01-10 15:53:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2022-01-10 15:53:00,659 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:00,660 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:53:00,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 15:53:00,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-10 15:53:00,884 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:00,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash 949456790, now seen corresponding path program 1 times [2022-01-10 15:53:00,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:00,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610908072] [2022-01-10 15:53:00,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:00,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1996 proven. 26 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2022-01-10 15:53:01,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:01,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610908072] [2022-01-10 15:53:01,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610908072] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:53:01,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960217049] [2022-01-10 15:53:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:01,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:53:01,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:53:01,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:53:01,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 15:53:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:01,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 2197 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:53:01,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:53:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1521 proven. 0 refuted. 0 times theorem prover too weak. 2041 trivial. 0 not checked. [2022-01-10 15:53:01,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:53:01,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960217049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:01,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:53:01,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:53:01,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640700075] [2022-01-10 15:53:01,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:01,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:01,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:01,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:01,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:01,968 INFO L87 Difference]: Start difference. First operand 10062 states and 13125 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 15:53:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:02,163 INFO L93 Difference]: Finished difference Result 20068 states and 26226 transitions. [2022-01-10 15:53:02,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:02,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 588 [2022-01-10 15:53:02,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:02,184 INFO L225 Difference]: With dead ends: 20068 [2022-01-10 15:53:02,184 INFO L226 Difference]: Without dead ends: 10971 [2022-01-10 15:53:02,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:02,195 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 149 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:02,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 585 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:53:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10971 states. [2022-01-10 15:53:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10971 to 10971. [2022-01-10 15:53:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10971 states, 10970 states have (on average 1.3048313582497721) internal successors, (14314), 10970 states have internal predecessors, (14314), 0 states have call successors, (0), 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 15:53:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10971 states to 10971 states and 14314 transitions. [2022-01-10 15:53:02,380 INFO L78 Accepts]: Start accepts. Automaton has 10971 states and 14314 transitions. Word has length 588 [2022-01-10 15:53:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:02,381 INFO L470 AbstractCegarLoop]: Abstraction has 10971 states and 14314 transitions. [2022-01-10 15:53:02,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 15:53:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 10971 states and 14314 transitions. [2022-01-10 15:53:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2022-01-10 15:53:02,398 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:02,398 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:02,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 15:53:02,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-10 15:53:02,612 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:02,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:02,612 INFO L85 PathProgramCache]: Analyzing trace with hash 185386333, now seen corresponding path program 1 times [2022-01-10 15:53:02,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:02,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781459896] [2022-01-10 15:53:02,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:02,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 3420 proven. 26 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2022-01-10 15:53:02,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:02,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781459896] [2022-01-10 15:53:02,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781459896] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:53:02,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958721592] [2022-01-10 15:53:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:02,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:53:02,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:53:02,762 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:53:02,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 15:53:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:03,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 2722 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 15:53:03,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:53:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 1047 proven. 0 refuted. 0 times theorem prover too weak. 4631 trivial. 0 not checked. [2022-01-10 15:53:03,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:53:03,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958721592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:03,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:53:03,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:53:03,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196381445] [2022-01-10 15:53:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:03,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:03,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:03,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:03,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:03,957 INFO L87 Difference]: Start difference. First operand 10971 states and 14314 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 15:53:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:04,130 INFO L93 Difference]: Finished difference Result 21978 states and 28714 transitions. [2022-01-10 15:53:04,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:04,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 740 [2022-01-10 15:53:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:04,153 INFO L225 Difference]: With dead ends: 21978 [2022-01-10 15:53:04,154 INFO L226 Difference]: Without dead ends: 11972 [2022-01-10 15:53:04,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 740 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:04,165 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 161 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:04,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 364 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:53:04,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11972 states. [2022-01-10 15:53:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11972 to 11972. [2022-01-10 15:53:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11972 states, 11971 states have (on average 1.3070754322947122) internal successors, (15647), 11971 states have internal predecessors, (15647), 0 states have call successors, (0), 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 15:53:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11972 states to 11972 states and 15647 transitions. [2022-01-10 15:53:04,436 INFO L78 Accepts]: Start accepts. Automaton has 11972 states and 15647 transitions. Word has length 740 [2022-01-10 15:53:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:04,437 INFO L470 AbstractCegarLoop]: Abstraction has 11972 states and 15647 transitions. [2022-01-10 15:53:04,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 15:53:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 11972 states and 15647 transitions. [2022-01-10 15:53:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2022-01-10 15:53:04,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:04,459 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 21, 21, 20, 20, 19, 19, 18, 18, 18, 18, 14, 13, 13, 12, 12, 11, 11, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:04,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 15:53:04,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:53:04,680 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash -909847521, now seen corresponding path program 1 times [2022-01-10 15:53:04,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:04,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419955801] [2022-01-10 15:53:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:04,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6309 backedges. 2395 proven. 18 refuted. 0 times theorem prover too weak. 3896 trivial. 0 not checked. [2022-01-10 15:53:04,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:04,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419955801] [2022-01-10 15:53:04,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419955801] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:53:04,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591160325] [2022-01-10 15:53:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:04,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:53:04,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:53:04,832 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:53:04,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 15:53:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:05,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 2850 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 15:53:05,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:53:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6309 backedges. 1221 proven. 0 refuted. 0 times theorem prover too weak. 5088 trivial. 0 not checked. [2022-01-10 15:53:06,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:53:06,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591160325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:06,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:53:06,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:53:06,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099004290] [2022-01-10 15:53:06,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:06,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:06,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:06,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:06,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:06,087 INFO L87 Difference]: Start difference. First operand 11972 states and 15647 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 15:53:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:06,284 INFO L93 Difference]: Finished difference Result 23980 states and 31374 transitions. [2022-01-10 15:53:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:06,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 783 [2022-01-10 15:53:06,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:06,305 INFO L225 Difference]: With dead ends: 23980 [2022-01-10 15:53:06,305 INFO L226 Difference]: Without dead ends: 12973 [2022-01-10 15:53:06,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:06,318 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 165 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:06,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 366 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:53:06,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2022-01-10 15:53:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12973. [2022-01-10 15:53:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12973 states, 12972 states have (on average 1.3086648165279062) internal successors, (16976), 12972 states have internal predecessors, (16976), 0 states have call successors, (0), 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 15:53:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12973 states to 12973 states and 16976 transitions. [2022-01-10 15:53:06,577 INFO L78 Accepts]: Start accepts. Automaton has 12973 states and 16976 transitions. Word has length 783 [2022-01-10 15:53:06,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:06,578 INFO L470 AbstractCegarLoop]: Abstraction has 12973 states and 16976 transitions. [2022-01-10 15:53:06,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 15:53:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 12973 states and 16976 transitions. [2022-01-10 15:53:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2022-01-10 15:53:06,601 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:06,601 INFO L514 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:06,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-10 15:53:06,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-10 15:53:06,815 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:06,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1035635059, now seen corresponding path program 1 times [2022-01-10 15:53:06,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:06,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310242767] [2022-01-10 15:53:06,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:06,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 2818 proven. 18 refuted. 0 times theorem prover too weak. 5471 trivial. 0 not checked. [2022-01-10 15:53:06,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:06,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310242767] [2022-01-10 15:53:06,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310242767] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:53:06,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171791043] [2022-01-10 15:53:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:06,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:53:06,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:53:06,954 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:53:06,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 15:53:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:07,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 3243 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 15:53:07,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:53:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 723 proven. 0 refuted. 0 times theorem prover too weak. 7584 trivial. 0 not checked. [2022-01-10 15:53:08,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:53:08,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171791043] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:08,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:53:08,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:53:08,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922823267] [2022-01-10 15:53:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:08,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:08,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:08,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:08,291 INFO L87 Difference]: Start difference. First operand 12973 states and 16976 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 15:53:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:08,469 INFO L93 Difference]: Finished difference Result 25982 states and 34038 transitions. [2022-01-10 15:53:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:08,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 897 [2022-01-10 15:53:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:08,487 INFO L225 Difference]: With dead ends: 25982 [2022-01-10 15:53:08,487 INFO L226 Difference]: Without dead ends: 13974 [2022-01-10 15:53:08,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 897 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:08,498 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 164 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:08,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 363 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:53:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13974 states. [2022-01-10 15:53:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13974 to 13974. [2022-01-10 15:53:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13974 states, 13973 states have (on average 1.3104558791955916) internal successors, (18311), 13973 states have internal predecessors, (18311), 0 states have call successors, (0), 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 15:53:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13974 states to 13974 states and 18311 transitions. [2022-01-10 15:53:08,712 INFO L78 Accepts]: Start accepts. Automaton has 13974 states and 18311 transitions. Word has length 897 [2022-01-10 15:53:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:08,714 INFO L470 AbstractCegarLoop]: Abstraction has 13974 states and 18311 transitions. [2022-01-10 15:53:08,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 15:53:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 13974 states and 18311 transitions. [2022-01-10 15:53:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2022-01-10 15:53:08,737 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:08,738 INFO L514 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:08,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-10 15:53:08,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:53:08,951 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash -786810540, now seen corresponding path program 1 times [2022-01-10 15:53:08,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:08,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52280011] [2022-01-10 15:53:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:08,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 4844 proven. 26 refuted. 0 times theorem prover too weak. 3437 trivial. 0 not checked. [2022-01-10 15:53:09,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52280011] [2022-01-10 15:53:09,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52280011] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:53:09,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564119001] [2022-01-10 15:53:09,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,221 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:53:09,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:53:09,222 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:53:09,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-10 15:53:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 3262 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:53:09,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:53:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 4844 proven. 26 refuted. 0 times theorem prover too weak. 3437 trivial. 0 not checked. [2022-01-10 15:53:10,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 15:53:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 4844 proven. 26 refuted. 0 times theorem prover too weak. 3437 trivial. 0 not checked. [2022-01-10 15:53:11,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564119001] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 15:53:11,721 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 15:53:11,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 15:53:11,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386802941] [2022-01-10 15:53:11,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 15:53:11,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 15:53:11,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:11,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 15:53:11,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 15:53:11,724 INFO L87 Difference]: Start difference. First operand 13974 states and 18311 transitions. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 0 states have call successors, (0), 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 15:53:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:12,474 INFO L93 Difference]: Finished difference Result 26553 states and 35410 transitions. [2022-01-10 15:53:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 15:53:12,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 0 states have call successors, (0), 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 897 [2022-01-10 15:53:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:12,475 INFO L225 Difference]: With dead ends: 26553 [2022-01-10 15:53:12,475 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 15:53:12,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1804 GetRequests, 1796 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-10 15:53:12,490 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 402 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:12,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 1041 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 15:53:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 15:53:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 15:53:12,491 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 15:53:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 15:53:12,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 897 [2022-01-10 15:53:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:12,492 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 15:53:12,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 0 states have call successors, (0), 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 15:53:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 15:53:12,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 15:53:12,495 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 15:53:12,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-10 15:53:12,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-01-10 15:53:12,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 15:53:18,471 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 15:53:18,472 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 15:53:18,472 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-01-10 15:53:18,472 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-01-10 15:53:18,472 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-01-10 15:53:18,472 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-01-10 15:53:18,472 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-01-10 15:53:18,472 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 681) no Hoare annotation was computed. [2022-01-10 15:53:18,472 INFO L861 garLoopResultBuilder]: At program point L680(lines 22 682) the Hoare annotation is: true [2022-01-10 15:53:18,472 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 669) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 12)) (.cse1 (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (or (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) (and .cse0 .cse1 .cse2 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) (= 8592 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) (and .cse0 .cse1 .cse2 .cse3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 10) .cse3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) .cse0 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse1) (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9) (and (= 8608 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 8)))) [2022-01-10 15:53:18,472 INFO L861 garLoopResultBuilder]: At program point L692(lines 683 694) the Hoare annotation is: true [2022-01-10 15:53:18,472 INFO L861 garLoopResultBuilder]: At program point L670(lines 109 671) the Hoare annotation is: true [2022-01-10 15:53:18,472 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L675(lines 675 677) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 650) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L675-2(lines 675 677) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 650) the Hoare annotation is: (let ((.cse0 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)))) [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 649) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 649) the Hoare annotation is: (or (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 648) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 647) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 646) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 645) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-01-10 15:53:18,473 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 645) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 644) no Hoare annotation was computed. [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 613) no Hoare annotation was computed. [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 643) no Hoare annotation was computed. [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-01-10 15:53:18,474 INFO L854 garLoopResultBuilder]: At program point L614(lines 110 669) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 12)) (.cse1 (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (or (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) (and .cse0 .cse1 .cse2 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) (= 8592 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) (and .cse0 .cse1 .cse2 .cse3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 10) .cse3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) .cse0 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse1) (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9) (and (= 8608 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 8)))) [2022-01-10 15:53:18,474 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 643) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 642) no Hoare annotation was computed. [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L652(lines 652 666) no Hoare annotation was computed. [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L651(lines 651 667) no Hoare annotation was computed. [2022-01-10 15:53:18,474 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 642) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,474 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 641) no Hoare annotation was computed. [2022-01-10 15:53:18,475 INFO L858 garLoopResultBuilder]: For program point L653(lines 653 658) no Hoare annotation was computed. [2022-01-10 15:53:18,475 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-01-10 15:53:18,475 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 640) no Hoare annotation was computed. [2022-01-10 15:53:18,475 INFO L858 garLoopResultBuilder]: For program point L655(lines 655 657) no Hoare annotation was computed. [2022-01-10 15:53:18,475 INFO L858 garLoopResultBuilder]: For program point L653-2(lines 652 666) no Hoare annotation was computed. [2022-01-10 15:53:18,476 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 613) no Hoare annotation was computed. [2022-01-10 15:53:18,476 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 639) no Hoare annotation was computed. [2022-01-10 15:53:18,476 INFO L858 garLoopResultBuilder]: For program point L660(lines 660 664) no Hoare annotation was computed. [2022-01-10 15:53:18,476 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 639) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,476 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 638) no Hoare annotation was computed. [2022-01-10 15:53:18,476 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-01-10 15:53:18,476 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 637) no Hoare annotation was computed. [2022-01-10 15:53:18,476 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 219 613) no Hoare annotation was computed. [2022-01-10 15:53:18,476 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 637) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,476 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 636) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 325) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 635) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 325) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 635) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 634) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L319-2(lines 317 325) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 633) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L335-2(lines 219 613) no Hoare annotation was computed. [2022-01-10 15:53:18,477 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 633) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,477 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 632) no Hoare annotation was computed. [2022-01-10 15:53:18,478 INFO L854 garLoopResultBuilder]: At program point L365(lines 341 386) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,478 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 385) no Hoare annotation was computed. [2022-01-10 15:53:18,478 INFO L858 garLoopResultBuilder]: For program point L393(lines 393 428) no Hoare annotation was computed. [2022-01-10 15:53:18,478 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 631) no Hoare annotation was computed. [2022-01-10 15:53:18,478 INFO L858 garLoopResultBuilder]: For program point L367(lines 367 369) no Hoare annotation was computed. [2022-01-10 15:53:18,478 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 384) no Hoare annotation was computed. [2022-01-10 15:53:18,478 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 400) no Hoare annotation was computed. [2022-01-10 15:53:18,478 INFO L854 garLoopResultBuilder]: At program point L402(lines 393 428) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,478 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 631) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,478 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 630) no Hoare annotation was computed. [2022-01-10 15:53:18,478 INFO L858 garLoopResultBuilder]: For program point L367-2(lines 364 373) no Hoare annotation was computed. [2022-01-10 15:53:18,478 INFO L858 garLoopResultBuilder]: For program point L348(lines 348 381) no Hoare annotation was computed. [2022-01-10 15:53:18,478 INFO L858 garLoopResultBuilder]: For program point L347-1(lines 347 384) no Hoare annotation was computed. [2022-01-10 15:53:18,478 INFO L858 garLoopResultBuilder]: For program point L405(lines 405 426) no Hoare annotation was computed. [2022-01-10 15:53:18,479 INFO L858 garLoopResultBuilder]: For program point L438(lines 438 440) no Hoare annotation was computed. [2022-01-10 15:53:18,479 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 629) no Hoare annotation was computed. [2022-01-10 15:53:18,479 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 379) no Hoare annotation was computed. [2022-01-10 15:53:18,479 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-01-10 15:53:18,479 INFO L854 garLoopResultBuilder]: At program point L414(lines 405 426) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,479 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 629) the Hoare annotation is: (let ((.cse0 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 12) (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse0) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9) .cse0))) [2022-01-10 15:53:18,479 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 628) no Hoare annotation was computed. [2022-01-10 15:53:18,479 INFO L858 garLoopResultBuilder]: For program point L356(lines 356 360) no Hoare annotation was computed. [2022-01-10 15:53:18,479 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 419) no Hoare annotation was computed. [2022-01-10 15:53:18,479 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 452) no Hoare annotation was computed. [2022-01-10 15:53:18,479 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 446 454) no Hoare annotation was computed. [2022-01-10 15:53:18,479 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 628) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,479 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 627) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L356-2(lines 356 360) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L417-2(lines 413 426) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L460(lines 460 462) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 626) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 375) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L460-2(lines 219 613) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 626) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse0) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 625) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L466(lines 466 478) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L483(lines 483 485) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 624) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L470(lines 470 472) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L483-2(lines 219 613) no Hoare annotation was computed. [2022-01-10 15:53:18,480 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 624) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 8)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0))) [2022-01-10 15:53:18,480 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 623) no Hoare annotation was computed. [2022-01-10 15:53:18,481 INFO L858 garLoopResultBuilder]: For program point L470-2(lines 468 478) no Hoare annotation was computed. [2022-01-10 15:53:18,481 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 497) no Hoare annotation was computed. [2022-01-10 15:53:18,481 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 622) no Hoare annotation was computed. [2022-01-10 15:53:18,481 INFO L858 garLoopResultBuilder]: For program point L495-2(lines 219 613) no Hoare annotation was computed. [2022-01-10 15:53:18,481 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 622) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0))) [2022-01-10 15:53:18,481 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 621) no Hoare annotation was computed. [2022-01-10 15:53:18,481 INFO L858 garLoopResultBuilder]: For program point L507(lines 507 525) no Hoare annotation was computed. [2022-01-10 15:53:18,481 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 620) no Hoare annotation was computed. [2022-01-10 15:53:18,481 INFO L858 garLoopResultBuilder]: For program point L516-2(lines 219 613) no Hoare annotation was computed. [2022-01-10 15:53:18,481 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 524) no Hoare annotation was computed. [2022-01-10 15:53:18,481 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 620) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse1 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0 .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 12) .cse1 (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)))) [2022-01-10 15:53:18,481 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 619) no Hoare annotation was computed. [2022-01-10 15:53:18,481 INFO L858 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 523) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L539(lines 539 542) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 618) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L529-2(lines 529 533) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 522) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L544(lines 544 558) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 618) the Hoare annotation is: (let ((.cse0 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 12) .cse0 (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 5) .cse0) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 9)))) [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 617) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L519(lines 519 521) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L553-2(lines 219 613) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L547(lines 547 557) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L572(lines 572 586) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 616) no Hoare annotation was computed. [2022-01-10 15:53:18,482 INFO L854 garLoopResultBuilder]: At program point L520(lines 83 681) the Hoare annotation is: false [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point L564(lines 564 567) no Hoare annotation was computed. [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point L550(lines 550 556) no Hoare annotation was computed. [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point L581-2(lines 219 613) no Hoare annotation was computed. [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point L575(lines 575 585) no Hoare annotation was computed. [2022-01-10 15:53:18,483 INFO L861 garLoopResultBuilder]: At program point L216(lines 215 616) the Hoare annotation is: true [2022-01-10 15:53:18,483 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 616) the Hoare annotation is: true [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 679) no Hoare annotation was computed. [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point L553(lines 553 555) no Hoare annotation was computed. [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 595) no Hoare annotation was computed. [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point L578(lines 578 584) no Hoare annotation was computed. [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 607) no Hoare annotation was computed. [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point L591-2(lines 591 595) no Hoare annotation was computed. [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point L581(lines 581 583) no Hoare annotation was computed. [2022-01-10 15:53:18,483 INFO L858 garLoopResultBuilder]: For program point L604(lines 604 606) no Hoare annotation was computed. [2022-01-10 15:53:18,484 INFO L858 garLoopResultBuilder]: For program point L601-1(lines 601 607) no Hoare annotation was computed. [2022-01-10 15:53:18,486 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-10 15:53:18,488 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 15:53:18,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:53:18 BasicIcfg [2022-01-10 15:53:18,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 15:53:18,521 INFO L158 Benchmark]: Toolchain (without parser) took 33981.92ms. Allocated memory was 188.7MB in the beginning and 893.4MB in the end (delta: 704.6MB). Free memory was 136.9MB in the beginning and 578.6MB in the end (delta: -441.8MB). Peak memory consumption was 564.9MB. Max. memory is 8.0GB. [2022-01-10 15:53:18,521 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 153.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 15:53:18,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.86ms. Allocated memory is still 188.7MB. Free memory was 136.7MB in the beginning and 158.8MB in the end (delta: -22.1MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-01-10 15:53:18,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.34ms. Allocated memory is still 188.7MB. Free memory was 158.8MB in the beginning and 155.7MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 15:53:18,521 INFO L158 Benchmark]: Boogie Preprocessor took 39.00ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 153.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 15:53:18,522 INFO L158 Benchmark]: RCFGBuilder took 699.48ms. Allocated memory is still 188.7MB. Free memory was 153.6MB in the beginning and 123.8MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-01-10 15:53:18,522 INFO L158 Benchmark]: IcfgTransformer took 175.04ms. Allocated memory is still 188.7MB. Free memory was 123.8MB in the beginning and 108.6MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-10 15:53:18,522 INFO L158 Benchmark]: TraceAbstraction took 32569.92ms. Allocated memory was 188.7MB in the beginning and 893.4MB in the end (delta: 704.6MB). Free memory was 108.0MB in the beginning and 578.6MB in the end (delta: -470.6MB). Peak memory consumption was 536.2MB. Max. memory is 8.0GB. [2022-01-10 15:53:18,523 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.11ms. Allocated memory is still 188.7MB. Free memory is still 153.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 426.86ms. Allocated memory is still 188.7MB. Free memory was 136.7MB in the beginning and 158.8MB in the end (delta: -22.1MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.34ms. Allocated memory is still 188.7MB. Free memory was 158.8MB in the beginning and 155.7MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.00ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 153.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 699.48ms. Allocated memory is still 188.7MB. Free memory was 153.6MB in the beginning and 123.8MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * IcfgTransformer took 175.04ms. Allocated memory is still 188.7MB. Free memory was 123.8MB in the beginning and 108.6MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 32569.92ms. Allocated memory was 188.7MB in the beginning and 893.4MB in the end (delta: 704.6MB). Free memory was 108.0MB in the beginning and 578.6MB in the end (delta: -470.6MB). Peak memory consumption was 536.2MB. 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: 679]: 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, 158 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.5s, OverallIterations: 31, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3506 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3506 mSDsluCounter, 13613 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5455 mSDsCounter, 732 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3194 IncrementalHoareTripleChecker+Invalid, 3926 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 732 mSolverCounterUnsat, 8158 mSDtfsCounter, 3194 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7178 GetRequests, 7122 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13974occurred in iteration=30, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 1762 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 1096 NumberOfFragments, 633 HoareAnnotationTreeSize, 28 FomulaSimplifications, 46714 FormulaSimplificationTreeSizeReduction, 4.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 9825 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 16262 NumberOfCodeBlocks, 16262 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 17117 ConstructedInterpolants, 0 QuantifiedInterpolants, 21596 SizeOfPredicates, 1 NumberOfNonLiveVariables, 22926 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 42 InterpolantComputations, 30 PerfectInterpolantSequences, 104839/105127 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 1 specifications checked. All of them hold - InvariantResult [Line: 683]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((8608bv32 == s__state && blastFlag == 8bv32) || (~bvule32(s__state, 3bv32) && ~bvule32(blastFlag, 10bv32))) || (blastFlag == 7bv32 && 8592bv32 == s__state)) || blastFlag == 6bv32) || (((~bvule32(blastFlag, 12bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && s__hit == 0bv32) && 8448bv32 == s__state)) || blastFlag == 9bv32) || ~bvule32(blastFlag, 5bv32)) || (((~bvule32(blastFlag, 12bv32) && ~bvule32(8656bv32, s__state)) && s__hit == 0bv32) && ~bvule32(s__state, 8672bv32))) || (((~bvule32(blastFlag, 12bv32) && ~bvule32(s__state, 3bv32)) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && s__hit == 0bv32) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((~bvule32(8656bv32, s__state) && ~bvule32(blastFlag, 5bv32)) && ~bvule32(s__state, 8672bv32)) || ((blastFlag == 6bv32 && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(8656bv32, s__state) && blastFlag == 9bv32) && ~bvule32(s__state, 8672bv32))) || (((~bvule32(blastFlag, 12bv32) && ~bvule32(8656bv32, s__state)) && s__hit == 0bv32) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (~bvult64(s__state, 8640bv32) && blastFlag == 8bv32)) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((8608bv32 == s__state && blastFlag == 8bv32) || (~bvule32(s__state, 3bv32) && ~bvule32(blastFlag, 10bv32))) || (blastFlag == 7bv32 && 8592bv32 == s__state)) || blastFlag == 6bv32) || (((~bvule32(blastFlag, 12bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && s__hit == 0bv32) && 8448bv32 == s__state)) || blastFlag == 9bv32) || ~bvule32(blastFlag, 5bv32)) || (((~bvule32(blastFlag, 12bv32) && ~bvule32(8656bv32, s__state)) && s__hit == 0bv32) && ~bvule32(s__state, 8672bv32))) || (((~bvule32(blastFlag, 12bv32) && ~bvule32(s__state, 3bv32)) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && s__hit == 0bv32) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (blastFlag == 6bv32 || blastFlag == 9bv32) || ~bvule32(blastFlag, 5bv32) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((blastFlag == 6bv32 && ~bvule32(8656bv32, s__state)) || (~bvule32(8656bv32, s__state) && blastFlag == 9bv32)) || (~bvule32(8656bv32, s__state) && ~bvule32(blastFlag, 5bv32)) - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((8448bv32 == s__state && ~bvule32(blastFlag, 5bv32)) || (blastFlag == 6bv32 && 8448bv32 == s__state)) || (((~bvule32(blastFlag, 12bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && s__hit == 0bv32) && 8448bv32 == s__state)) || (8448bv32 == s__state && blastFlag == 9bv32) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 7bv32 && ~bvult64(s__state, 8640bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((blastFlag == 6bv32 && ~bvule32(8656bv32, s__state)) || (~bvule32(8656bv32, s__state) && blastFlag == 9bv32)) || (~bvule32(8656bv32, s__state) && ~bvule32(blastFlag, 5bv32))) || ((~bvule32(blastFlag, 12bv32) && ~bvule32(8656bv32, s__state)) && s__hit == 0bv32) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((blastFlag == 9bv32 && ~bvule32(s__state, 8656bv32)) || (~bvule32(blastFlag, 5bv32) && ~bvule32(s__state, 8656bv32))) || (blastFlag == 6bv32 && ~bvule32(s__state, 8656bv32)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((~bvult64(s__state, 8640bv32) && blastFlag == 9bv32) || (~bvult64(s__state, 8640bv32) && ~bvule32(blastFlag, 5bv32))) || (blastFlag == 6bv32 && ~bvult64(s__state, 8640bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 15:53:18,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...