/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_srvr_14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:42:19,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:42:19,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:42:19,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:42:19,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:42:19,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:42:19,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:42:19,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:42:19,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:42:19,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:42:19,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:42:19,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:42:19,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:42:19,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:42:19,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:42:19,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:42:19,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:42:19,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:42:19,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:42:19,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:42:19,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:42:19,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:42:19,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:42:19,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:42:19,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:42:19,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:42:19,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:42:19,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:42:19,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:42:19,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:42:19,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:42:19,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:42:19,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:42:19,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:42:19,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:42:19,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:42:19,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:42:19,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:42:19,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:42:19,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:42:19,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:42:19,991 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:20,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:42:20,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:42:20,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:42:20,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:42:20,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:42:20,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:42:20,007 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:42:20,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:42:20,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:42:20,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:42:20,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:42:20,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:42:20,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:42:20,008 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:42:20,008 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:42:20,008 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:42:20,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:42:20,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:42:20,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:42:20,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:42:20,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:42:20,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:42:20,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:42:20,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:42:20,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:42:20,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:42:20,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:42:20,010 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:42:20,010 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:42:20,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:42:20,010 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:42:20,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:42:20,011 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:42:20,011 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:20,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:42:20,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:42:20,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:42:20,166 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:42:20,166 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:42:20,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_14.cil.c [2022-01-10 21:42:20,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8650a72b/c8606222c2884299a405a1c322f4f9a6/FLAG2efc2aca9 [2022-01-10 21:42:20,662 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:42:20,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_14.cil.c [2022-01-10 21:42:20,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8650a72b/c8606222c2884299a405a1c322f4f9a6/FLAG2efc2aca9 [2022-01-10 21:42:20,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8650a72b/c8606222c2884299a405a1c322f4f9a6 [2022-01-10 21:42:20,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:42:20,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:42:21,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:42:21,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:42:21,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:42:21,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:42:20" (1/1) ... [2022-01-10 21:42:21,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbe6185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:21, skipping insertion in model container [2022-01-10 21:42:21,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:42:20" (1/1) ... [2022-01-10 21:42:21,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:42:21,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:42:21,179 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_14.cil.c[45163,45176] [2022-01-10 21:42:21,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:42:21,193 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:42:21,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_14.cil.c[45163,45176] [2022-01-10 21:42:21,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:42:21,267 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:42:21,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:21 WrapperNode [2022-01-10 21:42:21,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:42:21,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:42:21,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:42:21,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:42:21,273 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:21" (1/1) ... [2022-01-10 21:42:21,292 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:21" (1/1) ... [2022-01-10 21:42:21,325 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 517 [2022-01-10 21:42:21,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:42:21,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:42:21,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:42:21,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:42:21,332 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:21" (1/1) ... [2022-01-10 21:42:21,332 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:21" (1/1) ... [2022-01-10 21:42:21,335 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:21" (1/1) ... [2022-01-10 21:42:21,335 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:21" (1/1) ... [2022-01-10 21:42:21,342 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:21" (1/1) ... [2022-01-10 21:42:21,357 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:21" (1/1) ... [2022-01-10 21:42:21,358 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:21" (1/1) ... [2022-01-10 21:42:21,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:42:21,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:42:21,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:42:21,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:42:21,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:21" (1/1) ... [2022-01-10 21:42:21,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:42:21,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:21,411 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:21,434 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:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:42:21,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:42:21,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:42:21,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:42:21,524 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:42:21,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:42:21,555 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:42:21,877 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-10 21:42:21,877 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-10 21:42:21,877 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:42:21,882 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:42:21,883 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 21:42:21,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:21 BoogieIcfgContainer [2022-01-10 21:42:21,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:42:21,885 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:42:21,885 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:42:21,892 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:42:21,894 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:21" (1/1) ... [2022-01-10 21:42:21,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:42:21 BasicIcfg [2022-01-10 21:42:21,995 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:42:21,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:42:21,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:42:21,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:42:21,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:42:20" (1/4) ... [2022-01-10 21:42:21,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0879db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:42:21, skipping insertion in model container [2022-01-10 21:42:21,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:21" (2/4) ... [2022-01-10 21:42:21,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0879db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:42:21, skipping insertion in model container [2022-01-10 21:42:21,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:21" (3/4) ... [2022-01-10 21:42:21,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0879db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:42:21, skipping insertion in model container [2022-01-10 21:42:21,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:42:21" (4/4) ... [2022-01-10 21:42:22,000 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.cTransformedIcfg [2022-01-10 21:42:22,005 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:42:22,005 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 21:42:22,045 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:42:22,050 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:22,050 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 21:42:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 149 states have (on average 1.74496644295302) internal successors, (260), 150 states have internal predecessors, (260), 0 states have call successors, (0), 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:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 21:42:22,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:22,068 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] [2022-01-10 21:42:22,068 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:22,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:22,071 INFO L85 PathProgramCache]: Analyzing trace with hash 113849800, now seen corresponding path program 1 times [2022-01-10 21:42:22,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:22,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260432457] [2022-01-10 21:42:22,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:22,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:22,317 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:22,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:22,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260432457] [2022-01-10 21:42:22,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260432457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:22,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:22,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:42:22,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855799068] [2022-01-10 21:42:22,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:22,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:42:22,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:22,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:42:22,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:42:22,348 INFO L87 Difference]: Start difference. First operand has 151 states, 149 states have (on average 1.74496644295302) internal successors, (260), 150 states have internal predecessors, (260), 0 states have call successors, (0), 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 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:22,531 INFO L93 Difference]: Finished difference Result 224 states and 368 transitions. [2022-01-10 21:42:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:42:22,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 21:42:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:22,544 INFO L225 Difference]: With dead ends: 224 [2022-01-10 21:42:22,545 INFO L226 Difference]: Without dead ends: 181 [2022-01-10 21:42:22,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:22,551 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 272 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:22,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 443 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-01-10 21:42:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 156. [2022-01-10 21:42:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.5612903225806452) internal successors, (242), 155 states have internal predecessors, (242), 0 states have call successors, (0), 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:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2022-01-10 21:42:22,594 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 23 [2022-01-10 21:42:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:22,594 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2022-01-10 21:42:22,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2022-01-10 21:42:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 21:42:22,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:22,595 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:22,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:42:22,596 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash 133410387, now seen corresponding path program 1 times [2022-01-10 21:42:22,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:22,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553998044] [2022-01-10 21:42:22,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:22,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:22,644 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:22,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:22,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553998044] [2022-01-10 21:42:22,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553998044] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:22,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:22,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:42:22,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008208586] [2022-01-10 21:42:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:22,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:42:22,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:22,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:42:22,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:42:22,646 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:22,794 INFO L93 Difference]: Finished difference Result 182 states and 280 transitions. [2022-01-10 21:42:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:42:22,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:22,796 INFO L225 Difference]: With dead ends: 182 [2022-01-10 21:42:22,796 INFO L226 Difference]: Without dead ends: 180 [2022-01-10 21:42:22,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:22,797 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 204 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:22,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 339 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-01-10 21:42:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 146. [2022-01-10 21:42:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.5793103448275863) internal successors, (229), 145 states have internal predecessors, (229), 0 states have call successors, (0), 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:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 229 transitions. [2022-01-10 21:42:22,805 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 229 transitions. Word has length 24 [2022-01-10 21:42:22,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:22,805 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 229 transitions. [2022-01-10 21:42:22,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:22,805 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 229 transitions. [2022-01-10 21:42:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 21:42:22,806 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:22,806 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:22,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:42:22,806 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:22,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1700721331, now seen corresponding path program 1 times [2022-01-10 21:42:22,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:22,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620884585] [2022-01-10 21:42:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:22,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:22,844 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:22,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:22,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620884585] [2022-01-10 21:42:22,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620884585] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:22,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:22,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:42:22,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923093860] [2022-01-10 21:42:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:22,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:42:22,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:42:22,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:42:22,846 INFO L87 Difference]: Start difference. First operand 146 states and 229 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:22,974 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2022-01-10 21:42:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:42:22,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:22,975 INFO L225 Difference]: With dead ends: 195 [2022-01-10 21:42:22,975 INFO L226 Difference]: Without dead ends: 193 [2022-01-10 21:42:22,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:22,976 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 201 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:22,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 341 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-10 21:42:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 144. [2022-01-10 21:42:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.5874125874125875) internal successors, (227), 143 states have internal predecessors, (227), 0 states have call successors, (0), 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:22,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 227 transitions. [2022-01-10 21:42:22,983 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 227 transitions. Word has length 24 [2022-01-10 21:42:22,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:22,983 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 227 transitions. [2022-01-10 21:42:22,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:22,983 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 227 transitions. [2022-01-10 21:42:22,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 21:42:22,984 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:22,984 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:22,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:42:22,984 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash 922410674, now seen corresponding path program 1 times [2022-01-10 21:42:22,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:22,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099575363] [2022-01-10 21:42:22,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:22,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:23,017 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:23,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:23,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099575363] [2022-01-10 21:42:23,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099575363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:23,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:23,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:42:23,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223156868] [2022-01-10 21:42:23,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:23,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:42:23,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:23,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:42:23,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:42:23,019 INFO L87 Difference]: Start difference. First operand 144 states and 227 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:23,156 INFO L93 Difference]: Finished difference Result 193 states and 299 transitions. [2022-01-10 21:42:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:42:23,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:23,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:23,157 INFO L225 Difference]: With dead ends: 193 [2022-01-10 21:42:23,157 INFO L226 Difference]: Without dead ends: 191 [2022-01-10 21:42:23,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:23,158 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 202 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:23,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 340 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-01-10 21:42:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 144. [2022-01-10 21:42:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.5874125874125875) internal successors, (227), 143 states have internal predecessors, (227), 0 states have call successors, (0), 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:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 227 transitions. [2022-01-10 21:42:23,164 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 227 transitions. Word has length 24 [2022-01-10 21:42:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:23,164 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 227 transitions. [2022-01-10 21:42:23,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 227 transitions. [2022-01-10 21:42:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 21:42:23,165 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:23,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:23,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:42:23,166 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:23,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash -701551050, now seen corresponding path program 1 times [2022-01-10 21:42:23,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:23,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072005228] [2022-01-10 21:42:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:23,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:23,193 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:23,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:23,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072005228] [2022-01-10 21:42:23,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072005228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:23,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:23,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:23,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217374650] [2022-01-10 21:42:23,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:23,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:23,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:23,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:23,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:23,194 INFO L87 Difference]: Start difference. First operand 144 states and 227 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:23,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:23,228 INFO L93 Difference]: Finished difference Result 415 states and 656 transitions. [2022-01-10 21:42:23,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:23,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-01-10 21:42:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:23,229 INFO L225 Difference]: With dead ends: 415 [2022-01-10 21:42:23,229 INFO L226 Difference]: Without dead ends: 279 [2022-01-10 21:42:23,230 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:23,231 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 182 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:23,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 388 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-01-10 21:42:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2022-01-10 21:42:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.5543478260869565) internal successors, (429), 276 states have internal predecessors, (429), 0 states have call successors, (0), 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:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 429 transitions. [2022-01-10 21:42:23,240 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 429 transitions. Word has length 32 [2022-01-10 21:42:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:23,240 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 429 transitions. [2022-01-10 21:42:23,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 429 transitions. [2022-01-10 21:42:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 21:42:23,241 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:23,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:23,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:42:23,241 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1796464887, now seen corresponding path program 1 times [2022-01-10 21:42:23,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:23,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387091051] [2022-01-10 21:42:23,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:23,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:23,266 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:23,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:23,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387091051] [2022-01-10 21:42:23,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387091051] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:23,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:23,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:23,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120459093] [2022-01-10 21:42:23,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:23,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:23,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:23,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:23,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:23,267 INFO L87 Difference]: Start difference. First operand 277 states and 429 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:23,397 INFO L93 Difference]: Finished difference Result 646 states and 1025 transitions. [2022-01-10 21:42:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:23,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-01-10 21:42:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:23,398 INFO L225 Difference]: With dead ends: 646 [2022-01-10 21:42:23,399 INFO L226 Difference]: Without dead ends: 377 [2022-01-10 21:42:23,400 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:23,400 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 51 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:23,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 349 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-01-10 21:42:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 365. [2022-01-10 21:42:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4532967032967032) internal successors, (529), 364 states have internal predecessors, (529), 0 states have call successors, (0), 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:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 529 transitions. [2022-01-10 21:42:23,409 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 529 transitions. Word has length 32 [2022-01-10 21:42:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:23,409 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 529 transitions. [2022-01-10 21:42:23,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 529 transitions. [2022-01-10 21:42:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 21:42:23,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:23,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:23,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:42:23,410 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:23,411 INFO L85 PathProgramCache]: Analyzing trace with hash -10989576, now seen corresponding path program 1 times [2022-01-10 21:42:23,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:23,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513156587] [2022-01-10 21:42:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:23,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:23,446 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:23,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:23,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513156587] [2022-01-10 21:42:23,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513156587] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:23,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:23,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:23,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792302742] [2022-01-10 21:42:23,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:23,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:23,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:23,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:23,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:23,448 INFO L87 Difference]: Start difference. First operand 365 states and 529 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:23,577 INFO L93 Difference]: Finished difference Result 855 states and 1279 transitions. [2022-01-10 21:42:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:23,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-01-10 21:42:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:23,579 INFO L225 Difference]: With dead ends: 855 [2022-01-10 21:42:23,579 INFO L226 Difference]: Without dead ends: 474 [2022-01-10 21:42:23,579 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:23,580 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 72 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:23,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 279 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-01-10 21:42:23,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 465. [2022-01-10 21:42:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.4288793103448276) internal successors, (663), 464 states have internal predecessors, (663), 0 states have call successors, (0), 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:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 663 transitions. [2022-01-10 21:42:23,589 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 663 transitions. Word has length 32 [2022-01-10 21:42:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:23,590 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 663 transitions. [2022-01-10 21:42:23,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:23,590 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 663 transitions. [2022-01-10 21:42:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 21:42:23,591 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:23,591 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:23,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:42:23,591 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:23,591 INFO L85 PathProgramCache]: Analyzing trace with hash 52945158, now seen corresponding path program 1 times [2022-01-10 21:42:23,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:23,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793923873] [2022-01-10 21:42:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:23,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:23,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:23,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793923873] [2022-01-10 21:42:23,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793923873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:23,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:23,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:23,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110350369] [2022-01-10 21:42:23,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:23,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:23,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:23,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:23,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:23,616 INFO L87 Difference]: Start difference. First operand 465 states and 663 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:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:23,624 INFO L93 Difference]: Finished difference Result 922 states and 1314 transitions. [2022-01-10 21:42:23,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:23,625 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 48 [2022-01-10 21:42:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:23,626 INFO L225 Difference]: With dead ends: 922 [2022-01-10 21:42:23,626 INFO L226 Difference]: Without dead ends: 465 [2022-01-10 21:42:23,627 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:23,627 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 195 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:23,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 215 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-01-10 21:42:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2022-01-10 21:42:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.4073275862068966) internal successors, (653), 464 states have internal predecessors, (653), 0 states have call successors, (0), 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:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 653 transitions. [2022-01-10 21:42:23,637 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 653 transitions. Word has length 48 [2022-01-10 21:42:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:23,637 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 653 transitions. [2022-01-10 21:42:23,637 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:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 653 transitions. [2022-01-10 21:42:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 21:42:23,638 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:23,638 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 21:42:23,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:42:23,638 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:23,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash -945656847, now seen corresponding path program 1 times [2022-01-10 21:42:23,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:23,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720759900] [2022-01-10 21:42:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:23,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:23,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:23,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720759900] [2022-01-10 21:42:23,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720759900] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:23,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:23,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:23,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116209454] [2022-01-10 21:42:23,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:23,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:23,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:23,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:23,661 INFO L87 Difference]: Start difference. First operand 465 states and 653 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:23,700 INFO L93 Difference]: Finished difference Result 932 states and 1306 transitions. [2022-01-10 21:42:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:23,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-01-10 21:42:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:23,702 INFO L225 Difference]: With dead ends: 932 [2022-01-10 21:42:23,702 INFO L226 Difference]: Without dead ends: 475 [2022-01-10 21:42:23,702 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:23,703 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 185 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:23,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 219 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-01-10 21:42:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 473. [2022-01-10 21:42:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.3834745762711864) internal successors, (653), 472 states have internal predecessors, (653), 0 states have call successors, (0), 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:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 653 transitions. [2022-01-10 21:42:23,712 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 653 transitions. Word has length 49 [2022-01-10 21:42:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:23,712 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 653 transitions. [2022-01-10 21:42:23,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 653 transitions. [2022-01-10 21:42:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 21:42:23,713 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:23,713 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 21:42:23,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:42:23,713 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:23,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:23,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1763145322, now seen corresponding path program 1 times [2022-01-10 21:42:23,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:23,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456355923] [2022-01-10 21:42:23,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:23,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:23,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:23,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456355923] [2022-01-10 21:42:23,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456355923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:23,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:23,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:23,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575388148] [2022-01-10 21:42:23,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:23,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:23,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:23,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:23,737 INFO L87 Difference]: Start difference. First operand 473 states and 653 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:23,757 INFO L93 Difference]: Finished difference Result 1401 states and 1929 transitions. [2022-01-10 21:42:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-10 21:42:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:23,760 INFO L225 Difference]: With dead ends: 1401 [2022-01-10 21:42:23,760 INFO L226 Difference]: Without dead ends: 936 [2022-01-10 21:42:23,760 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:23,761 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 186 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:23,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 419 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-01-10 21:42:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 934. [2022-01-10 21:42:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 1.3687031082529475) internal successors, (1277), 933 states have internal predecessors, (1277), 0 states have call successors, (0), 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:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1277 transitions. [2022-01-10 21:42:23,779 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1277 transitions. Word has length 52 [2022-01-10 21:42:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:23,779 INFO L470 AbstractCegarLoop]: Abstraction has 934 states and 1277 transitions. [2022-01-10 21:42:23,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1277 transitions. [2022-01-10 21:42:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-10 21:42:23,780 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:23,780 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 21:42:23,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:42:23,780 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:23,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:23,781 INFO L85 PathProgramCache]: Analyzing trace with hash -462048637, now seen corresponding path program 1 times [2022-01-10 21:42:23,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:23,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336057390] [2022-01-10 21:42:23,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:23,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:23,805 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:23,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:23,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336057390] [2022-01-10 21:42:23,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336057390] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:23,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:23,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:23,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495467461] [2022-01-10 21:42:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:23,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:23,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:23,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:23,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:23,806 INFO L87 Difference]: Start difference. First operand 934 states and 1277 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:23,836 INFO L93 Difference]: Finished difference Result 2728 states and 3713 transitions. [2022-01-10 21:42:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:23,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-01-10 21:42:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:23,841 INFO L225 Difference]: With dead ends: 2728 [2022-01-10 21:42:23,842 INFO L226 Difference]: Without dead ends: 1806 [2022-01-10 21:42:23,843 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:23,843 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 171 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:23,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 425 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-01-10 21:42:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1780. [2022-01-10 21:42:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1779 states have (on average 1.3541315345699831) internal successors, (2409), 1779 states have internal predecessors, (2409), 0 states have call successors, (0), 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:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2409 transitions. [2022-01-10 21:42:23,883 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2409 transitions. Word has length 53 [2022-01-10 21:42:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:23,884 INFO L470 AbstractCegarLoop]: Abstraction has 1780 states and 2409 transitions. [2022-01-10 21:42:23,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2409 transitions. [2022-01-10 21:42:23,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 21:42:23,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:23,885 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 21:42:23,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 21:42:23,886 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:23,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2142866425, now seen corresponding path program 1 times [2022-01-10 21:42:23,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:23,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054517572] [2022-01-10 21:42:23,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:23,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:23,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:23,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054517572] [2022-01-10 21:42:23,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054517572] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:23,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:23,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:23,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395693914] [2022-01-10 21:42:23,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:23,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:23,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:23,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:23,913 INFO L87 Difference]: Start difference. First operand 1780 states and 2409 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:23,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:23,996 INFO L93 Difference]: Finished difference Result 5298 states and 7165 transitions. [2022-01-10 21:42:23,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:23,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-10 21:42:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:24,006 INFO L225 Difference]: With dead ends: 5298 [2022-01-10 21:42:24,007 INFO L226 Difference]: Without dead ends: 3532 [2022-01-10 21:42:24,009 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:24,009 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 173 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:24,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 625 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3532 states. [2022-01-10 21:42:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3532 to 2646. [2022-01-10 21:42:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2646 states, 2645 states have (on average 1.3523629489603024) internal successors, (3577), 2645 states have internal predecessors, (3577), 0 states have call successors, (0), 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:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 3577 transitions. [2022-01-10 21:42:24,077 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 3577 transitions. Word has length 56 [2022-01-10 21:42:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:24,078 INFO L470 AbstractCegarLoop]: Abstraction has 2646 states and 3577 transitions. [2022-01-10 21:42:24,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 3577 transitions. [2022-01-10 21:42:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 21:42:24,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:24,080 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 21:42:24,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:42:24,080 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:24,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash -918088493, now seen corresponding path program 1 times [2022-01-10 21:42:24,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:24,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439935983] [2022-01-10 21:42:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:24,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 21:42:24,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 21:42:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 21:42:24,135 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 21:42:24,135 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 21:42:24,136 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 21:42:24,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:42:24,139 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:24,141 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:42:24,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:42:24 BasicIcfg [2022-01-10 21:42:24,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:42:24,221 INFO L158 Benchmark]: Toolchain (without parser) took 3222.06ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 165.2MB in the beginning and 86.7MB in the end (delta: 78.5MB). Peak memory consumption was 117.0MB. Max. memory is 8.0GB. [2022-01-10 21:42:24,221 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:42:24,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.40ms. Allocated memory is still 189.8MB. Free memory was 165.0MB in the beginning and 158.7MB in the end (delta: 6.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 21:42:24,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.79ms. Allocated memory is still 189.8MB. Free memory was 158.7MB in the beginning and 155.8MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 21:42:24,221 INFO L158 Benchmark]: Boogie Preprocessor took 34.45ms. Allocated memory is still 189.8MB. Free memory was 155.8MB in the beginning and 153.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 21:42:24,221 INFO L158 Benchmark]: RCFGBuilder took 522.69ms. Allocated memory is still 189.8MB. Free memory was 153.4MB in the beginning and 125.7MB in the end (delta: 27.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-01-10 21:42:24,222 INFO L158 Benchmark]: IcfgTransformer took 110.48ms. Allocated memory is still 189.8MB. Free memory was 125.7MB in the beginning and 111.3MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 21:42:24,222 INFO L158 Benchmark]: TraceAbstraction took 2224.21ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 110.7MB in the beginning and 86.7MB in the end (delta: 24.0MB). Peak memory consumption was 63.4MB. Max. memory is 8.0GB. [2022-01-10 21:42:24,223 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 189.8MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.40ms. Allocated memory is still 189.8MB. Free memory was 165.0MB in the beginning and 158.7MB in the end (delta: 6.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.79ms. Allocated memory is still 189.8MB. Free memory was 158.7MB in the beginning and 155.8MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.45ms. Allocated memory is still 189.8MB. Free memory was 155.8MB in the beginning and 153.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 522.69ms. Allocated memory is still 189.8MB. Free memory was 153.4MB in the beginning and 125.7MB in the end (delta: 27.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * IcfgTransformer took 110.48ms. Allocated memory is still 189.8MB. Free memory was 125.7MB in the beginning and 111.3MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2224.21ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 110.7MB in the beginning and 86.7MB in the end (delta: 24.0MB). Peak memory consumption was 63.4MB. 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 - CounterExampleResult [Line: 652]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L657] int s ; [L658] int tmp ; [L662] s = 8464 [L663] CALL ssl3_accept(s) [L23] int s__info_callback = __VERIFIER_nondet_int() ; [L24] int s__in_handshake = __VERIFIER_nondet_int() ; [L25] int s__state ; [L26] int s__new_session ; [L27] int s__server ; [L28] int s__version = __VERIFIER_nondet_int() ; [L29] int s__type ; [L30] int s__init_num ; [L31] int s__hit = __VERIFIER_nondet_int() ; [L32] int s__rwstate ; [L33] int s__init_buf___0 = 1; [L34] int s__debug = __VERIFIER_nondet_int() ; [L35] int s__shutdown ; [L36] int s__cert = __VERIFIER_nondet_int() ; [L37] int s__options = __VERIFIER_nondet_int() ; [L38] int s__verify_mode = __VERIFIER_nondet_int() ; [L39] int s__session__peer = __VERIFIER_nondet_int() ; [L40] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L41] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L42] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L43] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L44] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L45] int s__s3__tmp__cert_request ; [L46] int s__s3__tmp__reuse_message ; [L47] int s__s3__tmp__use_rsa_tmp ; [L48] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L49] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L50] int s__s3__tmp__next_state___0 ; [L51] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L52] int s__session__cipher ; [L53] int buf ; [L54] unsigned long l ; [L55] unsigned long Time ; [L56] unsigned long tmp ; [L57] int cb ; [L58] long num1 = __VERIFIER_nondet_long() ; [L59] int ret ; [L60] int new_state ; [L61] int state ; [L62] int skip ; [L63] int got_new_session ; [L64] int tmp___1 = __VERIFIER_nondet_int() ; [L65] int tmp___2 = __VERIFIER_nondet_int() ; [L66] int tmp___3 = __VERIFIER_nondet_int() ; [L67] int tmp___4 = __VERIFIER_nondet_int() ; [L68] int tmp___5 = __VERIFIER_nondet_int() ; [L69] int tmp___6 = __VERIFIER_nondet_int() ; [L70] int tmp___7 ; [L71] long tmp___8 = __VERIFIER_nondet_long() ; [L72] int tmp___9 = __VERIFIER_nondet_int() ; [L73] int tmp___10 = __VERIFIER_nondet_int() ; [L74] int blastFlag ; [L75] int __cil_tmp55 ; [L76] unsigned long __cil_tmp56 ; [L77] unsigned long __cil_tmp57 ; [L78] unsigned long __cil_tmp58 ; [L79] unsigned long __cil_tmp59 ; [L80] int __cil_tmp60 ; [L81] unsigned long __cil_tmp61 ; [L84] s__s3__tmp__reuse_message = 0 [L85] s__state = initial_state [L86] blastFlag = 0 [L87] tmp = __VERIFIER_nondet_int() [L88] Time = tmp [L89] cb = 0 [L90] ret = -1 [L91] skip = 0 [L92] got_new_session = 0 VAL [\old(initial_state)=8464, blastFlag=0, cb=0, got_new_session=0, initial_state=8464, ret=4294967295, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, Time=0, tmp=0] [L93] COND TRUE s__info_callback != 0 [L94] cb = s__info_callback VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, Time=0, tmp=0] [L100] s__in_handshake ++ VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, Time=0, tmp=0] [L101] COND TRUE tmp___1 + 12288 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, Time=0, tmp=0, tmp___1=0] [L102] COND TRUE tmp___2 + 16384 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L106] COND FALSE !(s__cert == 0) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L110] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L112] state = s__state VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L113] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L116] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L119] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L122] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L125] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L128] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L131] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L134] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L137] COND TRUE s__state == 8464 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L283] s__shutdown = 0 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 0 [L286] blastFlag = 1 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=0, initial_state=8464, ret=1, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L288] COND FALSE !(ret <= 0) [L291] got_new_session = 1 [L292] s__state = 8496 [L293] s__init_num = 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L614] COND TRUE ! s__s3__tmp__reuse_message VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L615] COND TRUE ! skip VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L616] COND TRUE tmp___1 != -12288 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L617] COND TRUE s__state != 8656 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L618] COND TRUE tmp___2 != -16384 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L619] COND FALSE !(state == 8496) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L626] COND FALSE !(\read(s__debug)) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L632] COND TRUE cb != 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L633] COND TRUE s__state != state [L634] new_state = s__state [L635] s__state = state [L636] s__state = new_state VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L641] skip = 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L110] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L112] state = s__state VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L113] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L116] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L119] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L122] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L125] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L128] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L131] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L134] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L137] COND FALSE !(s__state == 8464) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L140] COND FALSE !(s__state == 8465) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L143] COND FALSE !(s__state == 8466) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L146] COND TRUE s__state == 8496 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L297] ret = __VERIFIER_nondet_int() [L298] COND TRUE blastFlag == 1 [L299] blastFlag = 2 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L301] COND FALSE !(ret <= 0) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L304] COND FALSE !(\read(s__hit)) [L307] s__state = 8512 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L309] s__init_num = 0 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L614] COND TRUE ! s__s3__tmp__reuse_message VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L615] COND TRUE ! skip VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L616] COND TRUE tmp___1 != -12288 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L617] COND TRUE s__state != 8656 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L618] COND TRUE tmp___2 != -16384 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L619] COND TRUE state == 8496 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] [L652] reach_error() VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, ret=1, s__cert=4, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=0, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2094 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2094 mSDsluCounter, 4382 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1763 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1027 IncrementalHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 2619 mSDtfsCounter, 1027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2646occurred in iteration=12, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1094 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 506 NumberOfCodeBlocks, 506 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 69/69 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 RESULT: Ultimate proved your program to be incorrect! [2022-01-10 21:42:24,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...