/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_SUM.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:30:20,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:30:20,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:30:20,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:30:20,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:30:20,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:30:20,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:30:20,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:30:20,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:30:20,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:30:20,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:30:20,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:30:20,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:30:20,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:30:20,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:30:20,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:30:20,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:30:20,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:30:20,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:30:20,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:30:20,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:30:20,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:30:20,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:30:20,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:30:20,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:30:20,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:30:20,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:30:20,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:30:20,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:30:20,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:30:20,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:30:20,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:30:20,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:30:20,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:30:20,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:30:20,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:30:20,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:30:20,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:30:20,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:30:20,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:30:20,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:30:20,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:30:20,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:30:20,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:30:20,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:30:20,619 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:30:20,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:30:20,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:30:20,620 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:30:20,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:30:20,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:30:20,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:30:20,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:30:20,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:30:20,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:30:20,621 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:30:20,621 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:30:20,621 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:30:20,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:30:20,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:30:20,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:30:20,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:30:20,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:30:20,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:20,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:30:20,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:30:20,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:30:20,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:30:20,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:30:20,622 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:30:20,622 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:30:20,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:30:20,622 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:30:20,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:30:20,623 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:30:20,623 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 03:30:20,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:30:20,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:30:20,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:30:20,848 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:30:20,849 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:30:20,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_2.cil-1.c [2022-01-11 03:30:20,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285555af4/70bd9bdec8a04c229eabb8082ad4f5d9/FLAGd0a9d4d6d [2022-01-11 03:30:21,235 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:30:21,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_2.cil-1.c [2022-01-11 03:30:21,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285555af4/70bd9bdec8a04c229eabb8082ad4f5d9/FLAGd0a9d4d6d [2022-01-11 03:30:21,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285555af4/70bd9bdec8a04c229eabb8082ad4f5d9 [2022-01-11 03:30:21,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:30:21,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:30:21,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:21,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:30:21,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:30:21,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:21,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe76d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21, skipping insertion in model container [2022-01-11 03:30:21,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:21,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:30:21,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:30:21,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_2.cil-1.c[42877,42890] [2022-01-11 03:30:21,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:21,857 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:30:21,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_2.cil-1.c[42877,42890] [2022-01-11 03:30:21,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:21,926 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:30:21,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21 WrapperNode [2022-01-11 03:30:21,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:21,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:21,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:30:21,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:30:21,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:21,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:21,963 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 500 [2022-01-11 03:30:21,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:21,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:30:21,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:30:21,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:30:21,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:21,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:21,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:21,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:21,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:21,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:21,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:21,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:30:21,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:30:21,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:30:21,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:30:21,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21" (1/1) ... [2022-01-11 03:30:22,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:22,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:22,031 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-11 03:30:22,032 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-11 03:30:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:30:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:30:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:30:22,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:30:22,131 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:30:22,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:30:22,142 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:30:22,460 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-11 03:30:22,460 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-11 03:30:22,460 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:30:22,465 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:30:22,465 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:30:22,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:22 BoogieIcfgContainer [2022-01-11 03:30:22,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:30:22,467 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:30:22,467 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:30:22,469 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:30:22,471 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:22" (1/1) ... [2022-01-11 03:30:22,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:22 BasicIcfg [2022-01-11 03:30:22,604 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:30:22,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:30:22,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:30:22,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:30:22,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:30:21" (1/4) ... [2022-01-11 03:30:22,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efc675f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:22, skipping insertion in model container [2022-01-11 03:30:22,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:21" (2/4) ... [2022-01-11 03:30:22,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efc675f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:22, skipping insertion in model container [2022-01-11 03:30:22,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:22" (3/4) ... [2022-01-11 03:30:22,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efc675f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:22, skipping insertion in model container [2022-01-11 03:30:22,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:22" (4/4) ... [2022-01-11 03:30:22,609 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.cTransformedIcfg [2022-01-11 03:30:22,623 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:30:22,624 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:30:22,669 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:30:22,675 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-11 03:30:22,675 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:30:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 03:30:22,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:22,698 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-11 03:30:22,698 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:22,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1347902195, now seen corresponding path program 1 times [2022-01-11 03:30:22,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:22,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166319624] [2022-01-11 03:30:22,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:22,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:22,936 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-11 03:30:22,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:22,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166319624] [2022-01-11 03:30:22,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166319624] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:22,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:22,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:22,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634359541] [2022-01-11 03:30:22,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:22,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:22,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:22,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:22,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:22,967 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 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-11 03:30:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:23,052 INFO L93 Difference]: Finished difference Result 404 states and 690 transitions. [2022-01-11 03:30:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:23,056 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-11 03:30:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:23,067 INFO L225 Difference]: With dead ends: 404 [2022-01-11 03:30:23,067 INFO L226 Difference]: Without dead ends: 245 [2022-01-11 03:30:23,070 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-11 03:30:23,073 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 186 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:23,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 447 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-01-11 03:30:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-01-11 03:30:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.528688524590164) internal successors, (373), 244 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 373 transitions. [2022-01-11 03:30:23,127 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 373 transitions. Word has length 44 [2022-01-11 03:30:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:23,128 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 373 transitions. [2022-01-11 03:30:23,128 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-11 03:30:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 373 transitions. [2022-01-11 03:30:23,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 03:30:23,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:23,133 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-11 03:30:23,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:30:23,133 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:23,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:23,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1733675330, now seen corresponding path program 1 times [2022-01-11 03:30:23,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:23,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92860536] [2022-01-11 03:30:23,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:23,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:23,242 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-11 03:30:23,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:23,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92860536] [2022-01-11 03:30:23,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92860536] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:23,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:23,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:23,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277964121] [2022-01-11 03:30:23,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:23,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:23,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:23,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:23,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:23,245 INFO L87 Difference]: Start difference. First operand 245 states and 373 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-11 03:30:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:23,392 INFO L93 Difference]: Finished difference Result 396 states and 609 transitions. [2022-01-11 03:30:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:23,393 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-11 03:30:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:23,396 INFO L225 Difference]: With dead ends: 396 [2022-01-11 03:30:23,396 INFO L226 Difference]: Without dead ends: 276 [2022-01-11 03:30:23,403 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-11 03:30:23,404 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 15 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:23,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 308 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-01-11 03:30:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 266. [2022-01-11 03:30:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.5056603773584907) internal successors, (399), 265 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 399 transitions. [2022-01-11 03:30:23,418 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 399 transitions. Word has length 60 [2022-01-11 03:30:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:23,418 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 399 transitions. [2022-01-11 03:30:23,419 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-11 03:30:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 399 transitions. [2022-01-11 03:30:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-11 03:30:23,425 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:23,429 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-11 03:30:23,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:30:23,430 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:23,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:23,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2073192471, now seen corresponding path program 1 times [2022-01-11 03:30:23,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:23,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829082522] [2022-01-11 03:30:23,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:23,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:23,544 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-11 03:30:23,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:23,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829082522] [2022-01-11 03:30:23,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829082522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:23,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:23,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:23,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936339807] [2022-01-11 03:30:23,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:23,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:23,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:23,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:23,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:23,546 INFO L87 Difference]: Start difference. First operand 266 states and 399 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-11 03:30:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:23,697 INFO L93 Difference]: Finished difference Result 616 states and 951 transitions. [2022-01-11 03:30:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:23,697 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-11 03:30:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:23,700 INFO L225 Difference]: With dead ends: 616 [2022-01-11 03:30:23,700 INFO L226 Difference]: Without dead ends: 358 [2022-01-11 03:30:23,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:23,706 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 14 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 309 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-11 03:30:23,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 309 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:23,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-01-11 03:30:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 350. [2022-01-11 03:30:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.4126074498567336) internal successors, (493), 349 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 493 transitions. [2022-01-11 03:30:23,724 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 493 transitions. Word has length 81 [2022-01-11 03:30:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:23,724 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 493 transitions. [2022-01-11 03:30:23,725 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-11 03:30:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 493 transitions. [2022-01-11 03:30:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-11 03:30:23,727 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:23,727 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-11 03:30:23,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:30:23,728 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:23,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:23,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2097701578, now seen corresponding path program 1 times [2022-01-11 03:30:23,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:23,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110150946] [2022-01-11 03:30:23,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:23,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:23,775 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-11 03:30:23,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:23,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110150946] [2022-01-11 03:30:23,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110150946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:23,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:23,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:23,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025382393] [2022-01-11 03:30:23,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:23,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:23,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:23,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:23,777 INFO L87 Difference]: Start difference. First operand 350 states and 493 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-11 03:30:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:23,898 INFO L93 Difference]: Finished difference Result 746 states and 1068 transitions. [2022-01-11 03:30:23,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:23,898 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-11 03:30:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:23,900 INFO L225 Difference]: With dead ends: 746 [2022-01-11 03:30:23,900 INFO L226 Difference]: Without dead ends: 404 [2022-01-11 03:30:23,901 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-11 03:30:23,906 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 13 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 309 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-11 03:30:23,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 309 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-01-11 03:30:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2022-01-11 03:30:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.389873417721519) internal successors, (549), 395 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 549 transitions. [2022-01-11 03:30:23,916 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 549 transitions. Word has length 81 [2022-01-11 03:30:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:23,916 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 549 transitions. [2022-01-11 03:30:23,917 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-11 03:30:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 549 transitions. [2022-01-11 03:30:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-11 03:30:23,918 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:23,918 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:23,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:30:23,918 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash -828826748, now seen corresponding path program 1 times [2022-01-11 03:30:23,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:23,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927259904] [2022-01-11 03:30:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:23,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:23,969 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-11 03:30:23,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:23,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927259904] [2022-01-11 03:30:23,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927259904] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:23,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:23,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:23,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453123221] [2022-01-11 03:30:23,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:23,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:23,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:23,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:23,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:23,970 INFO L87 Difference]: Start difference. First operand 396 states and 549 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:24,071 INFO L93 Difference]: Finished difference Result 860 states and 1220 transitions. [2022-01-11 03:30:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:24,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-01-11 03:30:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:24,073 INFO L225 Difference]: With dead ends: 860 [2022-01-11 03:30:24,073 INFO L226 Difference]: Without dead ends: 472 [2022-01-11 03:30:24,074 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-11 03:30:24,074 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 29 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 308 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-11 03:30:24,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 308 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-01-11 03:30:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 446. [2022-01-11 03:30:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.3685393258426966) internal successors, (609), 445 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 609 transitions. [2022-01-11 03:30:24,084 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 609 transitions. Word has length 102 [2022-01-11 03:30:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:24,084 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 609 transitions. [2022-01-11 03:30:24,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 609 transitions. [2022-01-11 03:30:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 03:30:24,085 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:24,085 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-11 03:30:24,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:30:24,086 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:24,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1178035384, now seen corresponding path program 1 times [2022-01-11 03:30:24,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:24,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347757697] [2022-01-11 03:30:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:24,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:24,132 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-11 03:30:24,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:24,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347757697] [2022-01-11 03:30:24,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347757697] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:24,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:24,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:24,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658229950] [2022-01-11 03:30:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:24,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:24,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:24,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:24,133 INFO L87 Difference]: Start difference. First operand 446 states and 609 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-11 03:30:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:24,154 INFO L93 Difference]: Finished difference Result 677 states and 924 transitions. [2022-01-11 03:30:24,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:24,155 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-11 03:30:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:24,157 INFO L225 Difference]: With dead ends: 677 [2022-01-11 03:30:24,157 INFO L226 Difference]: Without dead ends: 675 [2022-01-11 03:30:24,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:24,157 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 148 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:24,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 362 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-01-11 03:30:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2022-01-11 03:30:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.367952522255193) internal successors, (922), 674 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 922 transitions. [2022-01-11 03:30:24,172 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 922 transitions. Word has length 121 [2022-01-11 03:30:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:24,172 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 922 transitions. [2022-01-11 03:30:24,172 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-11 03:30:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 922 transitions. [2022-01-11 03:30:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-11 03:30:24,173 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:24,174 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, 1] [2022-01-11 03:30:24,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:30:24,174 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:24,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2068651371, now seen corresponding path program 1 times [2022-01-11 03:30:24,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:24,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825072911] [2022-01-11 03:30:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:24,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-11 03:30:24,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:24,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825072911] [2022-01-11 03:30:24,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825072911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:24,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:24,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:24,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203593371] [2022-01-11 03:30:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:24,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:24,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:24,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:24,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:24,211 INFO L87 Difference]: Start difference. First operand 675 states and 922 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:24,225 INFO L93 Difference]: Finished difference Result 1159 states and 1580 transitions. [2022-01-11 03:30:24,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:24,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 122 [2022-01-11 03:30:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:24,228 INFO L225 Difference]: With dead ends: 1159 [2022-01-11 03:30:24,228 INFO L226 Difference]: Without dead ends: 699 [2022-01-11 03:30:24,228 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-11 03:30:24,229 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 10 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:24,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:24,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-01-11 03:30:24,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2022-01-11 03:30:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.3624641833810889) internal successors, (951), 698 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 951 transitions. [2022-01-11 03:30:24,239 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 951 transitions. Word has length 122 [2022-01-11 03:30:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:24,239 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 951 transitions. [2022-01-11 03:30:24,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 951 transitions. [2022-01-11 03:30:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-11 03:30:24,241 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:24,241 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:24,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:30:24,241 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:24,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1575384847, now seen corresponding path program 1 times [2022-01-11 03:30:24,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:24,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466688723] [2022-01-11 03:30:24,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:24,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-01-11 03:30:24,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:24,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466688723] [2022-01-11 03:30:24,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466688723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:24,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:24,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:24,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7652174] [2022-01-11 03:30:24,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:24,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:24,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:24,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:24,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:24,307 INFO L87 Difference]: Start difference. First operand 699 states and 951 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:24,432 INFO L93 Difference]: Finished difference Result 1549 states and 2172 transitions. [2022-01-11 03:30:24,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:24,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 183 [2022-01-11 03:30:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:24,434 INFO L225 Difference]: With dead ends: 1549 [2022-01-11 03:30:24,434 INFO L226 Difference]: Without dead ends: 858 [2022-01-11 03:30:24,435 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-11 03:30:24,436 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 47 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 300 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-11 03:30:24,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 300 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-01-11 03:30:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 822. [2022-01-11 03:30:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 1.3373934226552984) internal successors, (1098), 821 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1098 transitions. [2022-01-11 03:30:24,447 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1098 transitions. Word has length 183 [2022-01-11 03:30:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:24,448 INFO L470 AbstractCegarLoop]: Abstraction has 822 states and 1098 transitions. [2022-01-11 03:30:24,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1098 transitions. [2022-01-11 03:30:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-11 03:30:24,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:24,450 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:30:24,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:30:24,450 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:24,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1506024009, now seen corresponding path program 1 times [2022-01-11 03:30:24,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:24,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953620477] [2022-01-11 03:30:24,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:24,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-01-11 03:30:24,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:24,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953620477] [2022-01-11 03:30:24,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953620477] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:24,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:24,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:24,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057859321] [2022-01-11 03:30:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:24,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:24,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:24,490 INFO L87 Difference]: Start difference. First operand 822 states and 1098 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:24,607 INFO L93 Difference]: Finished difference Result 1795 states and 2466 transitions. [2022-01-11 03:30:24,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:24,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2022-01-11 03:30:24,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:24,610 INFO L225 Difference]: With dead ends: 1795 [2022-01-11 03:30:24,610 INFO L226 Difference]: Without dead ends: 981 [2022-01-11 03:30:24,611 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-11 03:30:24,611 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 71 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:24,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 280 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:24,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-01-11 03:30:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 915. [2022-01-11 03:30:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 914 states have (on average 1.3424507658643325) internal successors, (1227), 914 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1227 transitions. [2022-01-11 03:30:24,624 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1227 transitions. Word has length 190 [2022-01-11 03:30:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:24,625 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1227 transitions. [2022-01-11 03:30:24,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1227 transitions. [2022-01-11 03:30:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-11 03:30:24,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:24,627 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-11 03:30:24,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:30:24,627 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash -914050941, now seen corresponding path program 1 times [2022-01-11 03:30:24,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:24,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484992694] [2022-01-11 03:30:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:24,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-01-11 03:30:24,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:24,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484992694] [2022-01-11 03:30:24,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484992694] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:24,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:24,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:24,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422041013] [2022-01-11 03:30:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:24,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:24,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:24,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:24,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:24,674 INFO L87 Difference]: Start difference. First operand 915 states and 1227 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:24,797 INFO L93 Difference]: Finished difference Result 1992 states and 2735 transitions. [2022-01-11 03:30:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:24,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2022-01-11 03:30:24,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:24,800 INFO L225 Difference]: With dead ends: 1992 [2022-01-11 03:30:24,800 INFO L226 Difference]: Without dead ends: 1082 [2022-01-11 03:30:24,804 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-11 03:30:24,805 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 160 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 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-11 03:30:24,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 156 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2022-01-11 03:30:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1068. [2022-01-11 03:30:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1067 states have (on average 1.3776944704779757) internal successors, (1470), 1067 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1470 transitions. [2022-01-11 03:30:24,822 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1470 transitions. Word has length 196 [2022-01-11 03:30:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:24,822 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 1470 transitions. [2022-01-11 03:30:24,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1470 transitions. [2022-01-11 03:30:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-01-11 03:30:24,825 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:24,825 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:24,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:30:24,825 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:24,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:24,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1560433245, now seen corresponding path program 1 times [2022-01-11 03:30:24,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:24,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135189503] [2022-01-11 03:30:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:24,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-11 03:30:24,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:24,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135189503] [2022-01-11 03:30:24,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135189503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:24,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:24,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:24,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558347713] [2022-01-11 03:30:24,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:24,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:24,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:24,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:24,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:24,888 INFO L87 Difference]: Start difference. First operand 1068 states and 1470 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:24,983 INFO L93 Difference]: Finished difference Result 2233 states and 3066 transitions. [2022-01-11 03:30:24,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:24,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 216 [2022-01-11 03:30:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:24,987 INFO L225 Difference]: With dead ends: 2233 [2022-01-11 03:30:24,987 INFO L226 Difference]: Without dead ends: 1173 [2022-01-11 03:30:24,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:24,989 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 18 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:24,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 308 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-01-11 03:30:25,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1149. [2022-01-11 03:30:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.3641114982578397) internal successors, (1566), 1148 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1566 transitions. [2022-01-11 03:30:25,032 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1566 transitions. Word has length 216 [2022-01-11 03:30:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:25,033 INFO L470 AbstractCegarLoop]: Abstraction has 1149 states and 1566 transitions. [2022-01-11 03:30:25,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1566 transitions. [2022-01-11 03:30:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-01-11 03:30:25,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:25,035 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:25,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:30:25,035 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1848870773, now seen corresponding path program 1 times [2022-01-11 03:30:25,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:25,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229984826] [2022-01-11 03:30:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:25,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-01-11 03:30:25,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:25,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229984826] [2022-01-11 03:30:25,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229984826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:25,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:25,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:25,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951093421] [2022-01-11 03:30:25,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:25,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:25,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:25,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:25,092 INFO L87 Difference]: Start difference. First operand 1149 states and 1566 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:25,207 INFO L93 Difference]: Finished difference Result 2419 states and 3351 transitions. [2022-01-11 03:30:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:25,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 218 [2022-01-11 03:30:25,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:25,210 INFO L225 Difference]: With dead ends: 2419 [2022-01-11 03:30:25,210 INFO L226 Difference]: Without dead ends: 1245 [2022-01-11 03:30:25,212 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-11 03:30:25,212 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 48 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:25,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 289 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2022-01-11 03:30:25,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1242. [2022-01-11 03:30:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1241 states have (on average 1.3537469782433522) internal successors, (1680), 1241 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1680 transitions. [2022-01-11 03:30:25,234 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1680 transitions. Word has length 218 [2022-01-11 03:30:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:25,234 INFO L470 AbstractCegarLoop]: Abstraction has 1242 states and 1680 transitions. [2022-01-11 03:30:25,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1680 transitions. [2022-01-11 03:30:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-01-11 03:30:25,237 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:25,237 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:25,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:30:25,237 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash -265142897, now seen corresponding path program 1 times [2022-01-11 03:30:25,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:25,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147252349] [2022-01-11 03:30:25,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:25,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-01-11 03:30:25,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:25,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147252349] [2022-01-11 03:30:25,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147252349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:25,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:25,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:25,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332444114] [2022-01-11 03:30:25,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:25,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:25,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:25,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:25,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:25,289 INFO L87 Difference]: Start difference. First operand 1242 states and 1680 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:25,409 INFO L93 Difference]: Finished difference Result 2572 states and 3465 transitions. [2022-01-11 03:30:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:25,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233 [2022-01-11 03:30:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:25,413 INFO L225 Difference]: With dead ends: 2572 [2022-01-11 03:30:25,413 INFO L226 Difference]: Without dead ends: 1338 [2022-01-11 03:30:25,414 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-11 03:30:25,415 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 157 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:25,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 167 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-01-11 03:30:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1284. [2022-01-11 03:30:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 1283 states have (on average 1.3491816056118473) internal successors, (1731), 1283 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1731 transitions. [2022-01-11 03:30:25,440 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1731 transitions. Word has length 233 [2022-01-11 03:30:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:25,440 INFO L470 AbstractCegarLoop]: Abstraction has 1284 states and 1731 transitions. [2022-01-11 03:30:25,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1731 transitions. [2022-01-11 03:30:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-01-11 03:30:25,443 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:25,443 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:25,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:30:25,443 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:25,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash -119453128, now seen corresponding path program 1 times [2022-01-11 03:30:25,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:25,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545453145] [2022-01-11 03:30:25,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:25,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-01-11 03:30:25,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:25,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545453145] [2022-01-11 03:30:25,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545453145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:25,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:25,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:25,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170384654] [2022-01-11 03:30:25,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:25,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:25,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:25,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:25,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:25,503 INFO L87 Difference]: Start difference. First operand 1284 states and 1731 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:25,635 INFO L93 Difference]: Finished difference Result 2653 states and 3567 transitions. [2022-01-11 03:30:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:25,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 243 [2022-01-11 03:30:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:25,639 INFO L225 Difference]: With dead ends: 2653 [2022-01-11 03:30:25,639 INFO L226 Difference]: Without dead ends: 1377 [2022-01-11 03:30:25,640 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-11 03:30:25,640 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 10 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:25,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 308 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2022-01-11 03:30:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1371. [2022-01-11 03:30:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1370 states have (on average 1.337956204379562) internal successors, (1833), 1370 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1833 transitions. [2022-01-11 03:30:25,663 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1833 transitions. Word has length 243 [2022-01-11 03:30:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:25,663 INFO L470 AbstractCegarLoop]: Abstraction has 1371 states and 1833 transitions. [2022-01-11 03:30:25,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1833 transitions. [2022-01-11 03:30:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-01-11 03:30:25,666 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:25,666 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:25,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:30:25,666 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1823375712, now seen corresponding path program 1 times [2022-01-11 03:30:25,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:25,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712838127] [2022-01-11 03:30:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:25,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-01-11 03:30:25,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:25,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712838127] [2022-01-11 03:30:25,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712838127] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:25,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180046443] [2022-01-11 03:30:25,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:25,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:25,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:25,752 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-11 03:30:25,753 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-11 03:30:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-11 03:30:25,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-01-11 03:30:26,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:26,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180046443] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:26,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:26,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:26,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642528483] [2022-01-11 03:30:26,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:26,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:26,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:26,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:26,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:26,309 INFO L87 Difference]: Start difference. First operand 1371 states and 1833 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:26,339 INFO L93 Difference]: Finished difference Result 2756 states and 3685 transitions. [2022-01-11 03:30:26,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 246 [2022-01-11 03:30:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:26,344 INFO L225 Difference]: With dead ends: 2756 [2022-01-11 03:30:26,345 INFO L226 Difference]: Without dead ends: 1824 [2022-01-11 03:30:26,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 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-11 03:30:26,347 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 136 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:26,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 363 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2022-01-11 03:30:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2022-01-11 03:30:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1823 states have (on average 1.3379045529347229) internal successors, (2439), 1823 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2439 transitions. [2022-01-11 03:30:26,378 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2439 transitions. Word has length 246 [2022-01-11 03:30:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:26,378 INFO L470 AbstractCegarLoop]: Abstraction has 1824 states and 2439 transitions. [2022-01-11 03:30:26,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2439 transitions. [2022-01-11 03:30:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-11 03:30:26,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:26,381 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-11 03:30:26,401 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-11 03:30:26,584 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,SelfDestructingSolverStorable14 [2022-01-11 03:30:26,585 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:26,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:26,585 INFO L85 PathProgramCache]: Analyzing trace with hash -971368545, now seen corresponding path program 1 times [2022-01-11 03:30:26,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:26,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761165518] [2022-01-11 03:30:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:26,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-11 03:30:26,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:26,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761165518] [2022-01-11 03:30:26,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761165518] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:26,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633279453] [2022-01-11 03:30:26,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:26,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:26,659 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-11 03:30:26,660 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-11 03:30:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:26,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:26,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-11 03:30:27,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-11 03:30:27,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633279453] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:27,369 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:27,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:27,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371997853] [2022-01-11 03:30:27,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:27,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:27,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:27,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:27,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:27,370 INFO L87 Difference]: Start difference. First operand 1824 states and 2439 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:27,936 INFO L93 Difference]: Finished difference Result 7976 states and 10799 transitions. [2022-01-11 03:30:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 03:30:27,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-01-11 03:30:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:27,954 INFO L225 Difference]: With dead ends: 7976 [2022-01-11 03:30:27,954 INFO L226 Difference]: Without dead ends: 6160 [2022-01-11 03:30:27,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-11 03:30:27,959 INFO L933 BasicCegarLoop]: 569 mSDtfsCounter, 554 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:27,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 1482 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:30:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6160 states. [2022-01-11 03:30:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6160 to 3792. [2022-01-11 03:30:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 3791 states have (on average 1.339752044315484) internal successors, (5079), 3791 states have internal predecessors, (5079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 5079 transitions. [2022-01-11 03:30:28,087 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 5079 transitions. Word has length 253 [2022-01-11 03:30:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:28,087 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 5079 transitions. [2022-01-11 03:30:28,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 5079 transitions. [2022-01-11 03:30:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-11 03:30:28,094 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:28,094 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-11 03:30:28,126 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-11 03:30:28,326 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,SelfDestructingSolverStorable15 [2022-01-11 03:30:28,326 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:28,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash -826958850, now seen corresponding path program 1 times [2022-01-11 03:30:28,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:28,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906886570] [2022-01-11 03:30:28,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:28,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-01-11 03:30:28,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:28,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906886570] [2022-01-11 03:30:28,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906886570] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:28,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:28,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:28,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890779862] [2022-01-11 03:30:28,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:28,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:28,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:28,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:28,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:28,366 INFO L87 Difference]: Start difference. First operand 3792 states and 5079 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:28,444 INFO L93 Difference]: Finished difference Result 10332 states and 13869 transitions. [2022-01-11 03:30:28,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:28,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-01-11 03:30:28,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:28,461 INFO L225 Difference]: With dead ends: 10332 [2022-01-11 03:30:28,461 INFO L226 Difference]: Without dead ends: 6548 [2022-01-11 03:30:28,467 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-11 03:30:28,467 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 131 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:28,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 556 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2022-01-11 03:30:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 6546. [2022-01-11 03:30:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6546 states, 6545 states have (on average 1.3416348357524828) internal successors, (8781), 6545 states have internal predecessors, (8781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6546 states to 6546 states and 8781 transitions. [2022-01-11 03:30:28,608 INFO L78 Accepts]: Start accepts. Automaton has 6546 states and 8781 transitions. Word has length 253 [2022-01-11 03:30:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:28,608 INFO L470 AbstractCegarLoop]: Abstraction has 6546 states and 8781 transitions. [2022-01-11 03:30:28,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6546 states and 8781 transitions. [2022-01-11 03:30:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2022-01-11 03:30:28,616 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:28,616 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-11 03:30:28,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 03:30:28,616 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1340478315, now seen corresponding path program 1 times [2022-01-11 03:30:28,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:28,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188383087] [2022-01-11 03:30:28,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:28,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 447 proven. 5 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-01-11 03:30:28,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:28,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188383087] [2022-01-11 03:30:28,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188383087] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:28,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385390592] [2022-01-11 03:30:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:28,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:28,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:28,720 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-11 03:30:28,721 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-11 03:30:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:28,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-11 03:30:28,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-01-11 03:30:29,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:29,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385390592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:29,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:29,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:29,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576362941] [2022-01-11 03:30:29,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:29,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:29,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:29,132 INFO L87 Difference]: Start difference. First operand 6546 states and 8781 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:29,347 INFO L93 Difference]: Finished difference Result 12860 states and 17374 transitions. [2022-01-11 03:30:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:29,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 266 [2022-01-11 03:30:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:29,358 INFO L225 Difference]: With dead ends: 12860 [2022-01-11 03:30:29,358 INFO L226 Difference]: Without dead ends: 6138 [2022-01-11 03:30:29,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:29,365 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:29,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 249 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2022-01-11 03:30:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5886. [2022-01-11 03:30:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5886 states, 5885 states have (on average 1.314018691588785) internal successors, (7733), 5885 states have internal predecessors, (7733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5886 states to 5886 states and 7733 transitions. [2022-01-11 03:30:29,464 INFO L78 Accepts]: Start accepts. Automaton has 5886 states and 7733 transitions. Word has length 266 [2022-01-11 03:30:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:29,465 INFO L470 AbstractCegarLoop]: Abstraction has 5886 states and 7733 transitions. [2022-01-11 03:30:29,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5886 states and 7733 transitions. [2022-01-11 03:30:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-01-11 03:30:29,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:29,472 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-11 03:30:29,492 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-11 03:30:29,690 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-11 03:30:29,690 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:29,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash 825594243, now seen corresponding path program 1 times [2022-01-11 03:30:29,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:29,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041378607] [2022-01-11 03:30:29,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:29,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-01-11 03:30:29,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:29,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041378607] [2022-01-11 03:30:29,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041378607] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:29,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386434831] [2022-01-11 03:30:29,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:29,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:29,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:29,752 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 03:30:29,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-11 03:30:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:29,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-11 03:30:29,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-01-11 03:30:30,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:30,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386434831] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:30,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:30,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:30,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434499180] [2022-01-11 03:30:30,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:30,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:30,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:30,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:30,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:30,170 INFO L87 Difference]: Start difference. First operand 5886 states and 7733 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,333 INFO L93 Difference]: Finished difference Result 12400 states and 16270 transitions. [2022-01-11 03:30:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 282 [2022-01-11 03:30:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,348 INFO L225 Difference]: With dead ends: 12400 [2022-01-11 03:30:30,348 INFO L226 Difference]: Without dead ends: 6202 [2022-01-11 03:30:30,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 282 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-11 03:30:30,355 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 105 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 247 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6202 states. [2022-01-11 03:30:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6202 to 6006. [2022-01-11 03:30:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6006 states, 6005 states have (on average 1.3144046627810158) internal successors, (7893), 6005 states have internal predecessors, (7893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6006 states to 6006 states and 7893 transitions. [2022-01-11 03:30:30,506 INFO L78 Accepts]: Start accepts. Automaton has 6006 states and 7893 transitions. Word has length 282 [2022-01-11 03:30:30,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:30,507 INFO L470 AbstractCegarLoop]: Abstraction has 6006 states and 7893 transitions. [2022-01-11 03:30:30,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6006 states and 7893 transitions. [2022-01-11 03:30:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-01-11 03:30:30,515 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,515 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-11 03:30:30,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-11 03:30:30,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:30,731 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,732 INFO L85 PathProgramCache]: Analyzing trace with hash 628482673, now seen corresponding path program 1 times [2022-01-11 03:30:30,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311773112] [2022-01-11 03:30:30,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-01-11 03:30:30,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:30,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311773112] [2022-01-11 03:30:30,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311773112] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:30,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677706833] [2022-01-11 03:30:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:30,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:30,789 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 03:30:30,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-11 03:30:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:30,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2022-01-11 03:30:31,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:31,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677706833] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:31,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:31,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365671965] [2022-01-11 03:30:31,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:31,196 INFO L87 Difference]: Start difference. First operand 6006 states and 7893 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-11 03:30:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,309 INFO L93 Difference]: Finished difference Result 12184 states and 16014 transitions. [2022-01-11 03:30:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,310 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 283 [2022-01-11 03:30:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,319 INFO L225 Difference]: With dead ends: 12184 [2022-01-11 03:30:31,320 INFO L226 Difference]: Without dead ends: 6186 [2022-01-11 03:30:31,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 283 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-11 03:30:31,326 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 295 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6186 states. [2022-01-11 03:30:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6186 to 6066. [2022-01-11 03:30:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6066 states, 6065 states have (on average 1.3139323990107172) internal successors, (7969), 6065 states have internal predecessors, (7969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6066 states to 6066 states and 7969 transitions. [2022-01-11 03:30:31,420 INFO L78 Accepts]: Start accepts. Automaton has 6066 states and 7969 transitions. Word has length 283 [2022-01-11 03:30:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,420 INFO L470 AbstractCegarLoop]: Abstraction has 6066 states and 7969 transitions. [2022-01-11 03:30:31,421 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-11 03:30:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 6066 states and 7969 transitions. [2022-01-11 03:30:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-01-11 03:30:31,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,449 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-11 03:30:31,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-11 03:30:31,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:31,650 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2028639599, now seen corresponding path program 1 times [2022-01-11 03:30:31,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464821225] [2022-01-11 03:30:31,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-01-11 03:30:31,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464821225] [2022-01-11 03:30:31,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464821225] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:31,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602894975] [2022-01-11 03:30:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:31,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:31,715 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 03:30:31,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-11 03:30:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:31,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-01-11 03:30:32,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-01-11 03:30:32,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602894975] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:32,496 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:32,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:32,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184119558] [2022-01-11 03:30:32,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:32,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:32,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:32,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:32,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:32,497 INFO L87 Difference]: Start difference. First operand 6066 states and 7969 transitions. Second operand has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:32,828 INFO L93 Difference]: Finished difference Result 12987 states and 17005 transitions. [2022-01-11 03:30:32,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 03:30:32,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 283 [2022-01-11 03:30:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:32,839 INFO L225 Difference]: With dead ends: 12987 [2022-01-11 03:30:32,839 INFO L226 Difference]: Without dead ends: 6829 [2022-01-11 03:30:32,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-11 03:30:32,846 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 535 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:32,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 527 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:30:32,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6829 states. [2022-01-11 03:30:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6829 to 5903. [2022-01-11 03:30:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5903 states, 5902 states have (on average 1.2821077600813284) internal successors, (7567), 5902 states have internal predecessors, (7567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5903 states to 5903 states and 7567 transitions. [2022-01-11 03:30:32,965 INFO L78 Accepts]: Start accepts. Automaton has 5903 states and 7567 transitions. Word has length 283 [2022-01-11 03:30:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:32,965 INFO L470 AbstractCegarLoop]: Abstraction has 5903 states and 7567 transitions. [2022-01-11 03:30:32,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5903 states and 7567 transitions. [2022-01-11 03:30:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-01-11 03:30:32,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:32,973 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 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, 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] [2022-01-11 03:30:32,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-11 03:30:33,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:33,184 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -225925368, now seen corresponding path program 1 times [2022-01-11 03:30:33,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:33,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146604951] [2022-01-11 03:30:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:33,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-01-11 03:30:33,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:33,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146604951] [2022-01-11 03:30:33,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146604951] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:33,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:33,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:33,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737708937] [2022-01-11 03:30:33,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:33,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:33,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:33,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:33,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:33,239 INFO L87 Difference]: Start difference. First operand 5903 states and 7567 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:33,357 INFO L93 Difference]: Finished difference Result 9774 states and 12389 transitions. [2022-01-11 03:30:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:33,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 321 [2022-01-11 03:30:33,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:33,363 INFO L225 Difference]: With dead ends: 9774 [2022-01-11 03:30:33,363 INFO L226 Difference]: Without dead ends: 2721 [2022-01-11 03:30:33,368 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-11 03:30:33,368 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 28 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:33,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 308 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2022-01-11 03:30:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2496. [2022-01-11 03:30:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.2789579158316633) internal successors, (3191), 2495 states have internal predecessors, (3191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3191 transitions. [2022-01-11 03:30:33,403 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3191 transitions. Word has length 321 [2022-01-11 03:30:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:33,403 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 3191 transitions. [2022-01-11 03:30:33,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3191 transitions. [2022-01-11 03:30:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2022-01-11 03:30:33,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:33,407 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 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, 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-11 03:30:33,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 03:30:33,407 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1916185372, now seen corresponding path program 1 times [2022-01-11 03:30:33,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:33,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943028437] [2022-01-11 03:30:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:33,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-01-11 03:30:33,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:33,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943028437] [2022-01-11 03:30:33,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943028437] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:33,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207000998] [2022-01-11 03:30:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:33,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:33,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:33,481 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 03:30:33,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-11 03:30:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:33,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:33,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2022-01-11 03:30:34,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:34,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207000998] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:34,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:34,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:34,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662642112] [2022-01-11 03:30:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:34,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:34,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:34,775 INFO L87 Difference]: Start difference. First operand 2496 states and 3191 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:34,817 INFO L93 Difference]: Finished difference Result 2994 states and 3827 transitions. [2022-01-11 03:30:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:34,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 393 [2022-01-11 03:30:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:34,822 INFO L225 Difference]: With dead ends: 2994 [2022-01-11 03:30:34,822 INFO L226 Difference]: Without dead ends: 2902 [2022-01-11 03:30:34,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 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-11 03:30:34,823 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 89 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:34,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 529 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2022-01-11 03:30:34,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2406. [2022-01-11 03:30:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 2405 states have (on average 1.2848232848232848) internal successors, (3090), 2405 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3090 transitions. [2022-01-11 03:30:34,866 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3090 transitions. Word has length 393 [2022-01-11 03:30:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:34,866 INFO L470 AbstractCegarLoop]: Abstraction has 2406 states and 3090 transitions. [2022-01-11 03:30:34,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3090 transitions. [2022-01-11 03:30:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2022-01-11 03:30:34,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:34,873 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-11 03:30:34,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-11 03:30:35,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:35,084 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:35,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:35,085 INFO L85 PathProgramCache]: Analyzing trace with hash -207903558, now seen corresponding path program 1 times [2022-01-11 03:30:35,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:35,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822882323] [2022-01-11 03:30:35,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:35,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2022-01-11 03:30:35,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:35,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822882323] [2022-01-11 03:30:35,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822882323] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:35,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237366903] [2022-01-11 03:30:35,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:35,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:35,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:35,174 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 03:30:35,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-11 03:30:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:35,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:35,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2022-01-11 03:30:36,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2022-01-11 03:30:36,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237366903] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:36,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:36,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:36,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216115236] [2022-01-11 03:30:36,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:36,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:36,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:36,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:36,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:36,617 INFO L87 Difference]: Start difference. First operand 2406 states and 3090 transitions. Second operand has 6 states, 6 states have (on average 43.666666666666664) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:36,930 INFO L93 Difference]: Finished difference Result 5184 states and 6630 transitions. [2022-01-11 03:30:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:30:36,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.666666666666664) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 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 533 [2022-01-11 03:30:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:36,935 INFO L225 Difference]: With dead ends: 5184 [2022-01-11 03:30:36,935 INFO L226 Difference]: Without dead ends: 2907 [2022-01-11 03:30:36,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1072 GetRequests, 1066 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-11 03:30:36,940 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 292 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:36,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 720 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:30:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2022-01-11 03:30:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2434. [2022-01-11 03:30:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 1.286477599671188) internal successors, (3130), 2433 states have internal predecessors, (3130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3130 transitions. [2022-01-11 03:30:36,983 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3130 transitions. Word has length 533 [2022-01-11 03:30:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:36,983 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 3130 transitions. [2022-01-11 03:30:36,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.666666666666664) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3130 transitions. [2022-01-11 03:30:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2022-01-11 03:30:36,988 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:36,989 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-11 03:30:37,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-11 03:30:37,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-01-11 03:30:37,203 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash 876894448, now seen corresponding path program 1 times [2022-01-11 03:30:37,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:37,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409356135] [2022-01-11 03:30:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:37,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 2404 proven. 0 refuted. 0 times theorem prover too weak. 2567 trivial. 0 not checked. [2022-01-11 03:30:37,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:37,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409356135] [2022-01-11 03:30:37,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409356135] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:37,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:37,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:37,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864761426] [2022-01-11 03:30:37,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:37,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:37,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:37,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:37,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:37,301 INFO L87 Difference]: Start difference. First operand 2434 states and 3130 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:37,429 INFO L93 Difference]: Finished difference Result 5184 states and 6680 transitions. [2022-01-11 03:30:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:37,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 661 [2022-01-11 03:30:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:37,433 INFO L225 Difference]: With dead ends: 5184 [2022-01-11 03:30:37,433 INFO L226 Difference]: Without dead ends: 2758 [2022-01-11 03:30:37,434 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-11 03:30:37,435 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:37,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 302 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2022-01-11 03:30:37,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2740. [2022-01-11 03:30:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2740 states, 2739 states have (on average 1.2709017889740781) internal successors, (3481), 2739 states have internal predecessors, (3481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3481 transitions. [2022-01-11 03:30:37,476 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3481 transitions. Word has length 661 [2022-01-11 03:30:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:37,476 INFO L470 AbstractCegarLoop]: Abstraction has 2740 states and 3481 transitions. [2022-01-11 03:30:37,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3481 transitions. [2022-01-11 03:30:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2022-01-11 03:30:37,483 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:37,483 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-11 03:30:37,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 03:30:37,484 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:37,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1372519892, now seen corresponding path program 1 times [2022-01-11 03:30:37,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:37,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48419510] [2022-01-11 03:30:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:37,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2022-01-11 03:30:37,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:37,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48419510] [2022-01-11 03:30:37,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48419510] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:37,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179306566] [2022-01-11 03:30:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:37,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:37,608 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 03:30:37,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-11 03:30:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:37,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 2654 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:37,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2022-01-11 03:30:38,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2022-01-11 03:30:39,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179306566] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:39,258 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:39,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:39,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862719533] [2022-01-11 03:30:39,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:39,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:39,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:39,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:39,259 INFO L87 Difference]: Start difference. First operand 2740 states and 3481 transitions. Second operand has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:39,567 INFO L93 Difference]: Finished difference Result 4297 states and 5465 transitions. [2022-01-11 03:30:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:30:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 0 states have call successors, (0), 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 723 [2022-01-11 03:30:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:39,568 INFO L225 Difference]: With dead ends: 4297 [2022-01-11 03:30:39,568 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:30:39,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1454 GetRequests, 1447 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-11 03:30:39,572 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 193 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:39,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 726 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:30:39,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:30:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:30:39,574 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-11 03:30:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:30:39,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 723 [2022-01-11 03:30:39,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:39,574 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:30:39,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:30:39,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:30:39,578 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:30:39,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-11 03:30:39,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-11 03:30:39,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:30:45,091 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:30:45,091 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:30:45,091 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-01-11 03:30:45,092 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-01-11 03:30:45,092 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-01-11 03:30:45,092 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-01-11 03:30:45,092 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-01-11 03:30:45,093 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 621) no Hoare annotation was computed. [2022-01-11 03:30:45,093 INFO L861 garLoopResultBuilder]: At program point L620(lines 22 622) the Hoare annotation is: true [2022-01-11 03:30:45,094 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 609) the Hoare annotation is: (let ((.cse5 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse16 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640)) (.cse13 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse14 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse12 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8640)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8448)) (.cse6 (<= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse10 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse5 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0 .cse1 .cse3 .cse4 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640)) (and .cse5 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8480) .cse1 .cse3 .cse4 .cse6) (and .cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3)) (and .cse3 .cse8 .cse9 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse4 .cse6) (and .cse1 .cse3 .cse4 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse10 .cse11 .cse12 .cse7 .cse13) (and .cse5 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0 .cse1 .cse3 .cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and .cse10 .cse8 .cse7 .cse2) (and .cse0 .cse1 .cse3 .cse14 .cse4) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8496) .cse1 .cse3 .cse4 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496)) (and .cse15 .cse0 .cse8 .cse16) (and .cse10 .cse15 .cse8 .cse16) (and .cse1 .cse3 .cse4 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse0 .cse11 .cse1 .cse3 .cse13 .cse4) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse14) (and .cse10 .cse12 .cse7 .cse9 .cse6) (and .cse10 .cse1 .cse2) (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse1 .cse3 .cse4) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) [2022-01-11 03:30:45,094 INFO L861 garLoopResultBuilder]: At program point L632(lines 623 634) the Hoare annotation is: true [2022-01-11 03:30:45,094 INFO L861 garLoopResultBuilder]: At program point L610(lines 109 611) the Hoare annotation is: true [2022-01-11 03:30:45,094 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-01-11 03:30:45,094 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:30:45,094 INFO L858 garLoopResultBuilder]: For program point L615(lines 615 617) no Hoare annotation was computed. [2022-01-11 03:30:45,094 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 590) no Hoare annotation was computed. [2022-01-11 03:30:45,094 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:30:45,094 INFO L858 garLoopResultBuilder]: For program point L615-2(lines 615 617) no Hoare annotation was computed. [2022-01-11 03:30:45,095 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 590) the Hoare annotation is: (and (= 12292 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) [2022-01-11 03:30:45,095 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 589) no Hoare annotation was computed. [2022-01-11 03:30:45,095 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 589) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8448)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) (or (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8496) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (and (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse1) (and .cse0 .cse1))) [2022-01-11 03:30:45,095 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 588) no Hoare annotation was computed. [2022-01-11 03:30:45,095 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-01-11 03:30:45,095 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 587) no Hoare annotation was computed. [2022-01-11 03:30:45,095 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-01-11 03:30:45,095 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 586) no Hoare annotation was computed. [2022-01-11 03:30:45,095 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-11 03:30:45,095 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 585) no Hoare annotation was computed. [2022-01-11 03:30:45,095 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-01-11 03:30:45,096 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 585) the Hoare annotation is: (let ((.cse0 (<= 8480 |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 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) (not (<= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))))) [2022-01-11 03:30:45,096 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 584) no Hoare annotation was computed. [2022-01-11 03:30:45,096 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-01-11 03:30:45,096 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 553) no Hoare annotation was computed. [2022-01-11 03:30:45,096 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-01-11 03:30:45,096 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 583) no Hoare annotation was computed. [2022-01-11 03:30:45,096 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-01-11 03:30:45,096 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-01-11 03:30:45,097 INFO L854 garLoopResultBuilder]: At program point L554(lines 110 609) the Hoare annotation is: (let ((.cse5 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse16 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640)) (.cse13 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse14 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse12 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8640)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8448)) (.cse6 (<= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse10 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse5 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0 .cse1 .cse3 .cse4 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640)) (and .cse5 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8480) .cse1 .cse3 .cse4 .cse6) (and .cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3)) (and .cse3 .cse8 .cse9 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse4 .cse6) (and .cse1 .cse3 .cse4 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse10 .cse11 .cse12 .cse7 .cse13) (and .cse5 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0 .cse1 .cse3 .cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and .cse10 .cse8 .cse7 .cse2) (and .cse0 .cse1 .cse3 .cse14 .cse4) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8496) .cse1 .cse3 .cse4 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496)) (and .cse15 .cse0 .cse8 .cse16) (and .cse10 .cse15 .cse8 .cse16) (and .cse1 .cse3 .cse4 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse0 .cse11 .cse1 .cse3 .cse13 .cse4) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse14) (and .cse10 .cse12 .cse7 .cse9 .cse6) (and .cse10 .cse1 .cse2) (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse1 .cse3 .cse4) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) [2022-01-11 03:30:45,097 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 583) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640)) (.cse1 (<= 8480 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8640)) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-11 03:30:45,097 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 582) no Hoare annotation was computed. [2022-01-11 03:30:45,097 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-01-11 03:30:45,097 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 606) no Hoare annotation was computed. [2022-01-11 03:30:45,097 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 607) no Hoare annotation was computed. [2022-01-11 03:30:45,097 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 582) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8480)) (.cse1 (<= 8448 |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 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-11 03:30:45,097 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 581) no Hoare annotation was computed. [2022-01-11 03:30:45,097 INFO L858 garLoopResultBuilder]: For program point L593(lines 593 598) no Hoare annotation was computed. [2022-01-11 03:30:45,097 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-01-11 03:30:45,097 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 580) no Hoare annotation was computed. [2022-01-11 03:30:45,097 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2022-01-11 03:30:45,097 INFO L858 garLoopResultBuilder]: For program point L593-2(lines 592 606) no Hoare annotation was computed. [2022-01-11 03:30:45,097 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 553) no Hoare annotation was computed. [2022-01-11 03:30:45,098 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 579) no Hoare annotation was computed. [2022-01-11 03:30:45,098 INFO L858 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2022-01-11 03:30:45,098 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (<= 8480 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse0 .cse1) (and (<= |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) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-11 03:30:45,098 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 578) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 304) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 577) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L858 garLoopResultBuilder]: For program point L301-2(lines 219 553) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L858 garLoopResultBuilder]: For program point L301(lines 301 303) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1))) [2022-01-11 03:30:45,099 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 576) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L858 garLoopResultBuilder]: For program point L308(lines 308 312) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 326) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 575) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L858 garLoopResultBuilder]: For program point L308-2(lines 308 312) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L858 garLoopResultBuilder]: For program point L319-2(lines 319 326) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 325) no Hoare annotation was computed. [2022-01-11 03:30:45,099 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1))) [2022-01-11 03:30:45,100 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 574) no Hoare annotation was computed. [2022-01-11 03:30:45,100 INFO L858 garLoopResultBuilder]: For program point L336(lines 336 340) no Hoare annotation was computed. [2022-01-11 03:30:45,100 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 573) no Hoare annotation was computed. [2022-01-11 03:30:45,100 INFO L858 garLoopResultBuilder]: For program point L336-2(lines 219 553) no Hoare annotation was computed. [2022-01-11 03:30:45,100 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 573) the Hoare annotation is: (let ((.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1))) [2022-01-11 03:30:45,100 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 572) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L854 garLoopResultBuilder]: At program point L366(lines 342 384) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1))) [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 383) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L391(lines 391 423) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 571) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 370) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L348(lines 348 382) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L392(lines 392 398) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L854 garLoopResultBuilder]: At program point L400(lines 391 423) the Hoare annotation is: (let ((.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1))) [2022-01-11 03:30:45,101 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 571) the Hoare annotation is: (let ((.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1))) [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 570) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L348-1(lines 348 382) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L349(lines 349 379) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L403(lines 403 421) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L433(lines 433 435) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 569) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L354(lines 354 377) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L404(lines 404 410) no Hoare annotation was computed. [2022-01-11 03:30:45,101 INFO L854 garLoopResultBuilder]: At program point L412(lines 403 421) the Hoare annotation is: (let ((.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1))) [2022-01-11 03:30:45,101 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 569) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8448)) (.cse4 (<= 8448 |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| 8496) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3) .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse3 .cse4) (and .cse2 .cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8640) .cse2 .cse4))) [2022-01-11 03:30:45,101 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 568) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L415(lines 415 417) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L444(lines 444 447) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L441-1(lines 441 449) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) .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) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1))) [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 567) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L357-2(lines 357 361) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L455(lines 455 457) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 566) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 373) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 467) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) .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) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1))) [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 565) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L462(lines 462 464) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L472(lines 472 474) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 564) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse0 (<= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (not (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (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) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 563) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L481(lines 481 483) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 562) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640)) (.cse0 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse1 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8640) .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)))) [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 561) no Hoare annotation was computed. [2022-01-11 03:30:45,102 INFO L858 garLoopResultBuilder]: For program point L490(lines 490 492) no Hoare annotation was computed. [2022-01-11 03:30:45,103 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 560) no Hoare annotation was computed. [2022-01-11 03:30:45,103 INFO L858 garLoopResultBuilder]: For program point L493(lines 493 497) no Hoare annotation was computed. [2022-01-11 03:30:45,103 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 560) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse1 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse2 .cse0 .cse3 .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse3 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8640) .cse1))) [2022-01-11 03:30:45,103 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 559) no Hoare annotation was computed. [2022-01-11 03:30:45,103 INFO L858 garLoopResultBuilder]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2022-01-11 03:30:45,103 INFO L858 garLoopResultBuilder]: For program point L503(lines 503 506) no Hoare annotation was computed. [2022-01-11 03:30:45,103 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 558) no Hoare annotation was computed. [2022-01-11 03:30:45,103 INFO L858 garLoopResultBuilder]: For program point L508(lines 508 510) no Hoare annotation was computed. [2022-01-11 03:30:45,103 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 558) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse2 (not (<= 16384 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (.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 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 16384) .cse1) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2 .cse0 .cse1) (and .cse2 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-11 03:30:45,103 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 557) no Hoare annotation was computed. [2022-01-11 03:30:45,103 INFO L858 garLoopResultBuilder]: For program point L508-2(lines 219 553) no Hoare annotation was computed. [2022-01-11 03:30:45,103 INFO L858 garLoopResultBuilder]: For program point L524(lines 524 526) no Hoare annotation was computed. [2022-01-11 03:30:45,104 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 556) no Hoare annotation was computed. [2022-01-11 03:30:45,104 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 519) no Hoare annotation was computed. [2022-01-11 03:30:45,104 INFO L854 garLoopResultBuilder]: At program point L525(lines 83 621) the Hoare annotation is: false [2022-01-11 03:30:45,104 INFO L858 garLoopResultBuilder]: For program point L527(lines 527 529) no Hoare annotation was computed. [2022-01-11 03:30:45,104 INFO L861 garLoopResultBuilder]: At program point L216(lines 215 556) the Hoare annotation is: true [2022-01-11 03:30:45,104 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 556) the Hoare annotation is: true [2022-01-11 03:30:45,104 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2022-01-11 03:30:45,104 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-01-11 03:30:45,104 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 547) no Hoare annotation was computed. [2022-01-11 03:30:45,104 INFO L858 garLoopResultBuilder]: For program point L531-2(lines 531 535) no Hoare annotation was computed. [2022-01-11 03:30:45,104 INFO L858 garLoopResultBuilder]: For program point L544(lines 544 546) no Hoare annotation was computed. [2022-01-11 03:30:45,104 INFO L858 garLoopResultBuilder]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2022-01-11 03:30:45,106 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:45,108 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:30:45,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:45 BasicIcfg [2022-01-11 03:30:45,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:30:45,174 INFO L158 Benchmark]: Toolchain (without parser) took 23534.52ms. Allocated memory was 195.0MB in the beginning and 537.9MB in the end (delta: 342.9MB). Free memory was 148.6MB in the beginning and 384.8MB in the end (delta: -236.2MB). Peak memory consumption was 309.4MB. Max. memory is 8.0GB. [2022-01-11 03:30:45,175 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory was 165.2MB in the beginning and 165.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:30:45,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.16ms. Allocated memory is still 195.0MB. Free memory was 148.4MB in the beginning and 166.3MB in the end (delta: -17.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-11 03:30:45,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.57ms. Allocated memory is still 195.0MB. Free memory was 165.9MB in the beginning and 163.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:45,175 INFO L158 Benchmark]: Boogie Preprocessor took 21.69ms. Allocated memory is still 195.0MB. Free memory was 163.3MB in the beginning and 161.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:45,175 INFO L158 Benchmark]: RCFGBuilder took 479.76ms. Allocated memory is still 195.0MB. Free memory was 161.2MB in the beginning and 134.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-01-11 03:30:45,175 INFO L158 Benchmark]: IcfgTransformer took 137.65ms. Allocated memory is still 195.0MB. Free memory was 134.0MB in the beginning and 119.8MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-11 03:30:45,175 INFO L158 Benchmark]: TraceAbstraction took 22568.69ms. Allocated memory was 195.0MB in the beginning and 537.9MB in the end (delta: 342.9MB). Free memory was 119.3MB in the beginning and 384.8MB in the end (delta: -265.6MB). Peak memory consumption was 281.3MB. Max. memory is 8.0GB. [2022-01-11 03:30:45,176 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory was 165.2MB in the beginning and 165.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.16ms. Allocated memory is still 195.0MB. Free memory was 148.4MB in the beginning and 166.3MB in the end (delta: -17.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.57ms. Allocated memory is still 195.0MB. Free memory was 165.9MB in the beginning and 163.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.69ms. Allocated memory is still 195.0MB. Free memory was 163.3MB in the beginning and 161.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 479.76ms. Allocated memory is still 195.0MB. Free memory was 161.2MB in the beginning and 134.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * IcfgTransformer took 137.65ms. Allocated memory is still 195.0MB. Free memory was 134.0MB in the beginning and 119.8MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 22568.69ms. Allocated memory was 195.0MB in the beginning and 537.9MB in the end (delta: 342.9MB). Free memory was 119.3MB in the beginning and 384.8MB in the end (delta: -265.6MB). Peak memory consumption was 281.3MB. 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: 619]: 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, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.4s, OverallIterations: 26, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3070 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3070 mSDsluCounter, 10562 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4538 mSDsCounter, 690 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3937 IncrementalHoareTripleChecker+Invalid, 4627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 690 mSolverCounterUnsat, 6024 mSDtfsCounter, 3937 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5150 GetRequests, 5091 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6546occurred in iteration=17, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 5331 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 284 NumberOfFragments, 1287 HoareAnnotationTreeSize, 28 FomulaSimplifications, 23736 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 26261 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 9849 NumberOfCodeBlocks, 9849 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 11602 ConstructedInterpolants, 0 QuantifiedInterpolants, 16449 SizeOfPredicates, 5 NumberOfNonLiveVariables, 12474 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 39 InterpolantComputations, 22 PerfectInterpolantSequences, 49788/50037 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: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 0bv32)) && ~bvule32(8544bv32, s__state)) || ((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((~bvule32(8480bv32, s__state) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(s__state, 8640bv32)) || ((~bvule32(blastFlag, 0bv32) && ~bvule32(8480bv32, s__state)) && ~bvule32(s__state, 8640bv32)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8672bv32)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 0bv32) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || ((((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && !~bvule32(8640bv32, s__state)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8544bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || ((~bvule32(blastFlag, 0bv32) && !~bvule32(8640bv32, s__state)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((~bvule32(blastFlag, 2bv32) && ~bvule32(8448bv32, s__state)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8480bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || ((~bvule32(blastFlag, 0bv32) && ~bvule32(8448bv32, s__state)) && ~bvule32(s__state, 8480bv32)) - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 0bv32)) && ~bvule32(8544bv32, s__state)) || ((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && 8656bv32 == s__state) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8544bv32 == s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8528bv32 == s__state)) || ~bvule32(blastFlag, 0bv32)) || (blastFlag == 1bv32 && 8496bv32 == s__state)) || ((((((~bvule32(blastFlag, 2bv32) && ~bvule32(8448bv32, s__state)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 8480bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && 8656bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvult64(s__state, 8640bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8544bv32, s__state)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((((!(s__hit == 0bv32) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8640bv32))) || (((((~bvule32(8448bv32, s__state) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8448bv32))) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8640bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || ((((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(s__state, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32))) || ((((!(s__hit == 0bv32) && ~bvule32(8448bv32, s__state)) && ~bvule32(s__state, 8448bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || ((((~bvult64(s__s3__tmp__next_state___0, 8496bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8496bv32))) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8560bv32 == s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && 8512bv32 == s__state) && ~bvule32(0bv32, s__hit))) || ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && 8496bv32 == s__state) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) || ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 0bv32)) && ~bvult64(8496bv32, s__state)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvule32(8640bv32, s__state)) || (~bvule32(blastFlag, 0bv32) && ~bvule32(s__state, 8448bv32))) || ((((~bvult64(s__s3__tmp__next_state___0, 8496bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8448bv32)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: s__state == 12292bv32 && ~bvule32(blastFlag, 0bv32) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((~bvule32(blastFlag, 2bv32) && ~bvule32(8448bv32, s__state)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8448bv32)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || (((((~bvult64(s__s3__tmp__next_state___0, 8496bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8448bv32, s__state)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8448bv32))) || (((((~bvule32(8448bv32, s__state) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8448bv32))) || ((((!(s__hit == 0bv32) && ~bvule32(8448bv32, s__state)) && ~bvule32(s__state, 8448bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || ((~bvule32(blastFlag, 0bv32) && ~bvule32(8448bv32, s__state)) && ~bvule32(s__state, 8448bv32)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvult64(s__state, 8640bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8544bv32, s__state)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8640bv32)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 0bv32)) && ~bvule32(8544bv32, s__state)) || ((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 0bv32) && !~bvule32(16384bv32, s__state)) && ~bvule32(8672bv32, s__state)) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && !~bvule32(16384bv32, s__state)) && ~bvule32(8672bv32, s__state))) || (((~bvule32(blastFlag, 3bv32) && ~bvult64(s__state, 16384bv32)) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8480bv32, s__state)) && ~bvult64(s__state, 8496bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || ((~bvule32(blastFlag, 0bv32) && !~bvule32(8496bv32, s__state)) && ~bvule32(8480bv32, s__state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) || ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 0bv32)) && ~bvult64(8496bv32, s__state)) - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 0bv32)) && ~bvule32(8544bv32, s__state)) || ((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvult64(s__state, 8640bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8544bv32, s__state)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8640bv32)) && ~bvule32(8544bv32, s__state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 0bv32)) && ~bvule32(8480bv32, s__state)) || ((~bvule32(s__state, 8576bv32) && blastFlag == 1bv32) && ~bvule32(8480bv32, s__state))) || (((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8480bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((!(s__hit == 0bv32) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8640bv32)) || (((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8640bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((~bvule32(blastFlag, 0bv32) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) || ((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 0bv32)) && ~bvult64(8496bv32, s__state)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && 8656bv32 == s__state) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8544bv32 == s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8528bv32 == s__state)) || ~bvule32(blastFlag, 0bv32)) || (blastFlag == 1bv32 && 8496bv32 == s__state)) || ((((((~bvule32(blastFlag, 2bv32) && ~bvule32(8448bv32, s__state)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 8480bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && 8656bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvult64(s__state, 8640bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8544bv32, s__state)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((((!(s__hit == 0bv32) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8640bv32))) || (((((~bvule32(8448bv32, s__state) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8448bv32))) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8640bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || ((((((~bvule32(s__state, 8576bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(s__state, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32))) || ((((!(s__hit == 0bv32) && ~bvule32(8448bv32, s__state)) && ~bvule32(s__state, 8448bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || ((((~bvult64(s__s3__tmp__next_state___0, 8496bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8496bv32))) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8560bv32 == s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && 8512bv32 == s__state) && ~bvule32(0bv32, s__hit))) || ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__hit, 0bv32)) && 8496bv32 == s__state) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-11 03:30:45,221 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...