/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/bitvector/s3_srvr_1a.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:08:46,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:08:46,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:08:46,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:08:46,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:08:46,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:08:46,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:08:46,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:08:46,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:08:46,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:08:46,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:08:46,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:08:46,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:08:46,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:08:46,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:08:46,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:08:46,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:08:46,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:08:46,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:08:46,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:08:46,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:08:46,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:08:46,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:08:46,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:08:46,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:08:46,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:08:46,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:08:46,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:08:46,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:08:46,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:08:46,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:08:46,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:08:46,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:08:46,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:08:46,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:08:46,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:08:46,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:08:46,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:08:46,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:08:46,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:08:46,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:08:46,910 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 20:08:46,926 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:08:46,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:08:46,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:08:46,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:08:46,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:08:46,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:08:46,932 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:08:46,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:08:46,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:08:46,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:08:46,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:08:46,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:08:46,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:08:46,933 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:08:46,933 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:08:46,933 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:08:46,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:08:46,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:08:46,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:08:46,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:08:46,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:08:46,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:46,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:08:46,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:08:46,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:08:46,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:08:46,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:08:46,936 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:08:46,936 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:08:46,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:08:46,936 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:08:46,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:08:46,937 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:08:46,937 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 20:08:47,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:08:47,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:08:47,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:08:47,160 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:08:47,160 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:08:47,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c [2022-01-10 20:08:47,211 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9920b8027/2a8f0b888dec445583c754ed8559c818/FLAG6979306c5 [2022-01-10 20:08:47,577 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:08:47,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c [2022-01-10 20:08:47,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9920b8027/2a8f0b888dec445583c754ed8559c818/FLAG6979306c5 [2022-01-10 20:08:47,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9920b8027/2a8f0b888dec445583c754ed8559c818 [2022-01-10 20:08:47,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:08:47,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:08:47,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:47,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:08:47,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:08:47,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:47" (1/1) ... [2022-01-10 20:08:47,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8e1674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:47, skipping insertion in model container [2022-01-10 20:08:47,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:47" (1/1) ... [2022-01-10 20:08:47,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:08:47,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:08:47,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-01-10 20:08:47,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:47,932 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:08:47,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-01-10 20:08:47,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:48,004 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:08:48,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48 WrapperNode [2022-01-10 20:08:48,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:48,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:48,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:08:48,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:08:48,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,062 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 481 [2022-01-10 20:08:48,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:48,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:08:48,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:08:48,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:08:48,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:08:48,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:08:48,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:08:48,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:08:48,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:48,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:08:48,136 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 20:08:48,141 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 20:08:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:08:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:08:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:08:48,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:08:48,257 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:08:48,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:08:48,274 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 20:08:48,688 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-10 20:08:48,688 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-10 20:08:48,689 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:08:48,698 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:08:48,698 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 20:08:48,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:48 BoogieIcfgContainer [2022-01-10 20:08:48,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:08:48,701 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:08:48,701 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:08:48,702 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:08:48,703 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:48 BasicIcfg [2022-01-10 20:08:48,824 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:08:48,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:08:48,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:08:48,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:08:48,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:08:47" (1/4) ... [2022-01-10 20:08:48,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193e2c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:48, skipping insertion in model container [2022-01-10 20:08:48,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (2/4) ... [2022-01-10 20:08:48,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193e2c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:48, skipping insertion in model container [2022-01-10 20:08:48,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:48" (3/4) ... [2022-01-10 20:08:48,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193e2c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:08:48, skipping insertion in model container [2022-01-10 20:08:48,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:48" (4/4) ... [2022-01-10 20:08:48,833 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.cTransformedIcfg [2022-01-10 20:08:48,836 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:08:48,836 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 20:08:48,875 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:08:48,879 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 20:08:48,879 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 20:08:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:08:48,897 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:48,898 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:48,898 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash -956265968, now seen corresponding path program 1 times [2022-01-10 20:08:48,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:48,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786039456] [2022-01-10 20:08:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:48,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:49,090 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 20:08:49,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:49,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786039456] [2022-01-10 20:08:49,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786039456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:49,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:49,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:49,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914997882] [2022-01-10 20:08:49,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:49,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:49,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:49,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:49,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:49,115 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:49,215 INFO L93 Difference]: Finished difference Result 401 states and 687 transitions. [2022-01-10 20:08:49,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:49,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 20:08:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:49,225 INFO L225 Difference]: With dead ends: 401 [2022-01-10 20:08:49,225 INFO L226 Difference]: Without dead ends: 241 [2022-01-10 20:08:49,227 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 20:08:49,230 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 184 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:49,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 442 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-01-10 20:08:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-01-10 20:08:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.5416666666666667) internal successors, (370), 240 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 370 transitions. [2022-01-10 20:08:49,277 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 370 transitions. Word has length 44 [2022-01-10 20:08:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:49,280 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 370 transitions. [2022-01-10 20:08:49,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 370 transitions. [2022-01-10 20:08:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 20:08:49,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:49,283 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:49,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:08:49,283 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:49,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash -586427778, now seen corresponding path program 1 times [2022-01-10 20:08:49,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:49,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335633480] [2022-01-10 20:08:49,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:49,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:49,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:49,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335633480] [2022-01-10 20:08:49,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335633480] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:49,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:49,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:49,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738080306] [2022-01-10 20:08:49,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:49,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:49,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:49,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:49,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:49,390 INFO L87 Difference]: Start difference. First operand 241 states and 370 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:49,579 INFO L93 Difference]: Finished difference Result 388 states and 602 transitions. [2022-01-10 20:08:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:49,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-10 20:08:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:49,584 INFO L225 Difference]: With dead ends: 388 [2022-01-10 20:08:49,584 INFO L226 Difference]: Without dead ends: 270 [2022-01-10 20:08:49,585 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 20:08:49,586 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:49,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 306 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:08:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-01-10 20:08:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2022-01-10 20:08:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 396 transitions. [2022-01-10 20:08:49,599 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 396 transitions. Word has length 60 [2022-01-10 20:08:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:49,599 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 396 transitions. [2022-01-10 20:08:49,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 396 transitions. [2022-01-10 20:08:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 20:08:49,602 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:49,602 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:49,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:08:49,602 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:49,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1572470231, now seen corresponding path program 1 times [2022-01-10 20:08:49,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:49,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404100604] [2022-01-10 20:08:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:49,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 20:08:49,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:49,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404100604] [2022-01-10 20:08:49,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404100604] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:49,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:49,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:49,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880154431] [2022-01-10 20:08:49,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:49,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:49,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:49,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:49,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:49,698 INFO L87 Difference]: Start difference. First operand 262 states and 396 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:49,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:49,856 INFO L93 Difference]: Finished difference Result 608 states and 945 transitions. [2022-01-10 20:08:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:49,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-01-10 20:08:49,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:49,860 INFO L225 Difference]: With dead ends: 608 [2022-01-10 20:08:49,860 INFO L226 Difference]: Without dead ends: 354 [2022-01-10 20:08:49,862 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 20:08:49,863 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:49,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 307 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-01-10 20:08:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 346. [2022-01-10 20:08:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.4202898550724639) internal successors, (490), 345 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 490 transitions. [2022-01-10 20:08:49,876 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 490 transitions. Word has length 81 [2022-01-10 20:08:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:49,877 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 490 transitions. [2022-01-10 20:08:49,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 490 transitions. [2022-01-10 20:08:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 20:08:49,879 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:49,880 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:49,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:08:49,880 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1696543478, now seen corresponding path program 1 times [2022-01-10 20:08:49,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:49,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815250239] [2022-01-10 20:08:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:49,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 20:08:49,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:49,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815250239] [2022-01-10 20:08:49,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815250239] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:49,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:49,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:49,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920314478] [2022-01-10 20:08:49,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:49,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:49,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:49,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:49,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:49,972 INFO L87 Difference]: Start difference. First operand 346 states and 490 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:50,097 INFO L93 Difference]: Finished difference Result 736 states and 1060 transitions. [2022-01-10 20:08:50,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:50,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-01-10 20:08:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:50,101 INFO L225 Difference]: With dead ends: 736 [2022-01-10 20:08:50,101 INFO L226 Difference]: Without dead ends: 398 [2022-01-10 20:08:50,102 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 20:08:50,111 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:50,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 307 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-01-10 20:08:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 392. [2022-01-10 20:08:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.3964194373401535) internal successors, (546), 391 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 546 transitions. [2022-01-10 20:08:50,126 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 546 transitions. Word has length 81 [2022-01-10 20:08:50,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:50,126 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 546 transitions. [2022-01-10 20:08:50,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 546 transitions. [2022-01-10 20:08:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 20:08:50,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:50,129 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:50,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:08:50,130 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:50,130 INFO L85 PathProgramCache]: Analyzing trace with hash 495869645, now seen corresponding path program 1 times [2022-01-10 20:08:50,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:50,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447974522] [2022-01-10 20:08:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:50,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 20:08:50,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:50,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447974522] [2022-01-10 20:08:50,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447974522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:50,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:50,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:50,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340657277] [2022-01-10 20:08:50,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:50,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:50,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:50,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:50,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:50,190 INFO L87 Difference]: Start difference. First operand 392 states and 546 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:50,300 INFO L93 Difference]: Finished difference Result 850 states and 1212 transitions. [2022-01-10 20:08:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:50,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 101 [2022-01-10 20:08:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:50,302 INFO L225 Difference]: With dead ends: 850 [2022-01-10 20:08:50,302 INFO L226 Difference]: Without dead ends: 466 [2022-01-10 20:08:50,303 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 20:08:50,303 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 28 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:50,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 306 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:50,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-01-10 20:08:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 442. [2022-01-10 20:08:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.3741496598639455) internal successors, (606), 441 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 606 transitions. [2022-01-10 20:08:50,313 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 606 transitions. Word has length 101 [2022-01-10 20:08:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:50,313 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 606 transitions. [2022-01-10 20:08:50,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 606 transitions. [2022-01-10 20:08:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 20:08:50,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:50,316 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:50,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:08:50,316 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:50,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:50,317 INFO L85 PathProgramCache]: Analyzing trace with hash -194084923, now seen corresponding path program 1 times [2022-01-10 20:08:50,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:50,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242109888] [2022-01-10 20:08:50,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:50,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 20:08:50,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:50,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242109888] [2022-01-10 20:08:50,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242109888] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:50,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:50,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:50,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313712702] [2022-01-10 20:08:50,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:50,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:50,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:50,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:50,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:50,388 INFO L87 Difference]: Start difference. First operand 442 states and 606 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:50,419 INFO L93 Difference]: Finished difference Result 671 states and 920 transitions. [2022-01-10 20:08:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:50,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 121 [2022-01-10 20:08:50,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:50,422 INFO L225 Difference]: With dead ends: 671 [2022-01-10 20:08:50,422 INFO L226 Difference]: Without dead ends: 669 [2022-01-10 20:08:50,422 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 20:08:50,423 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 146 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:50,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 357 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-01-10 20:08:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2022-01-10 20:08:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 1.372754491017964) internal successors, (917), 668 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 917 transitions. [2022-01-10 20:08:50,438 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 917 transitions. Word has length 121 [2022-01-10 20:08:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:50,438 INFO L470 AbstractCegarLoop]: Abstraction has 669 states and 917 transitions. [2022-01-10 20:08:50,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 917 transitions. [2022-01-10 20:08:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 20:08:50,440 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:50,440 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:50,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:08:50,440 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:50,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:50,441 INFO L85 PathProgramCache]: Analyzing trace with hash -451237969, now seen corresponding path program 1 times [2022-01-10 20:08:50,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:50,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385737203] [2022-01-10 20:08:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:50,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 20:08:50,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:50,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385737203] [2022-01-10 20:08:50,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385737203] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:50,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:50,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:50,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313874171] [2022-01-10 20:08:50,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:50,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:50,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:50,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:50,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:50,524 INFO L87 Difference]: Start difference. First operand 669 states and 917 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:50,651 INFO L93 Difference]: Finished difference Result 1486 states and 2101 transitions. [2022-01-10 20:08:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:50,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-01-10 20:08:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:50,654 INFO L225 Difference]: With dead ends: 1486 [2022-01-10 20:08:50,654 INFO L226 Difference]: Without dead ends: 825 [2022-01-10 20:08:50,655 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 20:08:50,656 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 31 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:50,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 296 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2022-01-10 20:08:50,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 792. [2022-01-10 20:08:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 1.345132743362832) internal successors, (1064), 791 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1064 transitions. [2022-01-10 20:08:50,675 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1064 transitions. Word has length 159 [2022-01-10 20:08:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:50,675 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 1064 transitions. [2022-01-10 20:08:50,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1064 transitions. [2022-01-10 20:08:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:08:50,678 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:50,679 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:50,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:08:50,680 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash 663151586, now seen corresponding path program 1 times [2022-01-10 20:08:50,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:50,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096459945] [2022-01-10 20:08:50,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:50,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-01-10 20:08:50,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:50,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096459945] [2022-01-10 20:08:50,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096459945] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:50,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:50,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:50,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411863952] [2022-01-10 20:08:50,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:50,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:50,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:50,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:50,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:50,768 INFO L87 Difference]: Start difference. First operand 792 states and 1064 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:50,886 INFO L93 Difference]: Finished difference Result 1678 states and 2302 transitions. [2022-01-10 20:08:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:50,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 165 [2022-01-10 20:08:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:50,890 INFO L225 Difference]: With dead ends: 1678 [2022-01-10 20:08:50,890 INFO L226 Difference]: Without dead ends: 894 [2022-01-10 20:08:50,892 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 20:08:50,893 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 17 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:50,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 306 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2022-01-10 20:08:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 873. [2022-01-10 20:08:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.3302752293577982) internal successors, (1160), 872 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1160 transitions. [2022-01-10 20:08:50,920 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1160 transitions. Word has length 165 [2022-01-10 20:08:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:50,920 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 1160 transitions. [2022-01-10 20:08:50,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1160 transitions. [2022-01-10 20:08:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-10 20:08:50,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:50,924 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:50,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:08:50,924 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1517385311, now seen corresponding path program 1 times [2022-01-10 20:08:50,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:50,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560383362] [2022-01-10 20:08:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:50,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-01-10 20:08:50,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:50,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560383362] [2022-01-10 20:08:50,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560383362] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:50,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:50,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:50,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970301218] [2022-01-10 20:08:50,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:50,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:50,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:50,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:50,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:50,981 INFO L87 Difference]: Start difference. First operand 873 states and 1160 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:51,113 INFO L93 Difference]: Finished difference Result 1908 states and 2602 transitions. [2022-01-10 20:08:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2022-01-10 20:08:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:51,117 INFO L225 Difference]: With dead ends: 1908 [2022-01-10 20:08:51,117 INFO L226 Difference]: Without dead ends: 1040 [2022-01-10 20:08:51,118 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 20:08:51,120 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 159 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:51,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 156 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2022-01-10 20:08:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1023. [2022-01-10 20:08:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 1.3786692759295498) internal successors, (1409), 1022 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1409 transitions. [2022-01-10 20:08:51,140 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1409 transitions. Word has length 172 [2022-01-10 20:08:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:51,140 INFO L470 AbstractCegarLoop]: Abstraction has 1023 states and 1409 transitions. [2022-01-10 20:08:51,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1409 transitions. [2022-01-10 20:08:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-10 20:08:51,145 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:51,145 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:51,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:08:51,145 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash 729098443, now seen corresponding path program 1 times [2022-01-10 20:08:51,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:51,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006484633] [2022-01-10 20:08:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:51,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-01-10 20:08:51,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:51,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006484633] [2022-01-10 20:08:51,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006484633] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:51,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:51,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:51,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161583985] [2022-01-10 20:08:51,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:51,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:51,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:51,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:51,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:51,227 INFO L87 Difference]: Start difference. First operand 1023 states and 1409 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:51,338 INFO L93 Difference]: Finished difference Result 2131 states and 2965 transitions. [2022-01-10 20:08:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2022-01-10 20:08:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:51,342 INFO L225 Difference]: With dead ends: 2131 [2022-01-10 20:08:51,342 INFO L226 Difference]: Without dead ends: 1116 [2022-01-10 20:08:51,344 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 20:08:51,344 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:51,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 306 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-01-10 20:08:51,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1110. [2022-01-10 20:08:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 1.3624887285843101) internal successors, (1511), 1109 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1511 transitions. [2022-01-10 20:08:51,366 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1511 transitions. Word has length 188 [2022-01-10 20:08:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:51,367 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1511 transitions. [2022-01-10 20:08:51,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1511 transitions. [2022-01-10 20:08:51,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-01-10 20:08:51,369 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:51,369 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:51,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:08:51,370 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:51,371 INFO L85 PathProgramCache]: Analyzing trace with hash -474677764, now seen corresponding path program 1 times [2022-01-10 20:08:51,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:51,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845452634] [2022-01-10 20:08:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:51,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-01-10 20:08:51,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:51,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845452634] [2022-01-10 20:08:51,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845452634] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:51,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:51,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:51,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570683101] [2022-01-10 20:08:51,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:51,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:51,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:51,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:51,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:51,426 INFO L87 Difference]: Start difference. First operand 1110 states and 1511 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:51,536 INFO L93 Difference]: Finished difference Result 2305 states and 3175 transitions. [2022-01-10 20:08:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:51,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 192 [2022-01-10 20:08:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:51,540 INFO L225 Difference]: With dead ends: 2305 [2022-01-10 20:08:51,542 INFO L226 Difference]: Without dead ends: 1203 [2022-01-10 20:08:51,543 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 20:08:51,545 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:51,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 287 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2022-01-10 20:08:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2022-01-10 20:08:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 1202 states have (on average 1.3469217970049916) internal successors, (1619), 1202 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1619 transitions. [2022-01-10 20:08:51,568 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1619 transitions. Word has length 192 [2022-01-10 20:08:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:51,568 INFO L470 AbstractCegarLoop]: Abstraction has 1203 states and 1619 transitions. [2022-01-10 20:08:51,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1619 transitions. [2022-01-10 20:08:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-01-10 20:08:51,570 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:51,571 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:51,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:08:51,571 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:51,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:51,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2065757419, now seen corresponding path program 1 times [2022-01-10 20:08:51,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:51,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387755639] [2022-01-10 20:08:51,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:51,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 320 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 20:08:51,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:51,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387755639] [2022-01-10 20:08:51,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387755639] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:08:51,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388965068] [2022-01-10 20:08:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:51,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:08:51,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:08:51,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:08:51,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 20:08:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:51,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 20:08:51,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:08:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-01-10 20:08:52,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 20:08:52,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388965068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:52,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 20:08:52,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 20:08:52,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363064209] [2022-01-10 20:08:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:52,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:52,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:52,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:52,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:08:52,290 INFO L87 Difference]: Start difference. First operand 1203 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:52,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:52,327 INFO L93 Difference]: Finished difference Result 2420 states and 3257 transitions. [2022-01-10 20:08:52,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:52,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2022-01-10 20:08:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:52,332 INFO L225 Difference]: With dead ends: 2420 [2022-01-10 20:08:52,332 INFO L226 Difference]: Without dead ends: 1608 [2022-01-10 20:08:52,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:08:52,334 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 129 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:52,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 358 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:52,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2022-01-10 20:08:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2022-01-10 20:08:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.3459863098942129) internal successors, (2163), 1607 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2163 transitions. [2022-01-10 20:08:52,366 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2163 transitions. Word has length 221 [2022-01-10 20:08:52,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:52,367 INFO L470 AbstractCegarLoop]: Abstraction has 1608 states and 2163 transitions. [2022-01-10 20:08:52,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2163 transitions. [2022-01-10 20:08:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-01-10 20:08:52,370 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:52,370 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:52,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 20:08:52,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-10 20:08:52,584 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash -225716661, now seen corresponding path program 1 times [2022-01-10 20:08:52,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:52,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748430202] [2022-01-10 20:08:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:52,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-01-10 20:08:52,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:52,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748430202] [2022-01-10 20:08:52,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748430202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:52,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:52,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:52,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794946983] [2022-01-10 20:08:52,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:52,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:52,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:52,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:52,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:52,649 INFO L87 Difference]: Start difference. First operand 1608 states and 2163 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:52,774 INFO L93 Difference]: Finished difference Result 3376 states and 4618 transitions. [2022-01-10 20:08:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:52,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2022-01-10 20:08:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:52,779 INFO L225 Difference]: With dead ends: 3376 [2022-01-10 20:08:52,779 INFO L226 Difference]: Without dead ends: 1600 [2022-01-10 20:08:52,781 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 20:08:52,783 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:52,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 306 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-01-10 20:08:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1600. [2022-01-10 20:08:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1599 states have (on average 1.3402126328955597) internal successors, (2143), 1599 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2143 transitions. [2022-01-10 20:08:52,818 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2143 transitions. Word has length 231 [2022-01-10 20:08:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:52,818 INFO L470 AbstractCegarLoop]: Abstraction has 1600 states and 2143 transitions. [2022-01-10 20:08:52,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2143 transitions. [2022-01-10 20:08:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-01-10 20:08:52,823 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:52,823 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:52,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:08:52,824 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1794200295, now seen corresponding path program 1 times [2022-01-10 20:08:52,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:52,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413019344] [2022-01-10 20:08:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:52,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-01-10 20:08:52,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:52,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413019344] [2022-01-10 20:08:52,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413019344] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:52,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:52,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:52,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218374712] [2022-01-10 20:08:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:52,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:52,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:52,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:52,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:52,910 INFO L87 Difference]: Start difference. First operand 1600 states and 2143 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:52,962 INFO L93 Difference]: Finished difference Result 4680 states and 6281 transitions. [2022-01-10 20:08:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:52,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 271 [2022-01-10 20:08:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:52,968 INFO L225 Difference]: With dead ends: 4680 [2022-01-10 20:08:52,968 INFO L226 Difference]: Without dead ends: 1972 [2022-01-10 20:08:52,971 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 20:08:52,972 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 117 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:52,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 548 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2022-01-10 20:08:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1970. [2022-01-10 20:08:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1969 states have (on average 1.336211274758761) internal successors, (2631), 1969 states have internal predecessors, (2631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2631 transitions. [2022-01-10 20:08:53,021 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2631 transitions. Word has length 271 [2022-01-10 20:08:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:53,021 INFO L470 AbstractCegarLoop]: Abstraction has 1970 states and 2631 transitions. [2022-01-10 20:08:53,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2631 transitions. [2022-01-10 20:08:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2022-01-10 20:08:53,025 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:53,025 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:53,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:08:53,026 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:53,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:53,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1715404476, now seen corresponding path program 1 times [2022-01-10 20:08:53,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:53,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520861862] [2022-01-10 20:08:53,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:53,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-01-10 20:08:53,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:53,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520861862] [2022-01-10 20:08:53,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520861862] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:08:53,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524205123] [2022-01-10 20:08:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:53,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:08:53,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:08:53,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:08:53,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 20:08:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:53,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 1412 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 20:08:53,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:08:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-01-10 20:08:53,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:08:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-01-10 20:08:54,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524205123] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:08:54,159 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:08:54,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 20:08:54,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714350499] [2022-01-10 20:08:54,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:08:54,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:54,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:54,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:54,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:54,162 INFO L87 Difference]: Start difference. First operand 1970 states and 2631 transitions. Second operand has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:54,642 INFO L93 Difference]: Finished difference Result 5086 states and 6904 transitions. [2022-01-10 20:08:54,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 20:08:54,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 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 373 [2022-01-10 20:08:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:54,650 INFO L225 Difference]: With dead ends: 5086 [2022-01-10 20:08:54,651 INFO L226 Difference]: Without dead ends: 2968 [2022-01-10 20:08:54,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:08:54,656 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 699 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:54,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [699 Valid, 582 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 20:08:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2022-01-10 20:08:54,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2121. [2022-01-10 20:08:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2120 states have (on average 1.3396226415094339) internal successors, (2840), 2120 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2840 transitions. [2022-01-10 20:08:54,704 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2840 transitions. Word has length 373 [2022-01-10 20:08:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:54,705 INFO L470 AbstractCegarLoop]: Abstraction has 2121 states and 2840 transitions. [2022-01-10 20:08:54,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2840 transitions. [2022-01-10 20:08:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2022-01-10 20:08:54,710 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:54,710 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:54,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 20:08:54,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-10 20:08:54,927 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash 294002886, now seen corresponding path program 1 times [2022-01-10 20:08:54,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:54,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697246767] [2022-01-10 20:08:54,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:54,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2022-01-10 20:08:55,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:55,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697246767] [2022-01-10 20:08:55,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697246767] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:55,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:55,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:55,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334484303] [2022-01-10 20:08:55,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:55,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:55,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:55,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:55,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:55,022 INFO L87 Difference]: Start difference. First operand 2121 states and 2840 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:55,172 INFO L93 Difference]: Finished difference Result 4486 states and 6102 transitions. [2022-01-10 20:08:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:55,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 473 [2022-01-10 20:08:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:55,179 INFO L225 Difference]: With dead ends: 4486 [2022-01-10 20:08:55,179 INFO L226 Difference]: Without dead ends: 2373 [2022-01-10 20:08:55,182 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 20:08:55,182 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:55,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 303 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2022-01-10 20:08:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2359. [2022-01-10 20:08:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2358 states have (on average 1.320186598812553) internal successors, (3113), 2358 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 3113 transitions. [2022-01-10 20:08:55,231 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 3113 transitions. Word has length 473 [2022-01-10 20:08:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:55,231 INFO L470 AbstractCegarLoop]: Abstraction has 2359 states and 3113 transitions. [2022-01-10 20:08:55,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 3113 transitions. [2022-01-10 20:08:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2022-01-10 20:08:55,238 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:55,238 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:55,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 20:08:55,238 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:55,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:55,240 INFO L85 PathProgramCache]: Analyzing trace with hash 428871662, now seen corresponding path program 1 times [2022-01-10 20:08:55,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:55,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394900028] [2022-01-10 20:08:55,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:55,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 1761 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2022-01-10 20:08:55,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:55,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394900028] [2022-01-10 20:08:55,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394900028] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:55,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:55,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:55,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039871812] [2022-01-10 20:08:55,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:55,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:55,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:55,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:55,320 INFO L87 Difference]: Start difference. First operand 2359 states and 3113 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:55,463 INFO L93 Difference]: Finished difference Result 4976 states and 6676 transitions. [2022-01-10 20:08:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:55,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 535 [2022-01-10 20:08:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:55,470 INFO L225 Difference]: With dead ends: 4976 [2022-01-10 20:08:55,471 INFO L226 Difference]: Without dead ends: 2625 [2022-01-10 20:08:55,474 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 20:08:55,474 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:55,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 303 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:55,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2022-01-10 20:08:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2611. [2022-01-10 20:08:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2610 states have (on average 1.3026819923371646) internal successors, (3400), 2610 states have internal predecessors, (3400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3400 transitions. [2022-01-10 20:08:55,539 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3400 transitions. Word has length 535 [2022-01-10 20:08:55,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:55,540 INFO L470 AbstractCegarLoop]: Abstraction has 2611 states and 3400 transitions. [2022-01-10 20:08:55,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3400 transitions. [2022-01-10 20:08:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2022-01-10 20:08:55,548 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:55,549 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:55,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:08:55,549 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:55,549 INFO L85 PathProgramCache]: Analyzing trace with hash -573957306, now seen corresponding path program 1 times [2022-01-10 20:08:55,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:55,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708907897] [2022-01-10 20:08:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:55,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-10 20:08:55,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:55,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708907897] [2022-01-10 20:08:55,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708907897] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:08:55,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433527630] [2022-01-10 20:08:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:55,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:08:55,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:08:55,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:08:55,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 20:08:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:55,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 2204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 20:08:55,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:08:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-10 20:08:56,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:08:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-10 20:08:57,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433527630] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:08:57,309 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:08:57,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 20:08:57,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59262469] [2022-01-10 20:08:57,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:08:57,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:57,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:57,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:57,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:57,310 INFO L87 Difference]: Start difference. First operand 2611 states and 3400 transitions. Second operand has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:57,637 INFO L93 Difference]: Finished difference Result 4465 states and 5875 transitions. [2022-01-10 20:08:57,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:08:57,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 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 601 [2022-01-10 20:08:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:57,639 INFO L225 Difference]: With dead ends: 4465 [2022-01-10 20:08:57,639 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 20:08:57,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1210 GetRequests, 1203 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:08:57,643 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 210 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:57,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 768 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 20:08:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 20:08:57,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 20:08:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 20:08:57,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 601 [2022-01-10 20:08:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:57,644 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 20:08:57,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 20:08:57,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 20:08:57,647 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 20:08:57,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 20:08:57,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-10 20:08:57,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 20:08:59,488 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 20:08:59,488 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 20:08:59,488 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-01-10 20:08:59,488 INFO L858 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-01-10 20:08:59,488 INFO L858 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-01-10 20:08:59,489 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-01-10 20:08:59,489 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-01-10 20:08:59,489 INFO L858 garLoopResultBuilder]: For program point L93-1(lines 75 687) no Hoare annotation was computed. [2022-01-10 20:08:59,489 INFO L861 garLoopResultBuilder]: At program point L685(lines 75 687) the Hoare annotation is: true [2022-01-10 20:08:59,489 INFO L854 garLoopResultBuilder]: At program point L109-2(lines 109 669) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) .cse1 .cse0) (and .cse1 .cse0 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) .cse1 .cse2 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) (and .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) [2022-01-10 20:08:59,489 INFO L861 garLoopResultBuilder]: At program point L686(lines 20 688) the Hoare annotation is: true [2022-01-10 20:08:59,489 INFO L861 garLoopResultBuilder]: At program point L670(lines 108 671) the Hoare annotation is: true [2022-01-10 20:08:59,489 INFO L858 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-01-10 20:08:59,489 INFO L861 garLoopResultBuilder]: At program point L698(lines 689 700) the Hoare annotation is: true [2022-01-10 20:08:59,490 INFO L858 garLoopResultBuilder]: For program point L674(lines 674 678) no Hoare annotation was computed. [2022-01-10 20:08:59,490 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 638) no Hoare annotation was computed. [2022-01-10 20:08:59,490 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 20:08:59,490 INFO L858 garLoopResultBuilder]: For program point L674-2(lines 674 678) no Hoare annotation was computed. [2022-01-10 20:08:59,490 INFO L854 garLoopResultBuilder]: At program point L113(lines 112 638) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3) .cse0) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 20:08:59,490 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 637) no Hoare annotation was computed. [2022-01-10 20:08:59,490 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 20:08:59,490 INFO L854 garLoopResultBuilder]: At program point L222(lines 115 637) the Hoare annotation is: (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) [2022-01-10 20:08:59,490 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 636) no Hoare annotation was computed. [2022-01-10 20:08:59,490 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2022-01-10 20:08:59,490 INFO L858 garLoopResultBuilder]: For program point L121(lines 121 635) no Hoare annotation was computed. [2022-01-10 20:08:59,490 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 20:08:59,490 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 634) no Hoare annotation was computed. [2022-01-10 20:08:59,491 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 250) no Hoare annotation was computed. [2022-01-10 20:08:59,491 INFO L858 garLoopResultBuilder]: For program point L127(lines 127 633) no Hoare annotation was computed. [2022-01-10 20:08:59,491 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2022-01-10 20:08:59,491 INFO L858 garLoopResultBuilder]: For program point L239-2(lines 239 250) no Hoare annotation was computed. [2022-01-10 20:08:59,491 INFO L854 garLoopResultBuilder]: At program point L131(lines 127 633) the Hoare annotation is: (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 20:08:59,491 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 632) no Hoare annotation was computed. [2022-01-10 20:08:59,491 INFO L858 garLoopResultBuilder]: For program point L252(lines 252 257) no Hoare annotation was computed. [2022-01-10 20:08:59,491 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2022-01-10 20:08:59,491 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 631) no Hoare annotation was computed. [2022-01-10 20:08:59,491 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 272) no Hoare annotation was computed. [2022-01-10 20:08:59,491 INFO L854 garLoopResultBuilder]: At program point L601(lines 109 669) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) .cse1 .cse0) (and .cse1 .cse0 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) .cse1 .cse2 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) (and .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) [2022-01-10 20:08:59,491 INFO L854 garLoopResultBuilder]: At program point L134(lines 133 631) the Hoare annotation is: (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) [2022-01-10 20:08:59,491 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 630) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L261(lines 261 266) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L640(lines 640 664) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L639(lines 639 667) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L854 garLoopResultBuilder]: At program point L143(lines 136 630) the Hoare annotation is: (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 629) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L641(lines 641 650) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 628) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L643(lines 643 647) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L641-2(lines 640 662) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L295-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L145(lines 145 627) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L858 garLoopResultBuilder]: For program point L652(lines 652 658) no Hoare annotation was computed. [2022-01-10 20:08:59,492 INFO L854 garLoopResultBuilder]: At program point L149(lines 145 627) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 626) no Hoare annotation was computed. [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L151(lines 151 625) no Hoare annotation was computed. [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L312-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 20:08:59,493 INFO L854 garLoopResultBuilder]: At program point L155(lines 151 625) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 624) no Hoare annotation was computed. [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L331-1(lines 331 340) no Hoare annotation was computed. [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 623) no Hoare annotation was computed. [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2022-01-10 20:08:59,493 INFO L854 garLoopResultBuilder]: At program point L161(lines 157 623) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 622) no Hoare annotation was computed. [2022-01-10 20:08:59,493 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-01-10 20:08:59,494 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 621) no Hoare annotation was computed. [2022-01-10 20:08:59,494 INFO L858 garLoopResultBuilder]: For program point L347-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 20:08:59,494 INFO L854 garLoopResultBuilder]: At program point L167(lines 163 621) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 20:08:59,494 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 620) no Hoare annotation was computed. [2022-01-10 20:08:59,494 INFO L854 garLoopResultBuilder]: At program point L370(lines 352 388) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 20:08:59,494 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 387) no Hoare annotation was computed. [2022-01-10 20:08:59,494 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 426) no Hoare annotation was computed. [2022-01-10 20:08:59,494 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 619) no Hoare annotation was computed. [2022-01-10 20:08:59,494 INFO L858 garLoopResultBuilder]: For program point L372(lines 372 376) no Hoare annotation was computed. [2022-01-10 20:08:59,495 INFO L858 garLoopResultBuilder]: For program point L358(lines 358 386) no Hoare annotation was computed. [2022-01-10 20:08:59,495 INFO L858 garLoopResultBuilder]: For program point L396(lines 396 402) no Hoare annotation was computed. [2022-01-10 20:08:59,495 INFO L854 garLoopResultBuilder]: At program point L404(lines 395 426) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 20:08:59,495 INFO L854 garLoopResultBuilder]: At program point L173(lines 169 619) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 20:08:59,495 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 618) no Hoare annotation was computed. [2022-01-10 20:08:59,495 INFO L858 garLoopResultBuilder]: For program point L358-1(lines 358 386) no Hoare annotation was computed. [2022-01-10 20:08:59,495 INFO L858 garLoopResultBuilder]: For program point L359(lines 359 383) no Hoare annotation was computed. [2022-01-10 20:08:59,495 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-01-10 20:08:59,495 INFO L854 garLoopResultBuilder]: At program point L414(lines 405 425) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 20:08:59,495 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-01-10 20:08:59,495 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 617) no Hoare annotation was computed. [2022-01-10 20:08:59,495 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 382) no Hoare annotation was computed. [2022-01-10 20:08:59,495 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-01-10 20:08:59,495 INFO L854 garLoopResultBuilder]: At program point L176(lines 175 617) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse1))) [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L178(lines 178 616) no Hoare annotation was computed. [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 459) no Hoare annotation was computed. [2022-01-10 20:08:59,496 INFO L854 garLoopResultBuilder]: At program point L182(lines 178 616) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)))) [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L181(lines 181 615) no Hoare annotation was computed. [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L364-2(lines 362 380) no Hoare annotation was computed. [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L450(lines 450 455) no Hoare annotation was computed. [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L447-2(lines 447 459) no Hoare annotation was computed. [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L465(lines 465 469) no Hoare annotation was computed. [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 614) no Hoare annotation was computed. [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L470(lines 470 481) no Hoare annotation was computed. [2022-01-10 20:08:59,496 INFO L854 garLoopResultBuilder]: At program point L188(lines 184 614) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)))) [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 613) no Hoare annotation was computed. [2022-01-10 20:08:59,496 INFO L858 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 490) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 612) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L854 garLoopResultBuilder]: At program point L194(lines 190 612) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)))) [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 611) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 610) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L854 garLoopResultBuilder]: At program point L200(lines 196 610) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 609) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L508(lines 508 512) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 608) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L508-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L854 garLoopResultBuilder]: At program point L206(lines 202 608) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 607) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 606) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2022-01-10 20:08:59,497 INFO L858 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L854 garLoopResultBuilder]: At program point L212(lines 208 606) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse0 .cse1) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L211(lines 211 605) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L536-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L559(lines 559 567) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 604) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L854 garLoopResultBuilder]: At program point L563(lines 75 687) the Hoare annotation is: false [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L861 garLoopResultBuilder]: At program point L215(lines 214 604) the Hoare annotation is: true [2022-01-10 20:08:59,498 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 603) the Hoare annotation is: true [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 681) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L568(lines 568 572) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L584(lines 584 594) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L574(lines 574 578) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L587(lines 587 591) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L584-1(lines 584 594) no Hoare annotation was computed. [2022-01-10 20:08:59,498 INFO L858 garLoopResultBuilder]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2022-01-10 20:08:59,502 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:59,503 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 20:08:59,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:08:59 BasicIcfg [2022-01-10 20:08:59,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 20:08:59,569 INFO L158 Benchmark]: Toolchain (without parser) took 11949.89ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 116.6MB in the beginning and 114.9MB in the end (delta: 1.6MB). Peak memory consumption was 186.6MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,569 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 20:08:59,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.46ms. Allocated memory is still 172.0MB. Free memory was 116.3MB in the beginning and 138.7MB in the end (delta: -22.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.56ms. Allocated memory is still 172.0MB. Free memory was 138.7MB in the beginning and 136.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,570 INFO L158 Benchmark]: Boogie Preprocessor took 32.14ms. Allocated memory is still 172.0MB. Free memory was 136.1MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,570 INFO L158 Benchmark]: RCFGBuilder took 604.85ms. Allocated memory is still 172.0MB. Free memory was 134.0MB in the beginning and 107.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,570 INFO L158 Benchmark]: IcfgTransformer took 123.21ms. Allocated memory is still 172.0MB. Free memory was 107.8MB in the beginning and 96.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,570 INFO L158 Benchmark]: TraceAbstraction took 10739.92ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 95.7MB in the beginning and 114.9MB in the end (delta: -19.2MB). Peak memory consumption was 166.6MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,571 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.10ms. Allocated memory is still 172.0MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 383.46ms. Allocated memory is still 172.0MB. Free memory was 116.3MB in the beginning and 138.7MB in the end (delta: -22.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.56ms. Allocated memory is still 172.0MB. Free memory was 138.7MB in the beginning and 136.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.14ms. Allocated memory is still 172.0MB. Free memory was 136.1MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 604.85ms. Allocated memory is still 172.0MB. Free memory was 134.0MB in the beginning and 107.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * IcfgTransformer took 123.21ms. Allocated memory is still 172.0MB. Free memory was 107.8MB in the beginning and 96.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10739.92ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 95.7MB in the beginning and 114.9MB in the end (delta: -19.2MB). Peak memory consumption was 166.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 681]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 18, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1814 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1814 mSDsluCounter, 6544 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2744 mSDsCounter, 473 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2499 IncrementalHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 473 mSolverCounterUnsat, 3800 mSDtfsCounter, 2499 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2235 GetRequests, 2202 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2611occurred in iteration=17, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 1000 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 337 NumberOfFragments, 667 HoareAnnotationTreeSize, 29 FomulaSimplifications, 5020 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 29 FomulaSimplificationsInter, 3104 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 5264 NumberOfCodeBlocks, 5264 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 6215 ConstructedInterpolants, 0 QuantifiedInterpolants, 9069 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4477 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 25220/25402 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || (!(s__hit == 0bv32) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8672bv32, s__state)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8672bv32, s__state)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 0bv32) && 8448bv32 == s__state) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8448bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && 8448bv32 == s__state) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 0bv32) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state) || ~bvule32(s__state, 3bv32)) || ~bvule32(blastFlag, 0bv32)) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state) || ~bvule32(s__state, 3bv32)) || ~bvule32(blastFlag, 0bv32)) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(s__state, 8672bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 20:08:59,618 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...