/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:42:03,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:42:03,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:42:03,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:42:03,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:42:03,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:42:03,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:42:03,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:42:03,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:42:03,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:42:03,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:42:03,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:42:03,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:42:03,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:42:03,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:42:03,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:42:03,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:42:03,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:42:03,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:42:03,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:42:03,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:42:03,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:42:03,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:42:03,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:42:03,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:42:03,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:42:03,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:42:03,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:42:03,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:42:03,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:42:03,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:42:03,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:42:03,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:42:03,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:42:03,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:42:03,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:42:03,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:42:03,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:42:03,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:42:03,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:42:03,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:42:03,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 21:42:03,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:42:03,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:42:03,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:42:03,920 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:42:03,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:42:03,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:42:03,921 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:42:03,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:42:03,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:42:03,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:42:03,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:42:03,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:42:03,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:42:03,923 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:42:03,923 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:42:03,923 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:42:03,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:42:03,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:42:03,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:42:03,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:42:03,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:42:03,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:42:03,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:42:03,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:42:03,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:42:03,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:42:03,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:42:03,925 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:42:03,925 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:42:03,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:42:03,925 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:42:03,925 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:42:03,926 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:42:03,926 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 21:42:04,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:42:04,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:42:04,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:42:04,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:42:04,141 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:42:04,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c [2022-01-10 21:42:04,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e47687f/36ebe3b2f4544bf5b0a4dc307896ce5c/FLAG4ca855195 [2022-01-10 21:42:04,551 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:42:04,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c [2022-01-10 21:42:04,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e47687f/36ebe3b2f4544bf5b0a4dc307896ce5c/FLAG4ca855195 [2022-01-10 21:42:04,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e47687f/36ebe3b2f4544bf5b0a4dc307896ce5c [2022-01-10 21:42:04,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:42:04,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:42:04,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:42:04,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:42:04,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:42:04,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7e4bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04, skipping insertion in model container [2022-01-10 21:42:04,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:42:04,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:42:04,758 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_clnt_2.cil-2.c[35827,35840] [2022-01-10 21:42:04,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:42:04,774 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:42:04,805 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_clnt_2.cil-2.c[35827,35840] [2022-01-10 21:42:04,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:42:04,820 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:42:04,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04 WrapperNode [2022-01-10 21:42:04,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:42:04,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:42:04,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:42:04,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:42:04,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,857 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 461 [2022-01-10 21:42:04,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:42:04,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:42:04,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:42:04,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:42:04,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:42:04,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:42:04,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:42:04,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:42:04,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04" (1/1) ... [2022-01-10 21:42:04,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:42:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:04,938 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 21:42:04,955 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 21:42:04,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:42:04,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:42:04,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:42:04,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:42:05,091 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:42:05,092 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:42:05,105 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:42:05,412 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-01-10 21:42:05,412 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-01-10 21:42:05,412 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:42:05,417 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:42:05,417 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 21:42:05,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:05 BoogieIcfgContainer [2022-01-10 21:42:05,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:42:05,423 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:42:05,423 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:42:05,424 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:42:05,426 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:05" (1/1) ... [2022-01-10 21:42:05,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:42:05 BasicIcfg [2022-01-10 21:42:05,531 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:42:05,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:42:05,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:42:05,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:42:05,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:42:04" (1/4) ... [2022-01-10 21:42:05,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4f192c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:42:05, skipping insertion in model container [2022-01-10 21:42:05,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:04" (2/4) ... [2022-01-10 21:42:05,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4f192c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:42:05, skipping insertion in model container [2022-01-10 21:42:05,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:05" (3/4) ... [2022-01-10 21:42:05,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4f192c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:42:05, skipping insertion in model container [2022-01-10 21:42:05,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:42:05" (4/4) ... [2022-01-10 21:42:05,536 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.cTransformedIcfg [2022-01-10 21:42:05,539 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:42:05,539 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 21:42:05,565 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:42:05,569 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 21:42:05,570 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 21:42:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 21:42:05,583 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:05,583 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] [2022-01-10 21:42:05,583 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:05,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1825913536, now seen corresponding path program 1 times [2022-01-10 21:42:05,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:05,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951405233] [2022-01-10 21:42:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:05,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:05,777 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 21:42:05,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:05,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951405233] [2022-01-10 21:42:05,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951405233] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:05,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:05,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:05,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194411119] [2022-01-10 21:42:05,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:05,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:05,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:05,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:05,815 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 21:42:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:05,919 INFO L93 Difference]: Finished difference Result 365 states and 618 transitions. [2022-01-10 21:42:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:05,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-10 21:42:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:05,931 INFO L225 Difference]: With dead ends: 365 [2022-01-10 21:42:05,931 INFO L226 Difference]: Without dead ends: 212 [2022-01-10 21:42:05,934 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 21:42:05,937 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 178 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:05,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 399 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-01-10 21:42:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-01-10 21:42:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.4976303317535544) internal successors, (316), 211 states have internal predecessors, (316), 0 states have call successors, (0), 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 21:42:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 316 transitions. [2022-01-10 21:42:05,974 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 316 transitions. Word has length 24 [2022-01-10 21:42:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:05,974 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 316 transitions. [2022-01-10 21:42:05,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 21:42:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 316 transitions. [2022-01-10 21:42:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 21:42:05,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:05,976 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 21:42:05,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:42:05,976 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:05,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1745099481, now seen corresponding path program 1 times [2022-01-10 21:42:05,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:05,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108745016] [2022-01-10 21:42:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:05,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:06,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:06,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108745016] [2022-01-10 21:42:06,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108745016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:06,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:06,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:06,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435554590] [2022-01-10 21:42:06,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:06,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:06,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:06,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:06,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:06,033 INFO L87 Difference]: Start difference. First operand 212 states and 316 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:06,154 INFO L93 Difference]: Finished difference Result 342 states and 515 transitions. [2022-01-10 21:42:06,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:06,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-10 21:42:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:06,156 INFO L225 Difference]: With dead ends: 342 [2022-01-10 21:42:06,156 INFO L226 Difference]: Without dead ends: 237 [2022-01-10 21:42:06,157 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 21:42:06,157 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 14 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:06,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 260 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:06,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-01-10 21:42:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 229. [2022-01-10 21:42:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4824561403508771) internal successors, (338), 228 states have internal predecessors, (338), 0 states have call successors, (0), 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 21:42:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 338 transitions. [2022-01-10 21:42:06,169 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 338 transitions. Word has length 38 [2022-01-10 21:42:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:06,169 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 338 transitions. [2022-01-10 21:42:06,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2022-01-10 21:42:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 21:42:06,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:06,171 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-01-10 21:42:06,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:42:06,171 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:06,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash -972364791, now seen corresponding path program 1 times [2022-01-10 21:42:06,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:06,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966081381] [2022-01-10 21:42:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:06,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 21:42:06,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:06,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966081381] [2022-01-10 21:42:06,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966081381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:06,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:06,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:06,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131799190] [2022-01-10 21:42:06,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:06,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:06,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:06,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:06,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:06,218 INFO L87 Difference]: Start difference. First operand 229 states and 338 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:06,305 INFO L93 Difference]: Finished difference Result 501 states and 748 transitions. [2022-01-10 21:42:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:06,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-10 21:42:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:06,307 INFO L225 Difference]: With dead ends: 501 [2022-01-10 21:42:06,307 INFO L226 Difference]: Without dead ends: 279 [2022-01-10 21:42:06,308 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 21:42:06,308 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 15 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:06,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 262 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-01-10 21:42:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 269. [2022-01-10 21:42:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.4477611940298507) internal successors, (388), 268 states have internal predecessors, (388), 0 states have call successors, (0), 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 21:42:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 388 transitions. [2022-01-10 21:42:06,317 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 388 transitions. Word has length 55 [2022-01-10 21:42:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:06,317 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 388 transitions. [2022-01-10 21:42:06,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 388 transitions. [2022-01-10 21:42:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 21:42:06,319 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:06,319 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-01-10 21:42:06,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:42:06,319 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:06,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:06,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2077838024, now seen corresponding path program 1 times [2022-01-10 21:42:06,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:06,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393220028] [2022-01-10 21:42:06,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:06,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 21:42:06,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:06,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393220028] [2022-01-10 21:42:06,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393220028] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:06,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:06,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:06,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789280005] [2022-01-10 21:42:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:06,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:06,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:06,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:06,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:06,397 INFO L87 Difference]: Start difference. First operand 269 states and 388 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:06,549 INFO L93 Difference]: Finished difference Result 631 states and 941 transitions. [2022-01-10 21:42:06,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:06,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-10 21:42:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:06,551 INFO L225 Difference]: With dead ends: 631 [2022-01-10 21:42:06,551 INFO L226 Difference]: Without dead ends: 367 [2022-01-10 21:42:06,553 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 21:42:06,560 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 53 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:06,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 225 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-01-10 21:42:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 349. [2022-01-10 21:42:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.396551724137931) internal successors, (486), 348 states have internal predecessors, (486), 0 states have call successors, (0), 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 21:42:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 486 transitions. [2022-01-10 21:42:06,571 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 486 transitions. Word has length 55 [2022-01-10 21:42:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:06,571 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 486 transitions. [2022-01-10 21:42:06,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 486 transitions. [2022-01-10 21:42:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 21:42:06,573 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:06,573 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2022-01-10 21:42:06,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:42:06,573 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:06,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1974948956, now seen corresponding path program 1 times [2022-01-10 21:42:06,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:06,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722765472] [2022-01-10 21:42:06,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:06,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 21:42:06,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:06,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722765472] [2022-01-10 21:42:06,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722765472] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:06,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:06,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:06,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410056871] [2022-01-10 21:42:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:06,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:06,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:06,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:06,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:06,680 INFO L87 Difference]: Start difference. First operand 349 states and 486 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 21:42:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:06,804 INFO L93 Difference]: Finished difference Result 830 states and 1182 transitions. [2022-01-10 21:42:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:06,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 21:42:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:06,806 INFO L225 Difference]: With dead ends: 830 [2022-01-10 21:42:06,806 INFO L226 Difference]: Without dead ends: 486 [2022-01-10 21:42:06,806 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 21:42:06,807 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 127 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:06,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 173 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-01-10 21:42:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 460. [2022-01-10 21:42:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.4313725490196079) internal successors, (657), 459 states have internal predecessors, (657), 0 states have call successors, (0), 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 21:42:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 657 transitions. [2022-01-10 21:42:06,816 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 657 transitions. Word has length 81 [2022-01-10 21:42:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:06,818 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 657 transitions. [2022-01-10 21:42:06,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 21:42:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 657 transitions. [2022-01-10 21:42:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 21:42:06,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:06,826 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2022-01-10 21:42:06,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:42:06,826 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:06,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash 472061711, now seen corresponding path program 1 times [2022-01-10 21:42:06,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:06,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268690617] [2022-01-10 21:42:06,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:06,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-10 21:42:06,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:06,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268690617] [2022-01-10 21:42:06,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268690617] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:06,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:06,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:06,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000227701] [2022-01-10 21:42:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:06,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:06,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:06,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:06,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:06,887 INFO L87 Difference]: Start difference. First operand 460 states and 657 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:42:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:06,985 INFO L93 Difference]: Finished difference Result 928 states and 1343 transitions. [2022-01-10 21:42:06,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:06,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 85 [2022-01-10 21:42:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:06,987 INFO L225 Difference]: With dead ends: 928 [2022-01-10 21:42:06,987 INFO L226 Difference]: Without dead ends: 508 [2022-01-10 21:42:06,988 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 21:42:06,989 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:06,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 262 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-01-10 21:42:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 502. [2022-01-10 21:42:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 1.4151696606786428) internal successors, (709), 501 states have internal predecessors, (709), 0 states have call successors, (0), 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 21:42:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 709 transitions. [2022-01-10 21:42:06,998 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 709 transitions. Word has length 85 [2022-01-10 21:42:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:06,998 INFO L470 AbstractCegarLoop]: Abstraction has 502 states and 709 transitions. [2022-01-10 21:42:06,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:42:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 709 transitions. [2022-01-10 21:42:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 21:42:07,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:07,001 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2022-01-10 21:42:07,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:42:07,001 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:07,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1321452596, now seen corresponding path program 1 times [2022-01-10 21:42:07,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:07,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285127386] [2022-01-10 21:42:07,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:07,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 21:42:07,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:07,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285127386] [2022-01-10 21:42:07,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285127386] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:07,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:07,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:07,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959922659] [2022-01-10 21:42:07,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:07,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:07,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:07,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:07,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:07,062 INFO L87 Difference]: Start difference. First operand 502 states and 709 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 21:42:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:07,084 INFO L93 Difference]: Finished difference Result 984 states and 1402 transitions. [2022-01-10 21:42:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:07,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 105 [2022-01-10 21:42:07,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:07,087 INFO L225 Difference]: With dead ends: 984 [2022-01-10 21:42:07,087 INFO L226 Difference]: Without dead ends: 742 [2022-01-10 21:42:07,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:07,088 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 136 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:07,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 307 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-01-10 21:42:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2022-01-10 21:42:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.4197031039136303) internal successors, (1052), 741 states have internal predecessors, (1052), 0 states have call successors, (0), 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 21:42:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1052 transitions. [2022-01-10 21:42:07,099 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1052 transitions. Word has length 105 [2022-01-10 21:42:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:07,099 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1052 transitions. [2022-01-10 21:42:07,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 21:42:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1052 transitions. [2022-01-10 21:42:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 21:42:07,102 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:07,103 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2022-01-10 21:42:07,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:42:07,103 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash 557606813, now seen corresponding path program 1 times [2022-01-10 21:42:07,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:07,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846156962] [2022-01-10 21:42:07,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:07,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-10 21:42:07,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:07,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846156962] [2022-01-10 21:42:07,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846156962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:07,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:07,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:07,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861702415] [2022-01-10 21:42:07,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:07,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:07,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:07,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:07,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:07,152 INFO L87 Difference]: Start difference. First operand 742 states and 1052 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 21:42:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:07,174 INFO L93 Difference]: Finished difference Result 984 states and 1399 transitions. [2022-01-10 21:42:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:07,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 107 [2022-01-10 21:42:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:07,177 INFO L225 Difference]: With dead ends: 984 [2022-01-10 21:42:07,177 INFO L226 Difference]: Without dead ends: 982 [2022-01-10 21:42:07,178 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 21:42:07,178 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 139 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:07,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 305 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-01-10 21:42:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2022-01-10 21:42:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.4240570846075433) internal successors, (1397), 981 states have internal predecessors, (1397), 0 states have call successors, (0), 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 21:42:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1397 transitions. [2022-01-10 21:42:07,196 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1397 transitions. Word has length 107 [2022-01-10 21:42:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:07,196 INFO L470 AbstractCegarLoop]: Abstraction has 982 states and 1397 transitions. [2022-01-10 21:42:07,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 21:42:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1397 transitions. [2022-01-10 21:42:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-10 21:42:07,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:07,198 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2022-01-10 21:42:07,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:42:07,198 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:07,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1925808626, now seen corresponding path program 1 times [2022-01-10 21:42:07,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:07,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064553833] [2022-01-10 21:42:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:07,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-01-10 21:42:07,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:07,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064553833] [2022-01-10 21:42:07,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064553833] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:07,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:07,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:07,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673380830] [2022-01-10 21:42:07,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:07,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:07,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:07,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:07,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:07,259 INFO L87 Difference]: Start difference. First operand 982 states and 1397 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 21:42:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:07,383 INFO L93 Difference]: Finished difference Result 2128 states and 3086 transitions. [2022-01-10 21:42:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:07,384 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 176 [2022-01-10 21:42:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:07,387 INFO L225 Difference]: With dead ends: 2128 [2022-01-10 21:42:07,387 INFO L226 Difference]: Without dead ends: 1178 [2022-01-10 21:42:07,388 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 21:42:07,388 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 81 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:07,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 207 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2022-01-10 21:42:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1138. [2022-01-10 21:42:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1137 states have (on average 1.4397537379067722) internal successors, (1637), 1137 states have internal predecessors, (1637), 0 states have call successors, (0), 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 21:42:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1637 transitions. [2022-01-10 21:42:07,403 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1637 transitions. Word has length 176 [2022-01-10 21:42:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:07,403 INFO L470 AbstractCegarLoop]: Abstraction has 1138 states and 1637 transitions. [2022-01-10 21:42:07,404 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 21:42:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1637 transitions. [2022-01-10 21:42:07,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-01-10 21:42:07,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:07,406 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:07,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:42:07,406 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:07,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:07,406 INFO L85 PathProgramCache]: Analyzing trace with hash -161072205, now seen corresponding path program 1 times [2022-01-10 21:42:07,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:07,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075101526] [2022-01-10 21:42:07,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:07,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-01-10 21:42:07,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:07,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075101526] [2022-01-10 21:42:07,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075101526] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:07,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:07,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:07,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129821276] [2022-01-10 21:42:07,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:07,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:07,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:07,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:07,449 INFO L87 Difference]: Start difference. First operand 1138 states and 1637 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 21:42:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:07,542 INFO L93 Difference]: Finished difference Result 2342 states and 3356 transitions. [2022-01-10 21:42:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:07,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 212 [2022-01-10 21:42:07,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:07,545 INFO L225 Difference]: With dead ends: 2342 [2022-01-10 21:42:07,545 INFO L226 Difference]: Without dead ends: 1244 [2022-01-10 21:42:07,546 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 21:42:07,547 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 13 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:07,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 261 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2022-01-10 21:42:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1230. [2022-01-10 21:42:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1229 states have (on average 1.4231082180634662) internal successors, (1749), 1229 states have internal predecessors, (1749), 0 states have call successors, (0), 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 21:42:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1749 transitions. [2022-01-10 21:42:07,563 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1749 transitions. Word has length 212 [2022-01-10 21:42:07,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:07,563 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 1749 transitions. [2022-01-10 21:42:07,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 21:42:07,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1749 transitions. [2022-01-10 21:42:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-01-10 21:42:07,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:07,566 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:07,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:42:07,566 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:07,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1558616168, now seen corresponding path program 1 times [2022-01-10 21:42:07,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:07,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224172532] [2022-01-10 21:42:07,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:07,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-01-10 21:42:07,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:07,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224172532] [2022-01-10 21:42:07,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224172532] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:07,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:07,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:07,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315808671] [2022-01-10 21:42:07,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:07,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:07,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:07,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:07,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:07,635 INFO L87 Difference]: Start difference. First operand 1230 states and 1749 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 21:42:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:07,727 INFO L93 Difference]: Finished difference Result 2532 states and 3598 transitions. [2022-01-10 21:42:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:07,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 233 [2022-01-10 21:42:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:07,731 INFO L225 Difference]: With dead ends: 2532 [2022-01-10 21:42:07,731 INFO L226 Difference]: Without dead ends: 1342 [2022-01-10 21:42:07,734 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 21:42:07,735 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:07,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 262 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2022-01-10 21:42:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1330. [2022-01-10 21:42:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1329 states have (on average 1.4063205417607223) internal successors, (1869), 1329 states have internal predecessors, (1869), 0 states have call successors, (0), 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 21:42:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1869 transitions. [2022-01-10 21:42:07,767 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1869 transitions. Word has length 233 [2022-01-10 21:42:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:07,768 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 1869 transitions. [2022-01-10 21:42:07,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 21:42:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1869 transitions. [2022-01-10 21:42:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-10 21:42:07,770 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:07,770 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:07,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 21:42:07,771 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:07,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2091135198, now seen corresponding path program 1 times [2022-01-10 21:42:07,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:07,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111032820] [2022-01-10 21:42:07,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:07,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-01-10 21:42:07,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:07,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111032820] [2022-01-10 21:42:07,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111032820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:07,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:07,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:07,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571922467] [2022-01-10 21:42:07,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:07,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:07,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:07,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:07,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:07,838 INFO L87 Difference]: Start difference. First operand 1330 states and 1869 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 21:42:07,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:07,935 INFO L93 Difference]: Finished difference Result 2740 states and 3850 transitions. [2022-01-10 21:42:07,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:07,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 257 [2022-01-10 21:42:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:07,939 INFO L225 Difference]: With dead ends: 2740 [2022-01-10 21:42:07,939 INFO L226 Difference]: Without dead ends: 1450 [2022-01-10 21:42:07,941 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 21:42:07,941 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:07,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 262 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2022-01-10 21:42:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1442. [2022-01-10 21:42:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1441 states have (on average 1.3886190145732131) internal successors, (2001), 1441 states have internal predecessors, (2001), 0 states have call successors, (0), 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 21:42:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2001 transitions. [2022-01-10 21:42:07,963 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2001 transitions. Word has length 257 [2022-01-10 21:42:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:07,963 INFO L470 AbstractCegarLoop]: Abstraction has 1442 states and 2001 transitions. [2022-01-10 21:42:07,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 21:42:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2001 transitions. [2022-01-10 21:42:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-10 21:42:07,966 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:07,967 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:07,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:42:07,967 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:07,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1798749373, now seen corresponding path program 1 times [2022-01-10 21:42:07,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:07,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154836614] [2022-01-10 21:42:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:07,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-01-10 21:42:08,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:08,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154836614] [2022-01-10 21:42:08,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154836614] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:08,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:08,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:08,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208196950] [2022-01-10 21:42:08,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:08,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:08,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:08,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:08,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:08,026 INFO L87 Difference]: Start difference. First operand 1442 states and 2001 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 21:42:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:08,133 INFO L93 Difference]: Finished difference Result 2980 states and 4150 transitions. [2022-01-10 21:42:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:08,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 257 [2022-01-10 21:42:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:08,137 INFO L225 Difference]: With dead ends: 2980 [2022-01-10 21:42:08,137 INFO L226 Difference]: Without dead ends: 1578 [2022-01-10 21:42:08,138 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 21:42:08,139 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:08,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 263 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-01-10 21:42:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1566. [2022-01-10 21:42:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.3706070287539935) internal successors, (2145), 1565 states have internal predecessors, (2145), 0 states have call successors, (0), 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 21:42:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2145 transitions. [2022-01-10 21:42:08,163 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2145 transitions. Word has length 257 [2022-01-10 21:42:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:08,164 INFO L470 AbstractCegarLoop]: Abstraction has 1566 states and 2145 transitions. [2022-01-10 21:42:08,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 21:42:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2145 transitions. [2022-01-10 21:42:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-01-10 21:42:08,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:08,167 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:08,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:42:08,167 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:08,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:08,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1591226702, now seen corresponding path program 1 times [2022-01-10 21:42:08,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:08,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831947117] [2022-01-10 21:42:08,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:08,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 695 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2022-01-10 21:42:08,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:08,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831947117] [2022-01-10 21:42:08,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831947117] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:08,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:08,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:08,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528641367] [2022-01-10 21:42:08,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:08,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:08,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:08,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:08,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:08,253 INFO L87 Difference]: Start difference. First operand 1566 states and 2145 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 21:42:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:08,287 INFO L93 Difference]: Finished difference Result 4502 states and 6203 transitions. [2022-01-10 21:42:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:08,287 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 287 [2022-01-10 21:42:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:08,294 INFO L225 Difference]: With dead ends: 4502 [2022-01-10 21:42:08,294 INFO L226 Difference]: Without dead ends: 2976 [2022-01-10 21:42:08,296 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 21:42:08,296 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:08,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 484 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2022-01-10 21:42:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2974. [2022-01-10 21:42:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2974 states, 2973 states have (on average 1.3780692902791793) internal successors, (4097), 2973 states have internal predecessors, (4097), 0 states have call successors, (0), 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 21:42:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4097 transitions. [2022-01-10 21:42:08,346 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4097 transitions. Word has length 287 [2022-01-10 21:42:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:08,346 INFO L470 AbstractCegarLoop]: Abstraction has 2974 states and 4097 transitions. [2022-01-10 21:42:08,346 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 21:42:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4097 transitions. [2022-01-10 21:42:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-01-10 21:42:08,350 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:08,350 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:08,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 21:42:08,351 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:08,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1298840877, now seen corresponding path program 1 times [2022-01-10 21:42:08,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:08,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504935634] [2022-01-10 21:42:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:08,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 672 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2022-01-10 21:42:08,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:08,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504935634] [2022-01-10 21:42:08,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504935634] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:08,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:08,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:08,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148736241] [2022-01-10 21:42:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:08,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:08,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:08,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:08,417 INFO L87 Difference]: Start difference. First operand 2974 states and 4097 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 21:42:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:08,543 INFO L93 Difference]: Finished difference Result 6208 states and 8590 transitions. [2022-01-10 21:42:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:08,544 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 287 [2022-01-10 21:42:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:08,551 INFO L225 Difference]: With dead ends: 6208 [2022-01-10 21:42:08,551 INFO L226 Difference]: Without dead ends: 3274 [2022-01-10 21:42:08,555 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 21:42:08,557 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:08,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 263 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2022-01-10 21:42:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 3258. [2022-01-10 21:42:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3258 states, 3257 states have (on average 1.3573840957936751) internal successors, (4421), 3257 states have internal predecessors, (4421), 0 states have call successors, (0), 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 21:42:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 4421 transitions. [2022-01-10 21:42:08,635 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 4421 transitions. Word has length 287 [2022-01-10 21:42:08,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:08,635 INFO L470 AbstractCegarLoop]: Abstraction has 3258 states and 4421 transitions. [2022-01-10 21:42:08,636 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 21:42:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 4421 transitions. [2022-01-10 21:42:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-01-10 21:42:08,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:08,642 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:08,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 21:42:08,642 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash -756813131, now seen corresponding path program 1 times [2022-01-10 21:42:08,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:08,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832794587] [2022-01-10 21:42:08,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:08,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2022-01-10 21:42:08,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:08,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832794587] [2022-01-10 21:42:08,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832794587] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:08,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:08,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:08,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504517708] [2022-01-10 21:42:08,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:08,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:08,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:08,697 INFO L87 Difference]: Start difference. First operand 3258 states and 4421 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 21:42:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:08,826 INFO L93 Difference]: Finished difference Result 6624 states and 9006 transitions. [2022-01-10 21:42:08,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:08,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 311 [2022-01-10 21:42:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:08,834 INFO L225 Difference]: With dead ends: 6624 [2022-01-10 21:42:08,834 INFO L226 Difference]: Without dead ends: 3406 [2022-01-10 21:42:08,837 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 21:42:08,837 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:08,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 262 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2022-01-10 21:42:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3390. [2022-01-10 21:42:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3390 states, 3389 states have (on average 1.3493655945706697) internal successors, (4573), 3389 states have internal predecessors, (4573), 0 states have call successors, (0), 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 21:42:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 4573 transitions. [2022-01-10 21:42:08,889 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 4573 transitions. Word has length 311 [2022-01-10 21:42:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:08,889 INFO L470 AbstractCegarLoop]: Abstraction has 3390 states and 4573 transitions. [2022-01-10 21:42:08,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 21:42:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 4573 transitions. [2022-01-10 21:42:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-01-10 21:42:08,894 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:08,894 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:08,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 21:42:08,895 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:08,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:08,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1356870726, now seen corresponding path program 1 times [2022-01-10 21:42:08,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:08,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199713916] [2022-01-10 21:42:08,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:08,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-10 21:42:08,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:08,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199713916] [2022-01-10 21:42:08,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199713916] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:08,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:08,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:08,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699113544] [2022-01-10 21:42:08,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:08,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:08,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:08,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:08,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:08,952 INFO L87 Difference]: Start difference. First operand 3390 states and 4573 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 21:42:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:09,089 INFO L93 Difference]: Finished difference Result 7140 states and 9770 transitions. [2022-01-10 21:42:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:09,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 322 [2022-01-10 21:42:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:09,098 INFO L225 Difference]: With dead ends: 7140 [2022-01-10 21:42:09,098 INFO L226 Difference]: Without dead ends: 3790 [2022-01-10 21:42:09,101 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 21:42:09,101 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 52 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:09,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 255 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states. [2022-01-10 21:42:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3790 to 3702. [2022-01-10 21:42:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 3701 states have (on average 1.335044582545258) internal successors, (4941), 3701 states have internal predecessors, (4941), 0 states have call successors, (0), 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 21:42:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 4941 transitions. [2022-01-10 21:42:09,155 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 4941 transitions. Word has length 322 [2022-01-10 21:42:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:09,155 INFO L470 AbstractCegarLoop]: Abstraction has 3702 states and 4941 transitions. [2022-01-10 21:42:09,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 21:42:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 4941 transitions. [2022-01-10 21:42:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2022-01-10 21:42:09,161 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:09,161 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-01-10 21:42:09,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 21:42:09,161 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:09,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash 158128985, now seen corresponding path program 1 times [2022-01-10 21:42:09,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:09,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683496912] [2022-01-10 21:42:09,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:09,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 21:42:09,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:09,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683496912] [2022-01-10 21:42:09,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683496912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:09,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:09,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:09,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056639550] [2022-01-10 21:42:09,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:09,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:09,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:09,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:09,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:09,250 INFO L87 Difference]: Start difference. First operand 3702 states and 4941 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 21:42:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:09,369 INFO L93 Difference]: Finished difference Result 7772 states and 10314 transitions. [2022-01-10 21:42:09,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:09,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 336 [2022-01-10 21:42:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:09,394 INFO L225 Difference]: With dead ends: 7772 [2022-01-10 21:42:09,394 INFO L226 Difference]: Without dead ends: 4110 [2022-01-10 21:42:09,398 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 21:42:09,398 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 136 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:09,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 140 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2022-01-10 21:42:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 3822. [2022-01-10 21:42:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3822 states, 3821 states have (on average 1.3308034545930385) internal successors, (5085), 3821 states have internal predecessors, (5085), 0 states have call successors, (0), 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 21:42:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3822 states to 3822 states and 5085 transitions. [2022-01-10 21:42:09,496 INFO L78 Accepts]: Start accepts. Automaton has 3822 states and 5085 transitions. Word has length 336 [2022-01-10 21:42:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:09,497 INFO L470 AbstractCegarLoop]: Abstraction has 3822 states and 5085 transitions. [2022-01-10 21:42:09,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 21:42:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3822 states and 5085 transitions. [2022-01-10 21:42:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-01-10 21:42:09,503 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:09,503 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:09,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 21:42:09,503 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:09,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:09,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2127262802, now seen corresponding path program 1 times [2022-01-10 21:42:09,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:09,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299248426] [2022-01-10 21:42:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:09,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2022-01-10 21:42:09,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:09,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299248426] [2022-01-10 21:42:09,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299248426] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:09,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:09,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:09,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778564665] [2022-01-10 21:42:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:09,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:09,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:09,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:09,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:09,568 INFO L87 Difference]: Start difference. First operand 3822 states and 5085 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 21:42:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:09,630 INFO L93 Difference]: Finished difference Result 10882 states and 14567 transitions. [2022-01-10 21:42:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:09,630 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 337 [2022-01-10 21:42:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:09,639 INFO L225 Difference]: With dead ends: 10882 [2022-01-10 21:42:09,639 INFO L226 Difference]: Without dead ends: 7100 [2022-01-10 21:42:09,643 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 21:42:09,644 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 84 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 470 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 21:42:09,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 470 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7100 states. [2022-01-10 21:42:09,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7100 to 7098. [2022-01-10 21:42:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7098 states, 7097 states have (on average 1.3392982950542482) internal successors, (9505), 7097 states have internal predecessors, (9505), 0 states have call successors, (0), 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 21:42:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7098 states to 7098 states and 9505 transitions. [2022-01-10 21:42:09,766 INFO L78 Accepts]: Start accepts. Automaton has 7098 states and 9505 transitions. Word has length 337 [2022-01-10 21:42:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:09,766 INFO L470 AbstractCegarLoop]: Abstraction has 7098 states and 9505 transitions. [2022-01-10 21:42:09,766 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 21:42:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 7098 states and 9505 transitions. [2022-01-10 21:42:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-01-10 21:42:09,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:09,775 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:09,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 21:42:09,775 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:09,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1925606018, now seen corresponding path program 1 times [2022-01-10 21:42:09,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:09,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249403589] [2022-01-10 21:42:09,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:09,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 845 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2022-01-10 21:42:09,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:09,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249403589] [2022-01-10 21:42:09,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249403589] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:09,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:09,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:09,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001291833] [2022-01-10 21:42:09,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:09,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:09,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:09,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:09,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:09,848 INFO L87 Difference]: Start difference. First operand 7098 states and 9505 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 21:42:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:10,012 INFO L93 Difference]: Finished difference Result 14164 states and 18954 transitions. [2022-01-10 21:42:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:10,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 338 [2022-01-10 21:42:10,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:10,023 INFO L225 Difference]: With dead ends: 14164 [2022-01-10 21:42:10,023 INFO L226 Difference]: Without dead ends: 7106 [2022-01-10 21:42:10,030 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 21:42:10,031 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:10,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 258 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states. [2022-01-10 21:42:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 7074. [2022-01-10 21:42:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7074 states, 7073 states have (on average 1.3042556199632405) internal successors, (9225), 7073 states have internal predecessors, (9225), 0 states have call successors, (0), 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 21:42:10,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7074 states to 7074 states and 9225 transitions. [2022-01-10 21:42:10,122 INFO L78 Accepts]: Start accepts. Automaton has 7074 states and 9225 transitions. Word has length 338 [2022-01-10 21:42:10,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:10,123 INFO L470 AbstractCegarLoop]: Abstraction has 7074 states and 9225 transitions. [2022-01-10 21:42:10,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 21:42:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 7074 states and 9225 transitions. [2022-01-10 21:42:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2022-01-10 21:42:10,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:10,130 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:10,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 21:42:10,130 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:10,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1378969913, now seen corresponding path program 1 times [2022-01-10 21:42:10,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:10,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727806445] [2022-01-10 21:42:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:10,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-10 21:42:10,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:10,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727806445] [2022-01-10 21:42:10,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727806445] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:10,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547685092] [2022-01-10 21:42:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:10,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:10,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:10,226 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 21:42:10,227 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 21:42:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:10,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:10,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-10 21:42:10,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:42:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-10 21:42:11,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547685092] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 21:42:11,264 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 21:42:11,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 21:42:11,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20676763] [2022-01-10 21:42:11,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 21:42:11,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:42:11,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:11,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:42:11,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:42:11,269 INFO L87 Difference]: Start difference. First operand 7074 states and 9225 transitions. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 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 21:42:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:11,638 INFO L93 Difference]: Finished difference Result 14122 states and 18421 transitions. [2022-01-10 21:42:11,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:42:11,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 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 361 [2022-01-10 21:42:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:11,653 INFO L225 Difference]: With dead ends: 14122 [2022-01-10 21:42:11,653 INFO L226 Difference]: Without dead ends: 10684 [2022-01-10 21:42:11,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:42:11,659 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 417 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:11,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 675 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 21:42:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10684 states. [2022-01-10 21:42:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10684 to 8178. [2022-01-10 21:42:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8178 states, 8177 states have (on average 1.311116546410664) internal successors, (10721), 8177 states have internal predecessors, (10721), 0 states have call successors, (0), 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 21:42:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 10721 transitions. [2022-01-10 21:42:11,790 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 10721 transitions. Word has length 361 [2022-01-10 21:42:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:11,791 INFO L470 AbstractCegarLoop]: Abstraction has 8178 states and 10721 transitions. [2022-01-10 21:42:11,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 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 21:42:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 10721 transitions. [2022-01-10 21:42:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-01-10 21:42:11,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:11,799 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:11,831 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 21:42:12,016 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,SelfDestructingSolverStorable20 [2022-01-10 21:42:12,016 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:12,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:12,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1875923887, now seen corresponding path program 2 times [2022-01-10 21:42:12,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:12,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610127728] [2022-01-10 21:42:12,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:12,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 21:42:12,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:12,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610127728] [2022-01-10 21:42:12,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610127728] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:12,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409974261] [2022-01-10 21:42:12,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 21:42:12,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:12,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:12,100 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 21:42:12,102 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 21:42:12,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 21:42:12,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 21:42:12,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 1548 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:12,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 21:42:12,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:42:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 21:42:13,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409974261] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 21:42:13,208 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 21:42:13,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 21:42:13,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736048740] [2022-01-10 21:42:13,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 21:42:13,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:42:13,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:13,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:42:13,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:42:13,210 INFO L87 Difference]: Start difference. First operand 8178 states and 10721 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 21:42:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:13,464 INFO L93 Difference]: Finished difference Result 18492 states and 24092 transitions. [2022-01-10 21:42:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:42:13,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 374 [2022-01-10 21:42:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:13,481 INFO L225 Difference]: With dead ends: 18492 [2022-01-10 21:42:13,482 INFO L226 Difference]: Without dead ends: 10346 [2022-01-10 21:42:13,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:42:13,491 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 350 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:13,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 418 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:42:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10346 states. [2022-01-10 21:42:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10346 to 8216. [2022-01-10 21:42:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8216 states, 8215 states have (on average 1.2787583688374924) internal successors, (10505), 8215 states have internal predecessors, (10505), 0 states have call successors, (0), 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 21:42:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8216 states to 8216 states and 10505 transitions. [2022-01-10 21:42:13,625 INFO L78 Accepts]: Start accepts. Automaton has 8216 states and 10505 transitions. Word has length 374 [2022-01-10 21:42:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:13,626 INFO L470 AbstractCegarLoop]: Abstraction has 8216 states and 10505 transitions. [2022-01-10 21:42:13,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 21:42:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 8216 states and 10505 transitions. [2022-01-10 21:42:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2022-01-10 21:42:13,676 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:13,676 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:13,724 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 21:42:13,876 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,SelfDestructingSolverStorable21 [2022-01-10 21:42:13,877 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:13,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1873504962, now seen corresponding path program 1 times [2022-01-10 21:42:13,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:13,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723676120] [2022-01-10 21:42:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:13,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-01-10 21:42:13,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:13,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723676120] [2022-01-10 21:42:13,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723676120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:13,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:13,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:13,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372966805] [2022-01-10 21:42:13,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:13,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:13,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:13,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:13,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:13,976 INFO L87 Difference]: Start difference. First operand 8216 states and 10505 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 21:42:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:14,138 INFO L93 Difference]: Finished difference Result 15302 states and 19016 transitions. [2022-01-10 21:42:14,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:14,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 413 [2022-01-10 21:42:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:14,148 INFO L225 Difference]: With dead ends: 15302 [2022-01-10 21:42:14,149 INFO L226 Difference]: Without dead ends: 3670 [2022-01-10 21:42:14,158 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 21:42:14,159 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:14,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 264 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2022-01-10 21:42:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3480. [2022-01-10 21:42:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 3479 states have (on average 1.2480597872951997) internal successors, (4342), 3479 states have internal predecessors, (4342), 0 states have call successors, (0), 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 21:42:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 4342 transitions. [2022-01-10 21:42:14,221 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 4342 transitions. Word has length 413 [2022-01-10 21:42:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:14,221 INFO L470 AbstractCegarLoop]: Abstraction has 3480 states and 4342 transitions. [2022-01-10 21:42:14,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 21:42:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 4342 transitions. [2022-01-10 21:42:14,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2022-01-10 21:42:14,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:14,229 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-01-10 21:42:14,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 21:42:14,229 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:14,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2033532180, now seen corresponding path program 1 times [2022-01-10 21:42:14,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:14,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585550891] [2022-01-10 21:42:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:14,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2022-01-10 21:42:14,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:14,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585550891] [2022-01-10 21:42:14,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585550891] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:14,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832032869] [2022-01-10 21:42:14,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:14,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:14,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:14,332 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 21:42:14,387 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 21:42:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:14,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:14,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2022-01-10 21:42:15,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 21:42:15,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832032869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:15,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 21:42:15,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 21:42:15,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62547960] [2022-01-10 21:42:15,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:15,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:15,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:15,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:15,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:15,966 INFO L87 Difference]: Start difference. First operand 3480 states and 4342 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 21:42:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:16,001 INFO L93 Difference]: Finished difference Result 3895 states and 4823 transitions. [2022-01-10 21:42:16,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:16,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 511 [2022-01-10 21:42:16,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:16,007 INFO L225 Difference]: With dead ends: 3895 [2022-01-10 21:42:16,007 INFO L226 Difference]: Without dead ends: 3818 [2022-01-10 21:42:16,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 511 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 21:42:16,009 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 56 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:16,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 450 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2022-01-10 21:42:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3405. [2022-01-10 21:42:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 3404 states have (on average 1.248237367802585) internal successors, (4249), 3404 states have internal predecessors, (4249), 0 states have call successors, (0), 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 21:42:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 4249 transitions. [2022-01-10 21:42:16,060 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 4249 transitions. Word has length 511 [2022-01-10 21:42:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:16,061 INFO L470 AbstractCegarLoop]: Abstraction has 3405 states and 4249 transitions. [2022-01-10 21:42:16,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 21:42:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 4249 transitions. [2022-01-10 21:42:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2022-01-10 21:42:16,069 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:16,070 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 21:42:16,091 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 21:42:16,289 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 21:42:16,289 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:16,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash 950019299, now seen corresponding path program 1 times [2022-01-10 21:42:16,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:16,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549600070] [2022-01-10 21:42:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:16,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-01-10 21:42:16,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:16,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549600070] [2022-01-10 21:42:16,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549600070] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:16,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143543612] [2022-01-10 21:42:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:16,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:16,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:16,385 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 21:42:16,399 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 21:42:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:16,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 2395 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:16,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-01-10 21:42:17,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:42:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-01-10 21:42:17,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143543612] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 21:42:17,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 21:42:17,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-10 21:42:18,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054437009] [2022-01-10 21:42:18,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 21:42:18,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:42:18,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:18,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:42:18,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:42:18,019 INFO L87 Difference]: Start difference. First operand 3405 states and 4249 transitions. Second operand has 7 states, 7 states have (on average 45.714285714285715) internal successors, (320), 7 states have internal predecessors, (320), 0 states have call successors, (0), 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 21:42:18,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:18,262 INFO L93 Difference]: Finished difference Result 4257 states and 5305 transitions. [2022-01-10 21:42:18,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:42:18,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 45.714285714285715) internal successors, (320), 7 states have internal predecessors, (320), 0 states have call successors, (0), 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 623 [2022-01-10 21:42:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:18,263 INFO L225 Difference]: With dead ends: 4257 [2022-01-10 21:42:18,263 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 21:42:18,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1252 GetRequests, 1245 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:42:18,271 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 114 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:18,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 618 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:42:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 21:42:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 21:42:18,271 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 21:42:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 21:42:18,272 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 623 [2022-01-10 21:42:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:18,273 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 21:42:18,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.714285714285715) internal successors, (320), 7 states have internal predecessors, (320), 0 states have call successors, (0), 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 21:42:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 21:42:18,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 21:42:18,275 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 21:42:18,295 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 21:42:18,491 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 21:42:18,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 21:42:22,149 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 21:42:22,149 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 21:42:22,149 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 102) no Hoare annotation was computed. [2022-01-10 21:42:22,149 INFO L858 garLoopResultBuilder]: For program point L99-2(lines 96 102) no Hoare annotation was computed. [2022-01-10 21:42:22,149 INFO L858 garLoopResultBuilder]: For program point L99(lines 99 101) no Hoare annotation was computed. [2022-01-10 21:42:22,149 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 108) no Hoare annotation was computed. [2022-01-10 21:42:22,149 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 107) no Hoare annotation was computed. [2022-01-10 21:42:22,149 INFO L858 garLoopResultBuilder]: For program point L110-1(lines 87 562) no Hoare annotation was computed. [2022-01-10 21:42:22,149 INFO L861 garLoopResultBuilder]: At program point L551(lines 109 552) the Hoare annotation is: true [2022-01-10 21:42:22,150 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-01-10 21:42:22,150 INFO L858 garLoopResultBuilder]: For program point L556(lines 556 558) no Hoare annotation was computed. [2022-01-10 21:42:22,150 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 531) no Hoare annotation was computed. [2022-01-10 21:42:22,150 INFO L858 garLoopResultBuilder]: For program point L556-2(lines 556 558) no Hoare annotation was computed. [2022-01-10 21:42:22,150 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 531) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 21:42:22,150 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 530) no Hoare annotation was computed. [2022-01-10 21:42:22,150 INFO L861 garLoopResultBuilder]: At program point L561(lines 22 563) the Hoare annotation is: true [2022-01-10 21:42:22,151 INFO L854 garLoopResultBuilder]: At program point L218(lines 116 530) the Hoare annotation is: (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) [2022-01-10 21:42:22,151 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 529) no Hoare annotation was computed. [2022-01-10 21:42:22,151 INFO L861 garLoopResultBuilder]: At program point L572(lines 564 574) the Hoare annotation is: true [2022-01-10 21:42:22,151 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 225) no Hoare annotation was computed. [2022-01-10 21:42:22,151 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 528) no Hoare annotation was computed. [2022-01-10 21:42:22,151 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 21:42:22,151 INFO L858 garLoopResultBuilder]: For program point L223-2(lines 223 225) no Hoare annotation was computed. [2022-01-10 21:42:22,152 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 527) no Hoare annotation was computed. [2022-01-10 21:42:22,152 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 21:42:22,152 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 231) no Hoare annotation was computed. [2022-01-10 21:42:22,153 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 526) no Hoare annotation was computed. [2022-01-10 21:42:22,153 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 245) no Hoare annotation was computed. [2022-01-10 21:42:22,153 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 526) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 21:42:22,153 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 525) no Hoare annotation was computed. [2022-01-10 21:42:22,153 INFO L858 garLoopResultBuilder]: For program point L236(lines 236 239) no Hoare annotation was computed. [2022-01-10 21:42:22,153 INFO L858 garLoopResultBuilder]: For program point L234-2(lines 213 496) no Hoare annotation was computed. [2022-01-10 21:42:22,153 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 268) no Hoare annotation was computed. [2022-01-10 21:42:22,153 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 524) no Hoare annotation was computed. [2022-01-10 21:42:22,153 INFO L858 garLoopResultBuilder]: For program point L240(lines 240 243) no Hoare annotation was computed. [2022-01-10 21:42:22,153 INFO L858 garLoopResultBuilder]: For program point L250(lines 250 253) no Hoare annotation was computed. [2022-01-10 21:42:22,153 INFO L858 garLoopResultBuilder]: For program point L265-2(lines 213 496) no Hoare annotation was computed. [2022-01-10 21:42:22,154 INFO L858 garLoopResultBuilder]: For program point L265(lines 265 267) no Hoare annotation was computed. [2022-01-10 21:42:22,154 INFO L854 garLoopResultBuilder]: At program point L138(lines 134 524) the Hoare annotation is: (and (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (< 4368 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) [2022-01-10 21:42:22,154 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 523) no Hoare annotation was computed. [2022-01-10 21:42:22,155 INFO L854 garLoopResultBuilder]: At program point L497(lines 110 550) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0))) (let ((.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse5 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse6 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (.cse12 (= 4496 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse2 (= 4448 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse14 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse11 (not .cse0)) (.cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|)) (.cse3 (= 4528 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse9 (= 4512 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse17 (= 4480 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse16 (= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4)) (.cse18 (= 4464 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 3)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse5 .cse1 .cse6) (and .cse7 (= 4416 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse0) (and .cse8 .cse9 .cse10) (and .cse7 .cse0 (= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse4 .cse5 .cse8 .cse11 .cse10) (and .cse0 .cse1 .cse12) (and .cse0 .cse13 .cse1 .cse14 .cse6) (and .cse7 .cse0 .cse12) (and .cse1 .cse15) (and .cse7 .cse0 .cse2) (and .cse16 .cse0 .cse10) (and .cse13 .cse8 .cse14 .cse11 .cse10) (and .cse7 .cse17 .cse0) (and .cse0 .cse1 .cse9) (and (= 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse10) (and .cse7 .cse0 .cse3) (and .cse18 .cse0 .cse1) (and .cse8 .cse3 .cse10) (and .cse7 .cse0 .cse9) (and .cse17 .cse0 .cse1) (and .cse7 .cse16 .cse0 .cse1) (and .cse7 .cse18 .cse0) (and .cse0 .cse15 .cse10)))) [2022-01-10 21:42:22,155 INFO L858 garLoopResultBuilder]: For program point L274(lines 274 276) no Hoare annotation was computed. [2022-01-10 21:42:22,155 INFO L858 garLoopResultBuilder]: For program point L281(lines 281 283) no Hoare annotation was computed. [2022-01-10 21:42:22,155 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 522) no Hoare annotation was computed. [2022-01-10 21:42:22,155 INFO L858 garLoopResultBuilder]: For program point L533(lines 533 547) no Hoare annotation was computed. [2022-01-10 21:42:22,155 INFO L858 garLoopResultBuilder]: For program point L532(lines 532 548) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L858 garLoopResultBuilder]: For program point L281-2(lines 213 496) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L854 garLoopResultBuilder]: At program point L144(lines 140 522) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (< 4368 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse2))) [2022-01-10 21:42:22,156 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 521) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L858 garLoopResultBuilder]: For program point L534(lines 534 539) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L858 garLoopResultBuilder]: For program point L287(lines 287 291) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 308) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 520) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L858 garLoopResultBuilder]: For program point L536(lines 536 538) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L858 garLoopResultBuilder]: For program point L534-2(lines 533 547) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L858 garLoopResultBuilder]: For program point L287-2(lines 287 291) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 298 308) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 304) no Hoare annotation was computed. [2022-01-10 21:42:22,156 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 520) the Hoare annotation is: (let ((.cse0 (< 4368 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse1) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1))) [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 519) no Hoare annotation was computed. [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L302-2(lines 300 308) no Hoare annotation was computed. [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 318) no Hoare annotation was computed. [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 518) no Hoare annotation was computed. [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L316-2(lines 213 496) no Hoare annotation was computed. [2022-01-10 21:42:22,157 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 518) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1))) [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 517) no Hoare annotation was computed. [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L324(lines 324 327) no Hoare annotation was computed. [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 334) no Hoare annotation was computed. [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 516) no Hoare annotation was computed. [2022-01-10 21:42:22,157 INFO L854 garLoopResultBuilder]: At program point L333(lines 87 562) the Hoare annotation is: false [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 337) no Hoare annotation was computed. [2022-01-10 21:42:22,157 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 516) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 21:42:22,157 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 515) no Hoare annotation was computed. [2022-01-10 21:42:22,158 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 560) no Hoare annotation was computed. [2022-01-10 21:42:22,162 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 346) no Hoare annotation was computed. [2022-01-10 21:42:22,162 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 514) no Hoare annotation was computed. [2022-01-10 21:42:22,162 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-01-10 21:42:22,162 INFO L854 garLoopResultBuilder]: At program point L174(lines 164 514) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 21:42:22,162 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 513) no Hoare annotation was computed. [2022-01-10 21:42:22,162 INFO L858 garLoopResultBuilder]: For program point L347-2(lines 347 351) no Hoare annotation was computed. [2022-01-10 21:42:22,162 INFO L858 garLoopResultBuilder]: For program point L359(lines 359 361) no Hoare annotation was computed. [2022-01-10 21:42:22,162 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 512) no Hoare annotation was computed. [2022-01-10 21:42:22,162 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 511) no Hoare annotation was computed. [2022-01-10 21:42:22,162 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 510) no Hoare annotation was computed. [2022-01-10 21:42:22,162 INFO L854 garLoopResultBuilder]: At program point L180(lines 176 510) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 21:42:22,163 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 509) no Hoare annotation was computed. [2022-01-10 21:42:22,163 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 370) no Hoare annotation was computed. [2022-01-10 21:42:22,163 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 508) no Hoare annotation was computed. [2022-01-10 21:42:22,163 INFO L858 garLoopResultBuilder]: For program point L372(lines 372 377) no Hoare annotation was computed. [2022-01-10 21:42:22,163 INFO L854 garLoopResultBuilder]: At program point L186(lines 182 508) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 21:42:22,163 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 507) no Hoare annotation was computed. [2022-01-10 21:42:22,163 INFO L858 garLoopResultBuilder]: For program point L372-2(lines 372 377) no Hoare annotation was computed. [2022-01-10 21:42:22,163 INFO L858 garLoopResultBuilder]: For program point L383(lines 383 385) no Hoare annotation was computed. [2022-01-10 21:42:22,163 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 506) no Hoare annotation was computed. [2022-01-10 21:42:22,163 INFO L854 garLoopResultBuilder]: At program point L192(lines 188 506) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 21:42:22,165 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 505) no Hoare annotation was computed. [2022-01-10 21:42:22,165 INFO L858 garLoopResultBuilder]: For program point L393(lines 393 395) no Hoare annotation was computed. [2022-01-10 21:42:22,166 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 504) no Hoare annotation was computed. [2022-01-10 21:42:22,166 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 403) no Hoare annotation was computed. [2022-01-10 21:42:22,166 INFO L854 garLoopResultBuilder]: At program point L198(lines 194 504) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 21:42:22,166 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 503) no Hoare annotation was computed. [2022-01-10 21:42:22,166 INFO L858 garLoopResultBuilder]: For program point L399-2(lines 213 496) no Hoare annotation was computed. [2022-01-10 21:42:22,166 INFO L858 garLoopResultBuilder]: For program point L416(lines 416 418) no Hoare annotation was computed. [2022-01-10 21:42:22,166 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 502) no Hoare annotation was computed. [2022-01-10 21:42:22,166 INFO L858 garLoopResultBuilder]: For program point L408(lines 408 411) no Hoare annotation was computed. [2022-01-10 21:42:22,166 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 437) no Hoare annotation was computed. [2022-01-10 21:42:22,172 INFO L854 garLoopResultBuilder]: At program point L204(lines 200 502) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse0 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 12292) .cse0) (and .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse0 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (and .cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse0 (not .cse1) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 21:42:22,172 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 501) no Hoare annotation was computed. [2022-01-10 21:42:22,172 INFO L858 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2022-01-10 21:42:22,172 INFO L858 garLoopResultBuilder]: For program point L423-1(lines 423 437) no Hoare annotation was computed. [2022-01-10 21:42:22,172 INFO L858 garLoopResultBuilder]: For program point L443(lines 443 445) no Hoare annotation was computed. [2022-01-10 21:42:22,172 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 500) no Hoare annotation was computed. [2022-01-10 21:42:22,172 INFO L858 garLoopResultBuilder]: For program point L446(lines 446 450) no Hoare annotation was computed. [2022-01-10 21:42:22,172 INFO L854 garLoopResultBuilder]: At program point L207(lines 206 500) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse2 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse1 .cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) (not .cse0) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse1 .cse2))) [2022-01-10 21:42:22,172 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 499) no Hoare annotation was computed. [2022-01-10 21:42:22,173 INFO L858 garLoopResultBuilder]: For program point L446-2(lines 446 450) no Hoare annotation was computed. [2022-01-10 21:42:22,173 INFO L858 garLoopResultBuilder]: For program point L456(lines 456 467) no Hoare annotation was computed. [2022-01-10 21:42:22,173 INFO L861 garLoopResultBuilder]: At program point L210(lines 209 499) the Hoare annotation is: true [2022-01-10 21:42:22,173 INFO L861 garLoopResultBuilder]: At program point L212(lines 211 499) the Hoare annotation is: true [2022-01-10 21:42:22,173 INFO L858 garLoopResultBuilder]: For program point L461(lines 461 464) no Hoare annotation was computed. [2022-01-10 21:42:22,173 INFO L858 garLoopResultBuilder]: For program point L456-2(lines 456 467) no Hoare annotation was computed. [2022-01-10 21:42:22,173 INFO L858 garLoopResultBuilder]: For program point L472-1(lines 472 474) no Hoare annotation was computed. [2022-01-10 21:42:22,173 INFO L858 garLoopResultBuilder]: For program point L478(lines 478 480) no Hoare annotation was computed. [2022-01-10 21:42:22,173 INFO L858 garLoopResultBuilder]: For program point L478-2(lines 478 480) no Hoare annotation was computed. [2022-01-10 21:42:22,173 INFO L858 garLoopResultBuilder]: For program point L484(lines 484 486) no Hoare annotation was computed. [2022-01-10 21:42:22,173 INFO L858 garLoopResultBuilder]: For program point L484-2(lines 484 486) no Hoare annotation was computed. [2022-01-10 21:42:22,173 INFO L858 garLoopResultBuilder]: For program point L489(lines 489 491) no Hoare annotation was computed. [2022-01-10 21:42:22,175 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:22,176 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:42:22,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:42:22 BasicIcfg [2022-01-10 21:42:22,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:42:22,211 INFO L158 Benchmark]: Toolchain (without parser) took 17631.74ms. Allocated memory was 179.3MB in the beginning and 553.6MB in the end (delta: 374.3MB). Free memory was 122.9MB in the beginning and 377.4MB in the end (delta: -254.5MB). Peak memory consumption was 338.6MB. Max. memory is 8.0GB. [2022-01-10 21:42:22,212 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:42:22,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.50ms. Allocated memory was 179.3MB in the beginning and 231.7MB in the end (delta: 52.4MB). Free memory was 122.7MB in the beginning and 200.0MB in the end (delta: -77.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-01-10 21:42:22,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.23ms. Allocated memory is still 231.7MB. Free memory was 200.0MB in the beginning and 197.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 21:42:22,212 INFO L158 Benchmark]: Boogie Preprocessor took 24.06ms. Allocated memory is still 231.7MB. Free memory was 197.5MB in the beginning and 195.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 21:42:22,212 INFO L158 Benchmark]: RCFGBuilder took 539.32ms. Allocated memory is still 231.7MB. Free memory was 195.4MB in the beginning and 169.7MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-01-10 21:42:22,212 INFO L158 Benchmark]: IcfgTransformer took 108.62ms. Allocated memory is still 231.7MB. Free memory was 169.7MB in the beginning and 156.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 21:42:22,213 INFO L158 Benchmark]: TraceAbstraction took 16678.75ms. Allocated memory was 231.7MB in the beginning and 553.6MB in the end (delta: 321.9MB). Free memory was 155.5MB in the beginning and 377.4MB in the end (delta: -221.9MB). Peak memory consumption was 318.8MB. Max. memory is 8.0GB. [2022-01-10 21:42:22,213 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.50ms. Allocated memory was 179.3MB in the beginning and 231.7MB in the end (delta: 52.4MB). Free memory was 122.7MB in the beginning and 200.0MB in the end (delta: -77.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.23ms. Allocated memory is still 231.7MB. Free memory was 200.0MB in the beginning and 197.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.06ms. Allocated memory is still 231.7MB. Free memory was 197.5MB in the beginning and 195.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 539.32ms. Allocated memory is still 231.7MB. Free memory was 195.4MB in the beginning and 169.7MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * IcfgTransformer took 108.62ms. Allocated memory is still 231.7MB. Free memory was 169.7MB in the beginning and 156.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 16678.75ms. Allocated memory was 231.7MB in the beginning and 553.6MB in the end (delta: 321.9MB). Free memory was 155.5MB in the beginning and 377.4MB in the end (delta: -221.9MB). Peak memory consumption was 318.8MB. 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: 560]: 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, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 25, TraceHistogramMax: 22, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2206 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2206 mSDsluCounter, 8005 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3079 mSDsCounter, 516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2875 IncrementalHoareTripleChecker+Invalid, 3391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 516 mSolverCounterUnsat, 4926 mSDtfsCounter, 2875 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3309 GetRequests, 3267 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8216occurred in iteration=22, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 5837 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 256 NumberOfFragments, 745 HoareAnnotationTreeSize, 22 FomulaSimplifications, 12314 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 11097 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 8054 NumberOfCodeBlocks, 8054 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 9380 ConstructedInterpolants, 0 QuantifiedInterpolants, 15059 SizeOfPredicates, 4 NumberOfNonLiveVariables, 7423 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 42861/42962 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: 176]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 && ~bvule32(4560bv32, s__state) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((~bvule32(blastFlag, 2bv32) && 0bv32 == s__hit) && s__state == 4400bv32) || blastFlag == 0bv32) || (((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32)) && s__state == 4400bv32)) || ((0bv32 == s__hit && 4512bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(0bv32, s__hit)) && 4512bv32 == s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32))) || (~bvule32(blastFlag, 2bv32) && s__state == 4384bv32)) || ((s__state == 4448bv32 && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4480bv32 == s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(4560bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(0bv32, s__hit)) && 4528bv32 == s__state)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && s__state == 4448bv32) && 0bv32 == s__hit)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && s__state == 4496bv32)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4512bv32 == s__state)) || ((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && 4432bv32 == s__state)) || (~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 3bv32))) || ((s__state == 4416bv32 && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32))) || (((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(4352bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32))) || ((0bv32 == s__hit && s__state == 4496bv32) && ~bvule32(blastFlag, 4bv32))) || ((0bv32 == s__hit && 4480bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(blastFlag, 2bv32) && 0bv32 == s__hit) && ~bvule32(s__state, 3bv32))) || ((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && 4464bv32 == s__state)) || ((0bv32 == s__hit && 4528bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4464bv32 == s__state)) || ((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4560bv32, s__state))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4528bv32 == s__state) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4432bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32)) || ((blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && ~bvule32(s__state, 4352bv32))) || (((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(4352bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32)) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32)) && ~bvult64(4368bv32, s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvult64(4368bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvult64(4368bv32, s__state)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(4560bv32, s__state)) || ((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4560bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(4560bv32, s__state)) && ~bvult64(s__state, 12292bv32)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state)) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4432bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && ~bvult64(4368bv32, s__state)) && !~bvule32(4400bv32, s__state) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32)) && ~bvult64(4368bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvult64(4368bv32, s__state)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 21:42:22,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...