/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-17 23:40:06,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-17 23:40:06,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-17 23:40:06,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-17 23:40:06,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-17 23:40:06,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-17 23:40:06,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-17 23:40:06,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-17 23:40:06,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-17 23:40:06,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-17 23:40:06,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-17 23:40:06,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-17 23:40:06,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-17 23:40:06,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-17 23:40:06,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-17 23:40:06,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-17 23:40:06,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-17 23:40:06,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-17 23:40:06,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-17 23:40:06,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-17 23:40:06,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-17 23:40:06,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-17 23:40:06,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-17 23:40:06,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-17 23:40:06,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-17 23:40:06,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-17 23:40:06,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-17 23:40:06,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-17 23:40:06,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-17 23:40:06,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-17 23:40:06,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-17 23:40:06,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-17 23:40:06,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-17 23:40:06,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-17 23:40:06,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-17 23:40:06,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-17 23:40:06,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-17 23:40:06,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-17 23:40:06,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-17 23:40:06,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-17 23:40:06,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-17 23:40:06,724 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-17 23:40:06,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-17 23:40:06,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-17 23:40:06,755 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-17 23:40:06,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-17 23:40:06,756 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-17 23:40:06,756 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-17 23:40:06,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-17 23:40:06,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-17 23:40:06,756 INFO L138 SettingsManager]: * Use SBE=true [2022-01-17 23:40:06,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-17 23:40:06,757 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-17 23:40:06,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-17 23:40:06,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-17 23:40:06,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-17 23:40:06,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-17 23:40:06,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-17 23:40:06,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-17 23:40:06,758 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-17 23:40:06,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-17 23:40:06,758 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-17 23:40:06,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-17 23:40:06,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-17 23:40:06,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-17 23:40:06,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-17 23:40:06,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-17 23:40:06,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 23:40:06,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-17 23:40:06,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-17 23:40:06,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-17 23:40:06,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-17 23:40:06,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-17 23:40:06,760 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-17 23:40:06,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-17 23:40:06,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-17 23:40:06,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-17 23:40:06,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-17 23:40:06,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-17 23:40:06,977 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-17 23:40:06,977 INFO L275 PluginConnector]: CDTParser initialized [2022-01-17 23:40:06,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-01-17 23:40:07,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec452dd9/2b4461451e54421ca12c39d94bea3c7c/FLAGdbfabdf0c [2022-01-17 23:40:07,500 INFO L306 CDTParser]: Found 1 translation units. [2022-01-17 23:40:07,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-01-17 23:40:07,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec452dd9/2b4461451e54421ca12c39d94bea3c7c/FLAGdbfabdf0c [2022-01-17 23:40:07,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec452dd9/2b4461451e54421ca12c39d94bea3c7c [2022-01-17 23:40:07,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-17 23:40:07,526 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-17 23:40:07,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-17 23:40:07,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-17 23:40:07,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-17 23:40:07,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 11:40:07" (1/1) ... [2022-01-17 23:40:07,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aaf99fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:07, skipping insertion in model container [2022-01-17 23:40:07,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 11:40:07" (1/1) ... [2022-01-17 23:40:07,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-17 23:40:07,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-17 23:40:07,720 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-17 23:40:07,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39095,39108] [2022-01-17 23:40:07,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39180,39193] [2022-01-17 23:40:07,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39232,39245] [2022-01-17 23:40:07,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 23:40:07,911 INFO L203 MainTranslator]: Completed pre-run [2022-01-17 23:40:07,927 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-17 23:40:07,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39095,39108] [2022-01-17 23:40:07,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39180,39193] [2022-01-17 23:40:07,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39232,39245] [2022-01-17 23:40:07,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 23:40:08,009 INFO L208 MainTranslator]: Completed translation [2022-01-17 23:40:08,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08 WrapperNode [2022-01-17 23:40:08,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-17 23:40:08,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-17 23:40:08,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-17 23:40:08,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-17 23:40:08,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08" (1/1) ... [2022-01-17 23:40:08,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08" (1/1) ... [2022-01-17 23:40:08,081 INFO L137 Inliner]: procedures = 224, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2022-01-17 23:40:08,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-17 23:40:08,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-17 23:40:08,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-17 23:40:08,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-17 23:40:08,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08" (1/1) ... [2022-01-17 23:40:08,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08" (1/1) ... [2022-01-17 23:40:08,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08" (1/1) ... [2022-01-17 23:40:08,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08" (1/1) ... [2022-01-17 23:40:08,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08" (1/1) ... [2022-01-17 23:40:08,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08" (1/1) ... [2022-01-17 23:40:08,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08" (1/1) ... [2022-01-17 23:40:08,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-17 23:40:08,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-17 23:40:08,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-17 23:40:08,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-17 23:40:08,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08" (1/1) ... [2022-01-17 23:40:08,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 23:40:08,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 23:40:08,156 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-17 23:40:08,168 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-17 23:40:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2022-01-17 23:40:08,196 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2022-01-17 23:40:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-17 23:40:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-17 23:40:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-17 23:40:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-17 23:40:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-17 23:40:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-17 23:40:08,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-17 23:40:08,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-17 23:40:08,198 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-17 23:40:08,337 INFO L234 CfgBuilder]: Building ICFG [2022-01-17 23:40:08,338 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-17 23:40:08,589 INFO L275 CfgBuilder]: Performing block encoding [2022-01-17 23:40:08,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-17 23:40:08,597 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-17 23:40:08,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 11:40:08 BoogieIcfgContainer [2022-01-17 23:40:08,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-17 23:40:08,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-17 23:40:08,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-17 23:40:08,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-17 23:40:08,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.01 11:40:07" (1/3) ... [2022-01-17 23:40:08,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb4a71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 11:40:08, skipping insertion in model container [2022-01-17 23:40:08,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:40:08" (2/3) ... [2022-01-17 23:40:08,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb4a71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 11:40:08, skipping insertion in model container [2022-01-17 23:40:08,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 11:40:08" (3/3) ... [2022-01-17 23:40:08,606 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2022-01-17 23:40:08,610 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-17 23:40:08,611 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-17 23:40:08,611 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-17 23:40:08,611 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-17 23:40:08,674 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,674 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,674 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,674 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,674 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,674 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,675 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,675 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,675 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,675 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,676 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,676 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,676 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,676 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,676 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,677 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,677 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,677 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,677 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,678 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,678 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,678 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,678 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,678 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,680 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,681 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,681 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,681 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,681 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,681 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,682 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,682 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,682 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,682 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,682 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,682 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,682 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,683 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,683 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,683 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,683 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,683 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,683 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,683 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,683 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,683 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,684 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,684 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,684 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,684 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,684 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,684 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,685 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,685 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,685 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,685 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,685 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,685 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,685 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,685 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,685 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,685 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,686 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,686 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,686 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,687 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,687 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,687 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,687 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,688 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,688 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,688 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,688 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,688 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,688 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,688 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,688 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,688 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,689 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,689 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,689 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,690 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,690 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,690 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,691 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,691 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,691 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,692 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,693 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,697 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,698 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,698 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,698 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,698 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,698 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,698 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,699 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,699 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,699 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,699 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,699 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,700 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,700 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,700 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,700 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,700 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,701 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,701 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,701 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,701 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,701 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,702 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,702 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,702 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,702 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,702 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,702 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,702 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,702 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,703 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,703 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,703 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,703 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,703 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,704 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,704 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,704 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,704 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,704 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,704 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,704 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,704 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,704 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,705 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,705 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,705 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,705 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,706 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,706 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,706 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,706 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,707 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,707 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,707 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,707 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,707 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,707 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,708 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,708 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,708 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,708 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,708 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,709 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,710 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,710 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,710 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,710 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,710 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,710 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,711 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,711 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,711 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,711 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,711 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,712 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,712 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,712 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,712 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,712 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,712 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,712 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,712 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,712 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,713 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,713 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,713 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,713 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,713 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,713 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,713 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,713 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,713 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,713 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,714 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,714 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,714 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,714 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,714 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,714 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,714 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,714 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,715 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,715 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,715 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,715 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,715 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,716 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,716 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,716 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,716 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,716 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,716 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,716 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,716 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,717 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,717 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,717 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,717 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,717 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,717 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,717 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,717 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,718 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,718 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,719 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,722 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,723 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,724 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,724 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,724 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,724 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,724 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,724 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,724 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,725 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,725 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,725 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,731 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,732 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,732 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,732 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,732 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,732 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,732 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,733 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,733 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,734 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,734 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,734 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,734 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,734 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,734 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,735 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,735 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,735 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,735 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,735 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,735 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,736 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,736 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,736 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,736 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,736 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,736 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,736 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,737 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,741 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,741 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,742 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,742 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,742 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,742 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,742 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,742 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,742 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,743 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,743 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,743 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,743 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,743 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,743 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,743 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,743 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,743 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,744 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,744 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,744 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,744 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,744 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,744 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,744 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,744 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,745 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,745 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,745 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:40:08,750 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-17 23:40:08,798 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-17 23:40:08,807 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=FINITE_AUTOMATA, 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-17 23:40:08,807 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-17 23:40:08,821 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 152 places, 158 transitions, 324 flow [2022-01-17 23:40:08,928 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2540 states, 2537 states have (on average 2.127709893575089) internal successors, (5398), 2539 states have internal predecessors, (5398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 2540 states, 2537 states have (on average 2.127709893575089) internal successors, (5398), 2539 states have internal predecessors, (5398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-17 23:40:08,945 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:40:08,945 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] [2022-01-17 23:40:08,946 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:40:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:40:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash 847621616, now seen corresponding path program 1 times [2022-01-17 23:40:08,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:40:08,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512562813] [2022-01-17 23:40:08,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:40:08,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:40:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:40:09,176 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-17 23:40:09,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:40:09,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512562813] [2022-01-17 23:40:09,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512562813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:40:09,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:40:09,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-17 23:40:09,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492833349] [2022-01-17 23:40:09,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:40:09,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-17 23:40:09,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:40:09,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-17 23:40:09,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-17 23:40:09,220 INFO L87 Difference]: Start difference. First operand has 2540 states, 2537 states have (on average 2.127709893575089) internal successors, (5398), 2539 states have internal predecessors, (5398), 0 states have call successors, (0), 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 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:40:09,279 INFO L93 Difference]: Finished difference Result 2540 states and 5152 transitions. [2022-01-17 23:40:09,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-17 23:40:09,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-01-17 23:40:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:40:09,313 INFO L225 Difference]: With dead ends: 2540 [2022-01-17 23:40:09,314 INFO L226 Difference]: Without dead ends: 2540 [2022-01-17 23:40:09,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-17 23:40:09,319 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:40:09,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 23:40:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2022-01-17 23:40:09,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2540. [2022-01-17 23:40:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2537 states have (on average 2.030744974379188) internal successors, (5152), 2539 states have internal predecessors, (5152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 5152 transitions. [2022-01-17 23:40:09,447 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 5152 transitions. Word has length 40 [2022-01-17 23:40:09,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:40:09,447 INFO L470 AbstractCegarLoop]: Abstraction has 2540 states and 5152 transitions. [2022-01-17 23:40:09,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 5152 transitions. [2022-01-17 23:40:09,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-17 23:40:09,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:40:09,449 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] [2022-01-17 23:40:09,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-17 23:40:09,450 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:40:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:40:09,452 INFO L85 PathProgramCache]: Analyzing trace with hash 506434889, now seen corresponding path program 1 times [2022-01-17 23:40:09,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:40:09,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18440517] [2022-01-17 23:40:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:40:09,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:40:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:40:09,542 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-17 23:40:09,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:40:09,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18440517] [2022-01-17 23:40:09,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18440517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:40:09,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:40:09,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-17 23:40:09,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137587711] [2022-01-17 23:40:09,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:40:09,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-17 23:40:09,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:40:09,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-17 23:40:09,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-17 23:40:09,544 INFO L87 Difference]: Start difference. First operand 2540 states and 5152 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:40:09,594 INFO L93 Difference]: Finished difference Result 4136 states and 8424 transitions. [2022-01-17 23:40:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-17 23:40:09,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-01-17 23:40:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:40:09,612 INFO L225 Difference]: With dead ends: 4136 [2022-01-17 23:40:09,612 INFO L226 Difference]: Without dead ends: 4136 [2022-01-17 23:40:09,614 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-17 23:40:09,615 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 80 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:40:09,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 305 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 23:40:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2022-01-17 23:40:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 3148. [2022-01-17 23:40:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3145 states have (on average 2.0419713831478536) internal successors, (6422), 3147 states have internal predecessors, (6422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 6422 transitions. [2022-01-17 23:40:09,707 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 6422 transitions. Word has length 41 [2022-01-17 23:40:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:40:09,708 INFO L470 AbstractCegarLoop]: Abstraction has 3148 states and 6422 transitions. [2022-01-17 23:40:09,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 6422 transitions. [2022-01-17 23:40:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-17 23:40:09,719 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:40:09,719 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, 1, 1, 1, 1, 1, 1, 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-17 23:40:09,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-17 23:40:09,719 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:40:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:40:09,720 INFO L85 PathProgramCache]: Analyzing trace with hash -654644372, now seen corresponding path program 1 times [2022-01-17 23:40:09,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:40:09,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206343409] [2022-01-17 23:40:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:40:09,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:40:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:40:10,323 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-17 23:40:10,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:40:10,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206343409] [2022-01-17 23:40:10,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206343409] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:40:10,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:40:10,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-17 23:40:10,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493803119] [2022-01-17 23:40:10,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:40:10,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-17 23:40:10,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:40:10,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-17 23:40:10,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-01-17 23:40:10,328 INFO L87 Difference]: Start difference. First operand 3148 states and 6422 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:40:12,060 INFO L93 Difference]: Finished difference Result 3509 states and 7163 transitions. [2022-01-17 23:40:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-17 23:40:12,061 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-01-17 23:40:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:40:12,074 INFO L225 Difference]: With dead ends: 3509 [2022-01-17 23:40:12,074 INFO L226 Difference]: Without dead ends: 3353 [2022-01-17 23:40:12,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=361, Invalid=971, Unknown=0, NotChecked=0, Total=1332 [2022-01-17 23:40:12,076 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 1166 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:40:12,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1166 Valid, 2909 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-17 23:40:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2022-01-17 23:40:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 3088. [2022-01-17 23:40:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 3085 states have (on average 2.045705024311183) internal successors, (6311), 3087 states have internal predecessors, (6311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 6311 transitions. [2022-01-17 23:40:12,143 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 6311 transitions. Word has length 74 [2022-01-17 23:40:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:40:12,144 INFO L470 AbstractCegarLoop]: Abstraction has 3088 states and 6311 transitions. [2022-01-17 23:40:12,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 6311 transitions. [2022-01-17 23:40:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:40:12,148 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:40:12,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:40:12,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-17 23:40:12,148 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:40:12,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:40:12,149 INFO L85 PathProgramCache]: Analyzing trace with hash -137095055, now seen corresponding path program 1 times [2022-01-17 23:40:12,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:40:12,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419305687] [2022-01-17 23:40:12,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:40:12,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:40:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:40:12,992 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-17 23:40:12,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:40:12,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419305687] [2022-01-17 23:40:12,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419305687] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:40:12,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:40:12,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:40:12,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142677695] [2022-01-17 23:40:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:40:12,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:40:12,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:40:12,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:40:12,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:40:12,995 INFO L87 Difference]: Start difference. First operand 3088 states and 6311 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:40:19,402 INFO L93 Difference]: Finished difference Result 4311 states and 8834 transitions. [2022-01-17 23:40:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-17 23:40:19,411 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:40:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:40:19,433 INFO L225 Difference]: With dead ends: 4311 [2022-01-17 23:40:19,434 INFO L226 Difference]: Without dead ends: 4311 [2022-01-17 23:40:19,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1453, Invalid=4247, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:40:19,437 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 1239 mSDsluCounter, 4043 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-17 23:40:19,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1239 Valid, 4379 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-17 23:40:19,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4311 states. [2022-01-17 23:40:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4311 to 3439. [2022-01-17 23:40:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3439 states, 3436 states have (on average 2.0480209545983703) internal successors, (7037), 3438 states have internal predecessors, (7037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 7037 transitions. [2022-01-17 23:40:19,538 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 7037 transitions. Word has length 96 [2022-01-17 23:40:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:40:19,538 INFO L470 AbstractCegarLoop]: Abstraction has 3439 states and 7037 transitions. [2022-01-17 23:40:19,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 7037 transitions. [2022-01-17 23:40:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:40:19,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:40:19,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:40:19,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-17 23:40:19,545 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:40:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:40:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash -277531331, now seen corresponding path program 2 times [2022-01-17 23:40:19,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:40:19,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117221476] [2022-01-17 23:40:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:40:19,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:40:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:40:20,222 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-17 23:40:20,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:40:20,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117221476] [2022-01-17 23:40:20,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117221476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:40:20,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:40:20,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:40:20,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009150372] [2022-01-17 23:40:20,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:40:20,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:40:20,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:40:20,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:40:20,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:40:20,225 INFO L87 Difference]: Start difference. First operand 3439 states and 7037 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:40:26,037 INFO L93 Difference]: Finished difference Result 4308 states and 8822 transitions. [2022-01-17 23:40:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-17 23:40:26,038 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:40:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:40:26,069 INFO L225 Difference]: With dead ends: 4308 [2022-01-17 23:40:26,070 INFO L226 Difference]: Without dead ends: 4308 [2022-01-17 23:40:26,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1434, Invalid=4116, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:40:26,072 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1298 mSDsluCounter, 3910 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 4248 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:40:26,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1298 Valid, 4248 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-17 23:40:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4308 states. [2022-01-17 23:40:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4308 to 3443. [2022-01-17 23:40:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 3440 states have (on average 2.04796511627907) internal successors, (7045), 3442 states have internal predecessors, (7045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 7045 transitions. [2022-01-17 23:40:26,144 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 7045 transitions. Word has length 96 [2022-01-17 23:40:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:40:26,145 INFO L470 AbstractCegarLoop]: Abstraction has 3443 states and 7045 transitions. [2022-01-17 23:40:26,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 7045 transitions. [2022-01-17 23:40:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:40:26,154 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:40:26,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:40:26,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-17 23:40:26,154 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:40:26,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:40:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash 641947087, now seen corresponding path program 3 times [2022-01-17 23:40:26,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:40:26,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355115044] [2022-01-17 23:40:26,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:40:26,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:40:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:40:27,022 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-17 23:40:27,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:40:27,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355115044] [2022-01-17 23:40:27,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355115044] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:40:27,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:40:27,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:40:27,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853588158] [2022-01-17 23:40:27,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:40:27,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:40:27,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:40:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:40:27,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:40:27,025 INFO L87 Difference]: Start difference. First operand 3443 states and 7045 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:40:33,290 INFO L93 Difference]: Finished difference Result 4303 states and 8811 transitions. [2022-01-17 23:40:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:40:33,291 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:40:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:40:33,305 INFO L225 Difference]: With dead ends: 4303 [2022-01-17 23:40:33,305 INFO L226 Difference]: Without dead ends: 4303 [2022-01-17 23:40:33,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1386, Invalid=3444, Unknown=0, NotChecked=0, Total=4830 [2022-01-17 23:40:33,307 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 1356 mSDsluCounter, 3904 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:40:33,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1356 Valid, 4246 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1878 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-17 23:40:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2022-01-17 23:40:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 3447. [2022-01-17 23:40:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 3444 states have (on average 2.047909407665505) internal successors, (7053), 3446 states have internal predecessors, (7053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 7053 transitions. [2022-01-17 23:40:33,375 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 7053 transitions. Word has length 96 [2022-01-17 23:40:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:40:33,375 INFO L470 AbstractCegarLoop]: Abstraction has 3447 states and 7053 transitions. [2022-01-17 23:40:33,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 7053 transitions. [2022-01-17 23:40:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:40:33,379 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:40:33,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:40:33,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-17 23:40:33,380 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:40:33,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:40:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1727541067, now seen corresponding path program 4 times [2022-01-17 23:40:33,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:40:33,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636778583] [2022-01-17 23:40:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:40:33,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:40:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:40:34,055 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-17 23:40:34,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:40:34,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636778583] [2022-01-17 23:40:34,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636778583] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:40:34,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:40:34,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:40:34,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365554050] [2022-01-17 23:40:34,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:40:34,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:40:34,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:40:34,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:40:34,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:40:34,058 INFO L87 Difference]: Start difference. First operand 3447 states and 7053 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:40:39,189 INFO L93 Difference]: Finished difference Result 4320 states and 8838 transitions. [2022-01-17 23:40:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:40:39,190 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:40:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:40:39,197 INFO L225 Difference]: With dead ends: 4320 [2022-01-17 23:40:39,197 INFO L226 Difference]: Without dead ends: 4320 [2022-01-17 23:40:39,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1216, Invalid=3614, Unknown=0, NotChecked=0, Total=4830 [2022-01-17 23:40:39,202 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1181 mSDsluCounter, 4273 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:40:39,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1181 Valid, 4616 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-17 23:40:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4320 states. [2022-01-17 23:40:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4320 to 3522. [2022-01-17 23:40:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3522 states, 3519 states have (on average 2.048025007104291) internal successors, (7207), 3521 states have internal predecessors, (7207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 7207 transitions. [2022-01-17 23:40:39,287 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 7207 transitions. Word has length 96 [2022-01-17 23:40:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:40:39,287 INFO L470 AbstractCegarLoop]: Abstraction has 3522 states and 7207 transitions. [2022-01-17 23:40:39,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 7207 transitions. [2022-01-17 23:40:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:40:39,293 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:40:39,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:40:39,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-17 23:40:39,293 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:40:39,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:40:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash -808062649, now seen corresponding path program 5 times [2022-01-17 23:40:39,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:40:39,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741786031] [2022-01-17 23:40:39,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:40:39,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:40:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:40:40,145 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-17 23:40:40,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:40:40,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741786031] [2022-01-17 23:40:40,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741786031] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:40:40,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:40:40,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:40:40,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070929034] [2022-01-17 23:40:40,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:40:40,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:40:40,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:40:40,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:40:40,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:40:40,147 INFO L87 Difference]: Start difference. First operand 3522 states and 7207 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:40:45,546 INFO L93 Difference]: Finished difference Result 4304 states and 8804 transitions. [2022-01-17 23:40:45,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-17 23:40:45,547 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:40:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:40:45,555 INFO L225 Difference]: With dead ends: 4304 [2022-01-17 23:40:45,555 INFO L226 Difference]: Without dead ends: 4304 [2022-01-17 23:40:45,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1178, Invalid=2982, Unknown=0, NotChecked=0, Total=4160 [2022-01-17 23:40:45,556 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1269 mSDsluCounter, 4583 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 4921 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:40:45,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1269 Valid, 4921 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-17 23:40:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4304 states. [2022-01-17 23:40:45,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4304 to 3720. [2022-01-17 23:40:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3720 states, 3717 states have (on average 2.0497713209577615) internal successors, (7619), 3719 states have internal predecessors, (7619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 7619 transitions. [2022-01-17 23:40:45,625 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 7619 transitions. Word has length 96 [2022-01-17 23:40:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:40:45,625 INFO L470 AbstractCegarLoop]: Abstraction has 3720 states and 7619 transitions. [2022-01-17 23:40:45,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 7619 transitions. [2022-01-17 23:40:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:40:45,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:40:45,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:40:45,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-17 23:40:45,631 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:40:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:40:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash 393725621, now seen corresponding path program 6 times [2022-01-17 23:40:45,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:40:45,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100177943] [2022-01-17 23:40:45,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:40:45,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:40:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:40:46,331 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-17 23:40:46,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:40:46,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100177943] [2022-01-17 23:40:46,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100177943] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:40:46,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:40:46,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:40:46,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866874571] [2022-01-17 23:40:46,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:40:46,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:40:46,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:40:46,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:40:46,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:40:46,333 INFO L87 Difference]: Start difference. First operand 3720 states and 7619 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:40:51,729 INFO L93 Difference]: Finished difference Result 4381 states and 8960 transitions. [2022-01-17 23:40:51,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-17 23:40:51,730 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:40:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:40:51,737 INFO L225 Difference]: With dead ends: 4381 [2022-01-17 23:40:51,738 INFO L226 Difference]: Without dead ends: 4381 [2022-01-17 23:40:51,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1205, Invalid=3085, Unknown=0, NotChecked=0, Total=4290 [2022-01-17 23:40:51,739 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 1275 mSDsluCounter, 4321 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 4662 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:40:51,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1275 Valid, 4662 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-17 23:40:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2022-01-17 23:40:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 3695. [2022-01-17 23:40:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3695 states, 3692 states have (on average 2.049024918743229) internal successors, (7565), 3694 states have internal predecessors, (7565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:40:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 7565 transitions. [2022-01-17 23:40:51,803 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 7565 transitions. Word has length 96 [2022-01-17 23:40:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:40:51,803 INFO L470 AbstractCegarLoop]: Abstraction has 3695 states and 7565 transitions. [2022-01-17 23:40:51,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:40:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 7565 transitions. [2022-01-17 23:40:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:40:51,808 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:40:51,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:40:51,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-17 23:40:51,809 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:40:51,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:40:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1829581135, now seen corresponding path program 7 times [2022-01-17 23:40:51,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:40:51,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697884163] [2022-01-17 23:40:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:40:51,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:40:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:40:52,441 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-17 23:40:52,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:40:52,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697884163] [2022-01-17 23:40:52,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697884163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:40:52,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:40:52,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:40:52,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626942956] [2022-01-17 23:40:52,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:40:52,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:40:52,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:40:52,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:40:52,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:40:52,443 INFO L87 Difference]: Start difference. First operand 3695 states and 7565 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:41:02,911 INFO L93 Difference]: Finished difference Result 4597 states and 9402 transitions. [2022-01-17 23:41:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-01-17 23:41:02,912 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:41:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:41:02,919 INFO L225 Difference]: With dead ends: 4597 [2022-01-17 23:41:02,919 INFO L226 Difference]: Without dead ends: 4597 [2022-01-17 23:41:02,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2967, Invalid=7335, Unknown=0, NotChecked=0, Total=10302 [2022-01-17 23:41:02,922 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 1409 mSDsluCounter, 4765 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 5152 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:41:02,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1409 Valid, 5152 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-17 23:41:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4597 states. [2022-01-17 23:41:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4597 to 3621. [2022-01-17 23:41:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 3618 states have (on average 2.0472636815920398) internal successors, (7407), 3620 states have internal predecessors, (7407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:41:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 7407 transitions. [2022-01-17 23:41:02,979 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 7407 transitions. Word has length 96 [2022-01-17 23:41:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:41:02,979 INFO L470 AbstractCegarLoop]: Abstraction has 3621 states and 7407 transitions. [2022-01-17 23:41:02,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 7407 transitions. [2022-01-17 23:41:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:41:02,984 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:41:02,984 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:41:02,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-17 23:41:02,985 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:41:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:41:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1757374095, now seen corresponding path program 8 times [2022-01-17 23:41:02,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:41:02,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155972109] [2022-01-17 23:41:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:41:02,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:41:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:41:03,572 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-17 23:41:03,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:41:03,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155972109] [2022-01-17 23:41:03,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155972109] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:41:03,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:41:03,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:41:03,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631287532] [2022-01-17 23:41:03,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:41:03,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:41:03,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:41:03,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:41:03,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:41:03,574 INFO L87 Difference]: Start difference. First operand 3621 states and 7407 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:41:09,356 INFO L93 Difference]: Finished difference Result 5130 states and 10541 transitions. [2022-01-17 23:41:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-17 23:41:09,356 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:41:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:41:09,365 INFO L225 Difference]: With dead ends: 5130 [2022-01-17 23:41:09,366 INFO L226 Difference]: Without dead ends: 5130 [2022-01-17 23:41:09,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1452, Invalid=4248, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:41:09,368 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1324 mSDsluCounter, 4231 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 4576 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:41:09,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1324 Valid, 4576 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-17 23:41:09,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states. [2022-01-17 23:41:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 3855. [2022-01-17 23:41:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 3852 states have (on average 2.0558151609553477) internal successors, (7919), 3854 states have internal predecessors, (7919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:41:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 7919 transitions. [2022-01-17 23:41:09,432 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 7919 transitions. Word has length 96 [2022-01-17 23:41:09,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:41:09,433 INFO L470 AbstractCegarLoop]: Abstraction has 3855 states and 7919 transitions. [2022-01-17 23:41:09,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 7919 transitions. [2022-01-17 23:41:09,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:41:09,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:41:09,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:41:09,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-17 23:41:09,438 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:41:09,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:41:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1616937819, now seen corresponding path program 9 times [2022-01-17 23:41:09,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:41:09,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984782554] [2022-01-17 23:41:09,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:41:09,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:41:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:41:10,076 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-17 23:41:10,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:41:10,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984782554] [2022-01-17 23:41:10,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984782554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:41:10,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:41:10,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:41:10,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129742931] [2022-01-17 23:41:10,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:41:10,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:41:10,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:41:10,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:41:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:41:10,078 INFO L87 Difference]: Start difference. First operand 3855 states and 7919 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:41:15,693 INFO L93 Difference]: Finished difference Result 5127 states and 10529 transitions. [2022-01-17 23:41:15,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-17 23:41:15,693 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:41:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:41:15,702 INFO L225 Difference]: With dead ends: 5127 [2022-01-17 23:41:15,702 INFO L226 Difference]: Without dead ends: 5127 [2022-01-17 23:41:15,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1433, Invalid=4117, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:41:15,704 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 1250 mSDsluCounter, 4069 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 4416 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:41:15,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1250 Valid, 4416 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-17 23:41:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2022-01-17 23:41:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 3859. [2022-01-17 23:41:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3859 states, 3856 states have (on average 2.0557572614107884) internal successors, (7927), 3858 states have internal predecessors, (7927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:41:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 7927 transitions. [2022-01-17 23:41:15,766 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 7927 transitions. Word has length 96 [2022-01-17 23:41:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:41:15,766 INFO L470 AbstractCegarLoop]: Abstraction has 3859 states and 7927 transitions. [2022-01-17 23:41:15,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 7927 transitions. [2022-01-17 23:41:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:41:15,772 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:41:15,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:41:15,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-17 23:41:15,772 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:41:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:41:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1758551059, now seen corresponding path program 10 times [2022-01-17 23:41:15,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:41:15,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103758739] [2022-01-17 23:41:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:41:15,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:41:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:41:16,424 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-17 23:41:16,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:41:16,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103758739] [2022-01-17 23:41:16,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103758739] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:41:16,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:41:16,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:41:16,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862217375] [2022-01-17 23:41:16,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:41:16,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:41:16,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:41:16,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:41:16,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:41:16,426 INFO L87 Difference]: Start difference. First operand 3859 states and 7927 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:41:22,333 INFO L93 Difference]: Finished difference Result 5168 states and 10612 transitions. [2022-01-17 23:41:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:41:22,333 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:41:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:41:22,339 INFO L225 Difference]: With dead ends: 5168 [2022-01-17 23:41:22,339 INFO L226 Difference]: Without dead ends: 5168 [2022-01-17 23:41:22,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1386, Invalid=3444, Unknown=0, NotChecked=0, Total=4830 [2022-01-17 23:41:22,342 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 1344 mSDsluCounter, 4179 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:41:22,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1344 Valid, 4530 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-17 23:41:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2022-01-17 23:41:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 3870. [2022-01-17 23:41:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 3867 states have (on average 2.055598655288337) internal successors, (7949), 3869 states have internal predecessors, (7949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:41:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 7949 transitions. [2022-01-17 23:41:22,402 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 7949 transitions. Word has length 96 [2022-01-17 23:41:22,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:41:22,402 INFO L470 AbstractCegarLoop]: Abstraction has 3870 states and 7949 transitions. [2022-01-17 23:41:22,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 7949 transitions. [2022-01-17 23:41:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:41:22,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:41:22,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:41:22,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-17 23:41:22,408 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:41:22,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:41:22,408 INFO L85 PathProgramCache]: Analyzing trace with hash 166928083, now seen corresponding path program 11 times [2022-01-17 23:41:22,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:41:22,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351399548] [2022-01-17 23:41:22,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:41:22,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:41:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:41:22,986 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-17 23:41:22,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:41:22,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351399548] [2022-01-17 23:41:22,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351399548] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:41:22,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:41:22,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:41:22,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738055498] [2022-01-17 23:41:22,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:41:22,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:41:22,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:41:22,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:41:22,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:41:22,988 INFO L87 Difference]: Start difference. First operand 3870 states and 7949 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:28,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:41:28,042 INFO L93 Difference]: Finished difference Result 5042 states and 10344 transitions. [2022-01-17 23:41:28,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:41:28,042 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:41:28,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:41:28,048 INFO L225 Difference]: With dead ends: 5042 [2022-01-17 23:41:28,048 INFO L226 Difference]: Without dead ends: 5042 [2022-01-17 23:41:28,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1215, Invalid=3615, Unknown=0, NotChecked=0, Total=4830 [2022-01-17 23:41:28,049 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 1209 mSDsluCounter, 4611 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 4963 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:41:28,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1209 Valid, 4963 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-17 23:41:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5042 states. [2022-01-17 23:41:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5042 to 3922. [2022-01-17 23:41:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3922 states, 3919 states have (on average 2.054605766777239) internal successors, (8052), 3921 states have internal predecessors, (8052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:41:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 8052 transitions. [2022-01-17 23:41:28,107 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 8052 transitions. Word has length 96 [2022-01-17 23:41:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:41:28,107 INFO L470 AbstractCegarLoop]: Abstraction has 3922 states and 8052 transitions. [2022-01-17 23:41:28,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 8052 transitions. [2022-01-17 23:41:28,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:41:28,113 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:41:28,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:41:28,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-17 23:41:28,113 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:41:28,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:41:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1086406501, now seen corresponding path program 12 times [2022-01-17 23:41:28,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:41:28,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529745015] [2022-01-17 23:41:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:41:28,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:41:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:41:28,790 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-17 23:41:28,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:41:28,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529745015] [2022-01-17 23:41:28,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529745015] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:41:28,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:41:28,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:41:28,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946078654] [2022-01-17 23:41:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:41:28,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:41:28,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:41:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:41:28,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:41:28,792 INFO L87 Difference]: Start difference. First operand 3922 states and 8052 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:41:33,968 INFO L93 Difference]: Finished difference Result 5004 states and 10266 transitions. [2022-01-17 23:41:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-17 23:41:33,968 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:41:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:41:33,975 INFO L225 Difference]: With dead ends: 5004 [2022-01-17 23:41:33,975 INFO L226 Difference]: Without dead ends: 5004 [2022-01-17 23:41:33,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1179, Invalid=2981, Unknown=0, NotChecked=0, Total=4160 [2022-01-17 23:41:33,976 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 1193 mSDsluCounter, 3893 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 4240 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:41:33,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1193 Valid, 4240 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-17 23:41:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5004 states. [2022-01-17 23:41:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5004 to 3915. [2022-01-17 23:41:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3915 states, 3912 states have (on average 2.0501022494887526) internal successors, (8020), 3914 states have internal predecessors, (8020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:41:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 8020 transitions. [2022-01-17 23:41:34,039 INFO L78 Accepts]: Start accepts. Automaton has 3915 states and 8020 transitions. Word has length 96 [2022-01-17 23:41:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:41:34,039 INFO L470 AbstractCegarLoop]: Abstraction has 3915 states and 8020 transitions. [2022-01-17 23:41:34,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 8020 transitions. [2022-01-17 23:41:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:41:34,044 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:41:34,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:41:34,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-17 23:41:34,045 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:41:34,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:41:34,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2006772525, now seen corresponding path program 13 times [2022-01-17 23:41:34,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:41:34,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431224209] [2022-01-17 23:41:34,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:41:34,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:41:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:41:34,779 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-17 23:41:34,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:41:34,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431224209] [2022-01-17 23:41:34,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431224209] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:41:34,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:41:34,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:41:34,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755236167] [2022-01-17 23:41:34,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:41:34,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:41:34,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:41:34,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:41:34,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:41:34,780 INFO L87 Difference]: Start difference. First operand 3915 states and 8020 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:41:40,397 INFO L93 Difference]: Finished difference Result 5041 states and 10334 transitions. [2022-01-17 23:41:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-17 23:41:40,397 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:41:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:41:40,402 INFO L225 Difference]: With dead ends: 5041 [2022-01-17 23:41:40,402 INFO L226 Difference]: Without dead ends: 5041 [2022-01-17 23:41:40,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1203, Invalid=3087, Unknown=0, NotChecked=0, Total=4290 [2022-01-17 23:41:40,403 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1171 mSDsluCounter, 4496 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:41:40,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1171 Valid, 4846 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-17 23:41:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5041 states. [2022-01-17 23:41:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5041 to 3915. [2022-01-17 23:41:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3915 states, 3912 states have (on average 2.0501022494887526) internal successors, (8020), 3914 states have internal predecessors, (8020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:41:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 8020 transitions. [2022-01-17 23:41:40,475 INFO L78 Accepts]: Start accepts. Automaton has 3915 states and 8020 transitions. Word has length 96 [2022-01-17 23:41:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:41:40,475 INFO L470 AbstractCegarLoop]: Abstraction has 3915 states and 8020 transitions. [2022-01-17 23:41:40,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 8020 transitions. [2022-01-17 23:41:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:41:40,481 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:41:40,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:41:40,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-17 23:41:40,482 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:41:40,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:41:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash -570917011, now seen corresponding path program 14 times [2022-01-17 23:41:40,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:41:40,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524512674] [2022-01-17 23:41:40,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:41:40,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:41:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:41:41,124 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-17 23:41:41,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:41:41,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524512674] [2022-01-17 23:41:41,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524512674] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:41:41,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:41:41,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:41:41,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519404831] [2022-01-17 23:41:41,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:41:41,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:41:41,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:41:41,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:41:41,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:41:41,126 INFO L87 Difference]: Start difference. First operand 3915 states and 8020 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:53,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:41:53,606 INFO L93 Difference]: Finished difference Result 5536 states and 11345 transitions. [2022-01-17 23:41:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-01-17 23:41:53,607 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:41:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:41:53,618 INFO L225 Difference]: With dead ends: 5536 [2022-01-17 23:41:53,618 INFO L226 Difference]: Without dead ends: 5536 [2022-01-17 23:41:53,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=3768, Invalid=9342, Unknown=0, NotChecked=0, Total=13110 [2022-01-17 23:41:53,619 INFO L933 BasicCegarLoop]: 464 mSDtfsCounter, 1502 mSDsluCounter, 4732 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 5196 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-17 23:41:53,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 5196 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-17 23:41:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5536 states. [2022-01-17 23:41:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5536 to 3915. [2022-01-17 23:41:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3915 states, 3912 states have (on average 2.0501022494887526) internal successors, (8020), 3914 states have internal predecessors, (8020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:41:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 8020 transitions. [2022-01-17 23:41:53,699 INFO L78 Accepts]: Start accepts. Automaton has 3915 states and 8020 transitions. Word has length 96 [2022-01-17 23:41:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:41:53,699 INFO L470 AbstractCegarLoop]: Abstraction has 3915 states and 8020 transitions. [2022-01-17 23:41:53,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:41:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 8020 transitions. [2022-01-17 23:41:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:41:53,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:41:53,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:41:53,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-17 23:41:53,706 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:41:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:41:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2037360013, now seen corresponding path program 15 times [2022-01-17 23:41:53,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:41:53,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838252680] [2022-01-17 23:41:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:41:53,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:41:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:41:54,236 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-17 23:41:54,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:41:54,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838252680] [2022-01-17 23:41:54,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838252680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:41:54,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:41:54,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-17 23:41:54,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508425624] [2022-01-17 23:41:54,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:41:54,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-17 23:41:54,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:41:54,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-17 23:41:54,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2022-01-17 23:41:54,238 INFO L87 Difference]: Start difference. First operand 3915 states and 8020 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 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-17 23:42:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:04,614 INFO L93 Difference]: Finished difference Result 5069 states and 10377 transitions. [2022-01-17 23:42:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-01-17 23:42:04,615 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 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 96 [2022-01-17 23:42:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:04,622 INFO L225 Difference]: With dead ends: 5069 [2022-01-17 23:42:04,622 INFO L226 Difference]: Without dead ends: 5069 [2022-01-17 23:42:04,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=3334, Invalid=8222, Unknown=0, NotChecked=0, Total=11556 [2022-01-17 23:42:04,623 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 1478 mSDsluCounter, 4559 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 4941 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:42:04,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1478 Valid, 4941 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-17 23:42:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5069 states. [2022-01-17 23:42:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5069 to 3548. [2022-01-17 23:42:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3548 states, 3545 states have (on average 2.045416078984485) internal successors, (7251), 3547 states have internal predecessors, (7251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:42:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 7251 transitions. [2022-01-17 23:42:04,677 INFO L78 Accepts]: Start accepts. Automaton has 3548 states and 7251 transitions. Word has length 96 [2022-01-17 23:42:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:04,677 INFO L470 AbstractCegarLoop]: Abstraction has 3548 states and 7251 transitions. [2022-01-17 23:42:04,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 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-17 23:42:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 7251 transitions. [2022-01-17 23:42:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:42:04,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:04,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:42:04,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-17 23:42:04,683 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:42:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:04,683 INFO L85 PathProgramCache]: Analyzing trace with hash 155436657, now seen corresponding path program 16 times [2022-01-17 23:42:04,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:04,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775570229] [2022-01-17 23:42:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:04,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:05,222 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-17 23:42:05,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:05,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775570229] [2022-01-17 23:42:05,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775570229] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:05,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:05,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:42:05,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286102253] [2022-01-17 23:42:05,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:05,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:42:05,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:05,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:42:05,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:42:05,224 INFO L87 Difference]: Start difference. First operand 3548 states and 7251 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:10,992 INFO L93 Difference]: Finished difference Result 4667 states and 9586 transitions. [2022-01-17 23:42:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-17 23:42:10,995 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:42:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:11,001 INFO L225 Difference]: With dead ends: 4667 [2022-01-17 23:42:11,001 INFO L226 Difference]: Without dead ends: 4667 [2022-01-17 23:42:11,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1451, Invalid=4249, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:42:11,003 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1379 mSDsluCounter, 4608 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 4946 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:42:11,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1379 Valid, 4946 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-17 23:42:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4667 states. [2022-01-17 23:42:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4667 to 3772. [2022-01-17 23:42:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3772 states, 3769 states have (on average 2.0543910851684797) internal successors, (7743), 3771 states have internal predecessors, (7743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:42:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 7743 transitions. [2022-01-17 23:42:11,070 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 7743 transitions. Word has length 96 [2022-01-17 23:42:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:11,070 INFO L470 AbstractCegarLoop]: Abstraction has 3772 states and 7743 transitions. [2022-01-17 23:42:11,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 7743 transitions. [2022-01-17 23:42:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:42:11,075 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:11,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:42:11,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-17 23:42:11,076 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:42:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash 15000381, now seen corresponding path program 17 times [2022-01-17 23:42:11,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:11,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112254711] [2022-01-17 23:42:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:11,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:11,614 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-17 23:42:11,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:11,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112254711] [2022-01-17 23:42:11,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112254711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:11,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:11,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:42:11,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950115099] [2022-01-17 23:42:11,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:11,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:42:11,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:11,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:42:11,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:42:11,616 INFO L87 Difference]: Start difference. First operand 3772 states and 7743 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:17,393 INFO L93 Difference]: Finished difference Result 4664 states and 9574 transitions. [2022-01-17 23:42:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-17 23:42:17,394 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:42:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:17,398 INFO L225 Difference]: With dead ends: 4664 [2022-01-17 23:42:17,398 INFO L226 Difference]: Without dead ends: 4664 [2022-01-17 23:42:17,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1432, Invalid=4118, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:42:17,399 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1186 mSDsluCounter, 4769 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 5109 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:42:17,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1186 Valid, 5109 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2206 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-17 23:42:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4664 states. [2022-01-17 23:42:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4664 to 3776. [2022-01-17 23:42:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 3773 states have (on average 2.0543334216803606) internal successors, (7751), 3775 states have internal predecessors, (7751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:42:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 7751 transitions. [2022-01-17 23:42:17,453 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 7751 transitions. Word has length 96 [2022-01-17 23:42:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:17,453 INFO L470 AbstractCegarLoop]: Abstraction has 3776 states and 7751 transitions. [2022-01-17 23:42:17,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 7751 transitions. [2022-01-17 23:42:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:42:17,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:17,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:42:17,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-17 23:42:17,458 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:42:17,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 934478799, now seen corresponding path program 18 times [2022-01-17 23:42:17,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:17,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918035098] [2022-01-17 23:42:17,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:17,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:18,195 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-17 23:42:18,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:18,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918035098] [2022-01-17 23:42:18,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918035098] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:18,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:18,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:42:18,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647248492] [2022-01-17 23:42:18,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:18,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:42:18,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:18,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:42:18,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:42:18,197 INFO L87 Difference]: Start difference. First operand 3776 states and 7751 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:24,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:24,365 INFO L93 Difference]: Finished difference Result 4659 states and 9563 transitions. [2022-01-17 23:42:24,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:42:24,366 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:42:24,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:24,370 INFO L225 Difference]: With dead ends: 4659 [2022-01-17 23:42:24,370 INFO L226 Difference]: Without dead ends: 4659 [2022-01-17 23:42:24,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1384, Invalid=3446, Unknown=0, NotChecked=0, Total=4830 [2022-01-17 23:42:24,371 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 1448 mSDsluCounter, 4118 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 4462 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:42:24,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1448 Valid, 4462 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-17 23:42:24,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2022-01-17 23:42:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 3780. [2022-01-17 23:42:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3780 states, 3777 states have (on average 2.0542758803283028) internal successors, (7759), 3779 states have internal predecessors, (7759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:42:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 7759 transitions. [2022-01-17 23:42:24,410 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 7759 transitions. Word has length 96 [2022-01-17 23:42:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:24,410 INFO L470 AbstractCegarLoop]: Abstraction has 3780 states and 7759 transitions. [2022-01-17 23:42:24,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 7759 transitions. [2022-01-17 23:42:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:42:24,416 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:24,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:42:24,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-17 23:42:24,417 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:42:24,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:24,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1435009355, now seen corresponding path program 19 times [2022-01-17 23:42:24,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:24,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027548333] [2022-01-17 23:42:24,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:24,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:24,937 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-17 23:42:24,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:24,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027548333] [2022-01-17 23:42:24,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027548333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:24,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:24,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:42:24,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296883283] [2022-01-17 23:42:24,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:24,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:42:24,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:24,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:42:24,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:42:24,939 INFO L87 Difference]: Start difference. First operand 3780 states and 7759 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:29,982 INFO L93 Difference]: Finished difference Result 4576 states and 9383 transitions. [2022-01-17 23:42:29,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:42:29,983 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:42:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:29,987 INFO L225 Difference]: With dead ends: 4576 [2022-01-17 23:42:29,987 INFO L226 Difference]: Without dead ends: 4576 [2022-01-17 23:42:29,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1214, Invalid=3616, Unknown=0, NotChecked=0, Total=4830 [2022-01-17 23:42:29,988 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1254 mSDsluCounter, 4777 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 5122 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:42:29,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1254 Valid, 5122 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-17 23:42:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2022-01-17 23:42:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 3832. [2022-01-17 23:42:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3832 states, 3829 states have (on average 2.0532776181770696) internal successors, (7862), 3831 states have internal predecessors, (7862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:42:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 7862 transitions. [2022-01-17 23:42:30,023 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 7862 transitions. Word has length 96 [2022-01-17 23:42:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:30,023 INFO L470 AbstractCegarLoop]: Abstraction has 3832 states and 7862 transitions. [2022-01-17 23:42:30,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 7862 transitions. [2022-01-17 23:42:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:42:30,026 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:30,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:42:30,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-17 23:42:30,027 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:42:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash -515530937, now seen corresponding path program 20 times [2022-01-17 23:42:30,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:30,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023499236] [2022-01-17 23:42:30,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:30,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:30,716 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-17 23:42:30,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:30,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023499236] [2022-01-17 23:42:30,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023499236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:30,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:30,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:42:30,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006428156] [2022-01-17 23:42:30,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:30,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:42:30,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:30,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:42:30,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:42:30,718 INFO L87 Difference]: Start difference. First operand 3832 states and 7862 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:36,309 INFO L93 Difference]: Finished difference Result 4514 states and 9255 transitions. [2022-01-17 23:42:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-17 23:42:36,309 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:42:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:36,313 INFO L225 Difference]: With dead ends: 4514 [2022-01-17 23:42:36,313 INFO L226 Difference]: Without dead ends: 4514 [2022-01-17 23:42:36,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1176, Invalid=2984, Unknown=0, NotChecked=0, Total=4160 [2022-01-17 23:42:36,314 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1335 mSDsluCounter, 4458 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 4798 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:42:36,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1335 Valid, 4798 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-17 23:42:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4514 states. [2022-01-17 23:42:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4514 to 3787. [2022-01-17 23:42:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3787 states, 3784 states have (on average 2.049154334038055) internal successors, (7754), 3786 states have internal predecessors, (7754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:42:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 3787 states and 7754 transitions. [2022-01-17 23:42:36,375 INFO L78 Accepts]: Start accepts. Automaton has 3787 states and 7754 transitions. Word has length 96 [2022-01-17 23:42:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:36,375 INFO L470 AbstractCegarLoop]: Abstraction has 3787 states and 7754 transitions. [2022-01-17 23:42:36,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 7754 transitions. [2022-01-17 23:42:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:42:36,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:36,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:42:36,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-17 23:42:36,378 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:42:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash 686257333, now seen corresponding path program 21 times [2022-01-17 23:42:36,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:36,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554065272] [2022-01-17 23:42:36,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:36,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:37,060 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-17 23:42:37,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:37,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554065272] [2022-01-17 23:42:37,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554065272] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:37,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:37,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:42:37,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541501014] [2022-01-17 23:42:37,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:37,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:42:37,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:37,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:42:37,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:42:37,062 INFO L87 Difference]: Start difference. First operand 3787 states and 7754 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:42,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:42,543 INFO L93 Difference]: Finished difference Result 4578 states and 9379 transitions. [2022-01-17 23:42:42,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-17 23:42:42,544 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:42:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:42,548 INFO L225 Difference]: With dead ends: 4578 [2022-01-17 23:42:42,548 INFO L226 Difference]: Without dead ends: 4578 [2022-01-17 23:42:42,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1203, Invalid=3087, Unknown=0, NotChecked=0, Total=4290 [2022-01-17 23:42:42,549 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1164 mSDsluCounter, 4268 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 4611 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:42:42,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1164 Valid, 4611 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-17 23:42:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2022-01-17 23:42:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 3870. [2022-01-17 23:42:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 3867 states have (on average 2.048616498577709) internal successors, (7922), 3869 states have internal predecessors, (7922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:42:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 7922 transitions. [2022-01-17 23:42:42,598 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 7922 transitions. Word has length 96 [2022-01-17 23:42:42,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:42,598 INFO L470 AbstractCegarLoop]: Abstraction has 3870 states and 7922 transitions. [2022-01-17 23:42:42,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 7922 transitions. [2022-01-17 23:42:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:42:42,602 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:42,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:42:42,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-17 23:42:42,603 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:42:42,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:42,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2122112847, now seen corresponding path program 22 times [2022-01-17 23:42:42,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:42,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748695780] [2022-01-17 23:42:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:42,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:43,219 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-17 23:42:43,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:43,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748695780] [2022-01-17 23:42:43,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748695780] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:43,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:43,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:42:43,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106539131] [2022-01-17 23:42:43,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:43,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:42:43,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:43,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:42:43,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:42:43,221 INFO L87 Difference]: Start difference. First operand 3870 states and 7922 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:49,015 INFO L93 Difference]: Finished difference Result 4697 states and 9619 transitions. [2022-01-17 23:42:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-17 23:42:49,015 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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 96 [2022-01-17 23:42:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:49,021 INFO L225 Difference]: With dead ends: 4697 [2022-01-17 23:42:49,021 INFO L226 Difference]: Without dead ends: 4697 [2022-01-17 23:42:49,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1280, Invalid=3142, Unknown=0, NotChecked=0, Total=4422 [2022-01-17 23:42:49,022 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1199 mSDsluCounter, 4456 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 4806 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:42:49,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1199 Valid, 4806 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-17 23:42:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2022-01-17 23:42:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 3886. [2022-01-17 23:42:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3883 states have (on average 2.0484161730620656) internal successors, (7954), 3885 states have internal predecessors, (7954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:42:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 7954 transitions. [2022-01-17 23:42:49,075 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 7954 transitions. Word has length 96 [2022-01-17 23:42:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:49,075 INFO L470 AbstractCegarLoop]: Abstraction has 3886 states and 7954 transitions. [2022-01-17 23:42:49,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 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-17 23:42:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 7954 transitions. [2022-01-17 23:42:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:42:49,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:49,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:42:49,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-17 23:42:49,080 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:42:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash 435422575, now seen corresponding path program 23 times [2022-01-17 23:42:49,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:49,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110968693] [2022-01-17 23:42:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:49,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:49,620 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-17 23:42:49,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:49,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110968693] [2022-01-17 23:42:49,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110968693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:49,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:49,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-17 23:42:49,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509869966] [2022-01-17 23:42:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:49,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-17 23:42:49,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:49,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-17 23:42:49,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-01-17 23:42:49,621 INFO L87 Difference]: Start difference. First operand 3886 states and 7954 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 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-17 23:43:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:02,257 INFO L93 Difference]: Finished difference Result 4940 states and 10114 transitions. [2022-01-17 23:43:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-01-17 23:43:02,258 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 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 96 [2022-01-17 23:43:02,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:02,262 INFO L225 Difference]: With dead ends: 4940 [2022-01-17 23:43:02,262 INFO L226 Difference]: Without dead ends: 4940 [2022-01-17 23:43:02,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2466 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=4244, Invalid=10518, Unknown=0, NotChecked=0, Total=14762 [2022-01-17 23:43:02,263 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 1290 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 2855 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 5001 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:02,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1290 Valid, 5001 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2855 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-17 23:43:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2022-01-17 23:43:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 3548. [2022-01-17 23:43:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3548 states, 3545 states have (on average 2.045416078984485) internal successors, (7251), 3547 states have internal predecessors, (7251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 7251 transitions. [2022-01-17 23:43:02,312 INFO L78 Accepts]: Start accepts. Automaton has 3548 states and 7251 transitions. Word has length 96 [2022-01-17 23:43:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:02,312 INFO L470 AbstractCegarLoop]: Abstraction has 3548 states and 7251 transitions. [2022-01-17 23:43:02,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 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-17 23:43:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 7251 transitions. [2022-01-17 23:43:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-17 23:43:02,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:02,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:43:02,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-17 23:43:02,317 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:43:02,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1424536301, now seen corresponding path program 24 times [2022-01-17 23:43:02,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:02,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671070737] [2022-01-17 23:43:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:02,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:02,830 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-17 23:43:02,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:02,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671070737] [2022-01-17 23:43:02,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671070737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:02,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:02,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-17 23:43:02,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076753345] [2022-01-17 23:43:02,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:02,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-17 23:43:02,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:02,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-17 23:43:02,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2022-01-17 23:43:02,832 INFO L87 Difference]: Start difference. First operand 3548 states and 7251 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 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-17 23:43:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:13,720 INFO L93 Difference]: Finished difference Result 4198 states and 8572 transitions. [2022-01-17 23:43:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-01-17 23:43:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 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 96 [2022-01-17 23:43:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:13,724 INFO L225 Difference]: With dead ends: 4198 [2022-01-17 23:43:13,725 INFO L226 Difference]: Without dead ends: 4198 [2022-01-17 23:43:13,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=3743, Invalid=9367, Unknown=0, NotChecked=0, Total=13110 [2022-01-17 23:43:13,726 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 1422 mSDsluCounter, 3761 mSDsCounter, 0 mSdLazyCounter, 2258 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:13,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1422 Valid, 4135 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2258 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-17 23:43:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2022-01-17 23:43:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 3151. [2022-01-17 23:43:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3151 states, 3148 states have (on average 2.0447903430749683) internal successors, (6437), 3150 states have internal predecessors, (6437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 3151 states and 6437 transitions. [2022-01-17 23:43:13,755 INFO L78 Accepts]: Start accepts. Automaton has 3151 states and 6437 transitions. Word has length 96 [2022-01-17 23:43:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:13,755 INFO L470 AbstractCegarLoop]: Abstraction has 3151 states and 6437 transitions. [2022-01-17 23:43:13,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 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-17 23:43:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3151 states and 6437 transitions. [2022-01-17 23:43:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:43:13,758 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:13,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:43:13,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-17 23:43:13,758 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:43:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash -409774949, now seen corresponding path program 1 times [2022-01-17 23:43:13,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:13,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879523816] [2022-01-17 23:43:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:13,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:14,933 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-17 23:43:14,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:14,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879523816] [2022-01-17 23:43:14,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879523816] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:14,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:14,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-17 23:43:14,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116888382] [2022-01-17 23:43:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:14,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-17 23:43:14,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-17 23:43:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1235, Unknown=0, NotChecked=0, Total=1332 [2022-01-17 23:43:14,935 INFO L87 Difference]: Start difference. First operand 3151 states and 6437 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:21,062 INFO L93 Difference]: Finished difference Result 6181 states and 12714 transitions. [2022-01-17 23:43:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-17 23:43:21,065 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:43:21,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:21,070 INFO L225 Difference]: With dead ends: 6181 [2022-01-17 23:43:21,071 INFO L226 Difference]: Without dead ends: 6181 [2022-01-17 23:43:21,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1408, Invalid=7148, Unknown=0, NotChecked=0, Total=8556 [2022-01-17 23:43:21,071 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 2117 mSDsluCounter, 9405 mSDsCounter, 0 mSdLazyCounter, 3686 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2117 SdHoareTripleChecker+Valid, 9934 SdHoareTripleChecker+Invalid, 3743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:21,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2117 Valid, 9934 Invalid, 3743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3686 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:43:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6181 states. [2022-01-17 23:43:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6181 to 4658. [2022-01-17 23:43:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4658 states, 4655 states have (on average 2.05671321160043) internal successors, (9574), 4657 states have internal predecessors, (9574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 9574 transitions. [2022-01-17 23:43:21,124 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 9574 transitions. Word has length 99 [2022-01-17 23:43:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:21,124 INFO L470 AbstractCegarLoop]: Abstraction has 4658 states and 9574 transitions. [2022-01-17 23:43:21,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 9574 transitions. [2022-01-17 23:43:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:43:21,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:21,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:43:21,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-17 23:43:21,129 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:43:21,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:21,129 INFO L85 PathProgramCache]: Analyzing trace with hash 692291031, now seen corresponding path program 2 times [2022-01-17 23:43:21,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:21,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341774922] [2022-01-17 23:43:21,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:21,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:22,067 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-17 23:43:22,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:22,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341774922] [2022-01-17 23:43:22,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341774922] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:22,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:22,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:43:22,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863732292] [2022-01-17 23:43:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:22,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:43:22,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:22,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:43:22,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:43:22,069 INFO L87 Difference]: Start difference. First operand 4658 states and 9574 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:26,512 INFO L93 Difference]: Finished difference Result 6614 states and 13584 transitions. [2022-01-17 23:43:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:43:26,512 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:43:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:26,519 INFO L225 Difference]: With dead ends: 6614 [2022-01-17 23:43:26,519 INFO L226 Difference]: Without dead ends: 6614 [2022-01-17 23:43:26,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=946, Invalid=4604, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:43:26,520 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 1629 mSDsluCounter, 8559 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 9084 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:26,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1629 Valid, 9084 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-17 23:43:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6614 states. [2022-01-17 23:43:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6614 to 4576. [2022-01-17 23:43:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4576 states, 4573 states have (on average 2.0502952110212114) internal successors, (9376), 4575 states have internal predecessors, (9376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4576 states to 4576 states and 9376 transitions. [2022-01-17 23:43:26,569 INFO L78 Accepts]: Start accepts. Automaton has 4576 states and 9376 transitions. Word has length 99 [2022-01-17 23:43:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:26,569 INFO L470 AbstractCegarLoop]: Abstraction has 4576 states and 9376 transitions. [2022-01-17 23:43:26,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 9376 transitions. [2022-01-17 23:43:26,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:43:26,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:26,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:43:26,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-17 23:43:26,573 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:43:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:26,573 INFO L85 PathProgramCache]: Analyzing trace with hash -502418461, now seen corresponding path program 3 times [2022-01-17 23:43:26,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:26,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144794437] [2022-01-17 23:43:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:26,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:27,443 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-17 23:43:27,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:27,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144794437] [2022-01-17 23:43:27,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144794437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:27,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:27,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:43:27,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568779729] [2022-01-17 23:43:27,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:27,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:43:27,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:27,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:43:27,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:43:27,445 INFO L87 Difference]: Start difference. First operand 4576 states and 9376 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:32,330 INFO L93 Difference]: Finished difference Result 7486 states and 15358 transitions. [2022-01-17 23:43:32,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:43:32,331 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:43:32,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:32,338 INFO L225 Difference]: With dead ends: 7486 [2022-01-17 23:43:32,338 INFO L226 Difference]: Without dead ends: 7486 [2022-01-17 23:43:32,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1067, Invalid=5095, Unknown=0, NotChecked=0, Total=6162 [2022-01-17 23:43:32,340 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 1910 mSDsluCounter, 8880 mSDsCounter, 0 mSdLazyCounter, 3183 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1910 SdHoareTripleChecker+Valid, 9460 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:32,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1910 Valid, 9460 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3183 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-17 23:43:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7486 states. [2022-01-17 23:43:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7486 to 4636. [2022-01-17 23:43:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4636 states, 4633 states have (on average 2.0500755450032377) internal successors, (9498), 4635 states have internal predecessors, (9498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 9498 transitions. [2022-01-17 23:43:32,410 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 9498 transitions. Word has length 99 [2022-01-17 23:43:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:32,410 INFO L470 AbstractCegarLoop]: Abstraction has 4636 states and 9498 transitions. [2022-01-17 23:43:32,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 9498 transitions. [2022-01-17 23:43:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:43:32,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:32,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:43:32,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-17 23:43:32,414 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:43:32,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash 704750963, now seen corresponding path program 4 times [2022-01-17 23:43:32,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:32,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536668862] [2022-01-17 23:43:32,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:32,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:33,246 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-17 23:43:33,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:33,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536668862] [2022-01-17 23:43:33,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536668862] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:33,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:33,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:43:33,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874828159] [2022-01-17 23:43:33,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:33,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:43:33,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:33,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:43:33,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:43:33,247 INFO L87 Difference]: Start difference. First operand 4636 states and 9498 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:37,745 INFO L93 Difference]: Finished difference Result 6454 states and 13227 transitions. [2022-01-17 23:43:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:43:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:43:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:37,751 INFO L225 Difference]: With dead ends: 6454 [2022-01-17 23:43:37,752 INFO L226 Difference]: Without dead ends: 6454 [2022-01-17 23:43:37,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=941, Invalid=4609, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:43:37,752 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 1644 mSDsluCounter, 9968 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 10530 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:37,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1644 Valid, 10530 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3642 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:43:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6454 states. [2022-01-17 23:43:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6454 to 4636. [2022-01-17 23:43:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4636 states, 4633 states have (on average 2.0500755450032377) internal successors, (9498), 4635 states have internal predecessors, (9498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 9498 transitions. [2022-01-17 23:43:37,796 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 9498 transitions. Word has length 99 [2022-01-17 23:43:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:37,796 INFO L470 AbstractCegarLoop]: Abstraction has 4636 states and 9498 transitions. [2022-01-17 23:43:37,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 9498 transitions. [2022-01-17 23:43:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:43:37,799 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:37,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:43:37,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-17 23:43:37,800 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:43:37,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:37,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1980365383, now seen corresponding path program 5 times [2022-01-17 23:43:37,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:37,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750105316] [2022-01-17 23:43:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:37,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:38,662 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-17 23:43:38,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:38,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750105316] [2022-01-17 23:43:38,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750105316] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:38,663 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:38,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:43:38,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788549494] [2022-01-17 23:43:38,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:38,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:43:38,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:38,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:43:38,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:43:38,664 INFO L87 Difference]: Start difference. First operand 4636 states and 9498 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:43,256 INFO L93 Difference]: Finished difference Result 6539 states and 13414 transitions. [2022-01-17 23:43:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:43:43,256 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:43:43,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:43,262 INFO L225 Difference]: With dead ends: 6539 [2022-01-17 23:43:43,262 INFO L226 Difference]: Without dead ends: 6539 [2022-01-17 23:43:43,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:43:43,263 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 1662 mSDsluCounter, 8914 mSDsCounter, 0 mSdLazyCounter, 3376 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 9466 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:43,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1662 Valid, 9466 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3376 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:43:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2022-01-17 23:43:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 4653. [2022-01-17 23:43:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4653 states, 4650 states have (on average 2.0498924731182795) internal successors, (9532), 4652 states have internal predecessors, (9532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 9532 transitions. [2022-01-17 23:43:43,307 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 9532 transitions. Word has length 99 [2022-01-17 23:43:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:43,307 INFO L470 AbstractCegarLoop]: Abstraction has 4653 states and 9532 transitions. [2022-01-17 23:43:43,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 9532 transitions. [2022-01-17 23:43:43,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:43:43,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:43,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:43:43,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-17 23:43:43,311 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:43:43,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash 132152027, now seen corresponding path program 6 times [2022-01-17 23:43:43,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:43,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619773899] [2022-01-17 23:43:43,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:43,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:44,236 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-17 23:43:44,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:44,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619773899] [2022-01-17 23:43:44,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619773899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:44,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:44,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:43:44,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409916333] [2022-01-17 23:43:44,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:44,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:43:44,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:43:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:43:44,238 INFO L87 Difference]: Start difference. First operand 4653 states and 9532 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:48,820 INFO L93 Difference]: Finished difference Result 6590 states and 13516 transitions. [2022-01-17 23:43:48,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:43:48,820 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:43:48,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:48,826 INFO L225 Difference]: With dead ends: 6590 [2022-01-17 23:43:48,826 INFO L226 Difference]: Without dead ends: 6590 [2022-01-17 23:43:48,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:43:48,827 INFO L933 BasicCegarLoop]: 551 mSDtfsCounter, 1731 mSDsluCounter, 9498 mSDsCounter, 0 mSdLazyCounter, 3579 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 10049 SdHoareTripleChecker+Invalid, 3621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:48,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1731 Valid, 10049 Invalid, 3621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3579 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:43:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states. [2022-01-17 23:43:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 4687. [2022-01-17 23:43:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 4684 states have (on average 2.049530315969257) internal successors, (9600), 4686 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 9600 transitions. [2022-01-17 23:43:48,870 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 9600 transitions. Word has length 99 [2022-01-17 23:43:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:48,870 INFO L470 AbstractCegarLoop]: Abstraction has 4687 states and 9600 transitions. [2022-01-17 23:43:48,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 9600 transitions. [2022-01-17 23:43:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:43:48,873 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:48,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:43:48,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-17 23:43:48,873 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:43:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1855634331, now seen corresponding path program 7 times [2022-01-17 23:43:48,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:48,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47974543] [2022-01-17 23:43:48,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:48,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:49,841 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-17 23:43:49,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:49,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47974543] [2022-01-17 23:43:49,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47974543] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:49,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:49,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-17 23:43:49,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272870012] [2022-01-17 23:43:49,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:49,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-17 23:43:49,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:49,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-17 23:43:49,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1170, Unknown=0, NotChecked=0, Total=1260 [2022-01-17 23:43:49,843 INFO L87 Difference]: Start difference. First operand 4687 states and 9600 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:55,456 INFO L93 Difference]: Finished difference Result 7348 states and 15076 transitions. [2022-01-17 23:43:55,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-17 23:43:55,456 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:43:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:55,464 INFO L225 Difference]: With dead ends: 7348 [2022-01-17 23:43:55,464 INFO L226 Difference]: Without dead ends: 7348 [2022-01-17 23:43:55,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1132, Invalid=5674, Unknown=0, NotChecked=0, Total=6806 [2022-01-17 23:43:55,465 INFO L933 BasicCegarLoop]: 559 mSDtfsCounter, 1812 mSDsluCounter, 10150 mSDsCounter, 0 mSdLazyCounter, 4152 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1812 SdHoareTripleChecker+Valid, 10709 SdHoareTripleChecker+Invalid, 4195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:55,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1812 Valid, 10709 Invalid, 4195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4152 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:43:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7348 states. [2022-01-17 23:43:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7348 to 5037. [2022-01-17 23:43:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5037 states, 5034 states have (on average 2.053237981724275) internal successors, (10336), 5036 states have internal predecessors, (10336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5037 states to 5037 states and 10336 transitions. [2022-01-17 23:43:55,529 INFO L78 Accepts]: Start accepts. Automaton has 5037 states and 10336 transitions. Word has length 99 [2022-01-17 23:43:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:55,529 INFO L470 AbstractCegarLoop]: Abstraction has 5037 states and 10336 transitions. [2022-01-17 23:43:55,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 5037 states and 10336 transitions. [2022-01-17 23:43:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:43:55,533 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:55,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:43:55,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-17 23:43:55,533 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:43:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:55,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1337266985, now seen corresponding path program 8 times [2022-01-17 23:43:55,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:55,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403149631] [2022-01-17 23:43:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:55,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:56,415 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-17 23:43:56,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:56,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403149631] [2022-01-17 23:43:56,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403149631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:56,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:56,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:43:56,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891825669] [2022-01-17 23:43:56,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:56,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:43:56,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:56,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:43:56,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:43:56,416 INFO L87 Difference]: Start difference. First operand 5037 states and 10336 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:01,072 INFO L93 Difference]: Finished difference Result 8127 states and 16682 transitions. [2022-01-17 23:44:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:44:01,072 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:44:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:01,080 INFO L225 Difference]: With dead ends: 8127 [2022-01-17 23:44:01,081 INFO L226 Difference]: Without dead ends: 8127 [2022-01-17 23:44:01,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=946, Invalid=4604, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:44:01,081 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 1648 mSDsluCounter, 9852 mSDsCounter, 0 mSdLazyCounter, 3752 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 10407 SdHoareTripleChecker+Invalid, 3787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:01,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1648 Valid, 10407 Invalid, 3787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3752 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:44:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8127 states. [2022-01-17 23:44:01,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8127 to 4738. [2022-01-17 23:44:01,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4738 states, 4735 states have (on average 2.048996832101373) internal successors, (9702), 4737 states have internal predecessors, (9702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4738 states to 4738 states and 9702 transitions. [2022-01-17 23:44:01,129 INFO L78 Accepts]: Start accepts. Automaton has 4738 states and 9702 transitions. Word has length 99 [2022-01-17 23:44:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:01,130 INFO L470 AbstractCegarLoop]: Abstraction has 4738 states and 9702 transitions. [2022-01-17 23:44:01,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4738 states and 9702 transitions. [2022-01-17 23:44:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:44:01,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:01,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:44:01,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-17 23:44:01,146 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:44:01,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:01,146 INFO L85 PathProgramCache]: Analyzing trace with hash 627083385, now seen corresponding path program 9 times [2022-01-17 23:44:01,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:01,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648386432] [2022-01-17 23:44:01,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:01,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:02,009 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-17 23:44:02,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:02,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648386432] [2022-01-17 23:44:02,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648386432] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:02,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:02,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:44:02,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059637663] [2022-01-17 23:44:02,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:02,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:44:02,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:02,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:44:02,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:44:02,011 INFO L87 Difference]: Start difference. First operand 4738 states and 9702 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:06,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:06,373 INFO L93 Difference]: Finished difference Result 6743 states and 13822 transitions. [2022-01-17 23:44:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:44:06,373 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:44:06,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:06,380 INFO L225 Difference]: With dead ends: 6743 [2022-01-17 23:44:06,380 INFO L226 Difference]: Without dead ends: 6743 [2022-01-17 23:44:06,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=946, Invalid=4604, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:44:06,381 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 1606 mSDsluCounter, 8943 mSDsCounter, 0 mSdLazyCounter, 3283 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 9500 SdHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:06,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1606 Valid, 9500 Invalid, 3317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3283 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-17 23:44:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2022-01-17 23:44:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 4755. [2022-01-17 23:44:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4755 states, 4752 states have (on average 2.048821548821549) internal successors, (9736), 4754 states have internal predecessors, (9736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 9736 transitions. [2022-01-17 23:44:06,429 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 9736 transitions. Word has length 99 [2022-01-17 23:44:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:06,429 INFO L470 AbstractCegarLoop]: Abstraction has 4755 states and 9736 transitions. [2022-01-17 23:44:06,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 9736 transitions. [2022-01-17 23:44:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:44:06,433 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:06,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:44:06,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-17 23:44:06,433 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:44:06,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash 201193627, now seen corresponding path program 10 times [2022-01-17 23:44:06,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:06,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681010493] [2022-01-17 23:44:06,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:06,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:07,466 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-17 23:44:07,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:07,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681010493] [2022-01-17 23:44:07,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681010493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:07,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:07,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-17 23:44:07,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279364518] [2022-01-17 23:44:07,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:07,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-17 23:44:07,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-17 23:44:07,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2022-01-17 23:44:07,468 INFO L87 Difference]: Start difference. First operand 4755 states and 9736 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:12,860 INFO L93 Difference]: Finished difference Result 7450 states and 15280 transitions. [2022-01-17 23:44:12,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-17 23:44:12,860 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:44:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:12,868 INFO L225 Difference]: With dead ends: 7450 [2022-01-17 23:44:12,868 INFO L226 Difference]: Without dead ends: 7450 [2022-01-17 23:44:12,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1131, Invalid=5675, Unknown=0, NotChecked=0, Total=6806 [2022-01-17 23:44:12,869 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 1881 mSDsluCounter, 8799 mSDsCounter, 0 mSdLazyCounter, 3503 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 9361 SdHoareTripleChecker+Invalid, 3547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:12,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1881 Valid, 9361 Invalid, 3547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3503 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:44:12,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7450 states. [2022-01-17 23:44:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7450 to 5139. [2022-01-17 23:44:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5139 states, 5136 states have (on average 2.0521806853582554) internal successors, (10540), 5138 states have internal predecessors, (10540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 10540 transitions. [2022-01-17 23:44:12,931 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 10540 transitions. Word has length 99 [2022-01-17 23:44:12,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:12,931 INFO L470 AbstractCegarLoop]: Abstraction has 5139 states and 10540 transitions. [2022-01-17 23:44:12,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:12,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 10540 transitions. [2022-01-17 23:44:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:44:12,935 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:12,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:44:12,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-17 23:44:12,935 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:44:12,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1303259607, now seen corresponding path program 11 times [2022-01-17 23:44:12,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:12,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085280501] [2022-01-17 23:44:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:12,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:13,860 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-17 23:44:13,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:13,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085280501] [2022-01-17 23:44:13,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085280501] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:13,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:13,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:44:13,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422574218] [2022-01-17 23:44:13,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:13,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:44:13,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:13,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:44:13,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:44:13,861 INFO L87 Difference]: Start difference. First operand 5139 states and 10540 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:18,353 INFO L93 Difference]: Finished difference Result 8229 states and 16886 transitions. [2022-01-17 23:44:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:44:18,353 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:44:18,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:18,361 INFO L225 Difference]: With dead ends: 8229 [2022-01-17 23:44:18,361 INFO L226 Difference]: Without dead ends: 8229 [2022-01-17 23:44:18,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:44:18,362 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 1591 mSDsluCounter, 9272 mSDsCounter, 0 mSdLazyCounter, 3456 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 9830 SdHoareTripleChecker+Invalid, 3489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:18,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1591 Valid, 9830 Invalid, 3489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3456 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:44:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2022-01-17 23:44:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 4772. [2022-01-17 23:44:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4772 states, 4769 states have (on average 2.0486475152023487) internal successors, (9770), 4771 states have internal predecessors, (9770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4772 states to 4772 states and 9770 transitions. [2022-01-17 23:44:18,412 INFO L78 Accepts]: Start accepts. Automaton has 4772 states and 9770 transitions. Word has length 99 [2022-01-17 23:44:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:18,412 INFO L470 AbstractCegarLoop]: Abstraction has 4772 states and 9770 transitions. [2022-01-17 23:44:18,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4772 states and 9770 transitions. [2022-01-17 23:44:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:44:18,415 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:18,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:44:18,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-17 23:44:18,416 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:44:18,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:18,416 INFO L85 PathProgramCache]: Analyzing trace with hash -234690567, now seen corresponding path program 12 times [2022-01-17 23:44:18,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:18,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619654594] [2022-01-17 23:44:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:18,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:19,416 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-17 23:44:19,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:19,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619654594] [2022-01-17 23:44:19,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619654594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:19,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:19,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-17 23:44:19,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653525678] [2022-01-17 23:44:19,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:19,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-17 23:44:19,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:19,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-17 23:44:19,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2022-01-17 23:44:19,418 INFO L87 Difference]: Start difference. First operand 4772 states and 9770 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:25,019 INFO L93 Difference]: Finished difference Result 7518 states and 15416 transitions. [2022-01-17 23:44:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-17 23:44:25,020 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:44:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:25,027 INFO L225 Difference]: With dead ends: 7518 [2022-01-17 23:44:25,027 INFO L226 Difference]: Without dead ends: 7518 [2022-01-17 23:44:25,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1131, Invalid=5675, Unknown=0, NotChecked=0, Total=6806 [2022-01-17 23:44:25,027 INFO L933 BasicCegarLoop]: 564 mSDtfsCounter, 1855 mSDsluCounter, 10952 mSDsCounter, 0 mSdLazyCounter, 4341 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 11516 SdHoareTripleChecker+Invalid, 4386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:25,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1855 Valid, 11516 Invalid, 4386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 4341 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-17 23:44:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7518 states. [2022-01-17 23:44:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7518 to 5207. [2022-01-17 23:44:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5207 states, 5204 states have (on average 2.051498847040738) internal successors, (10676), 5206 states have internal predecessors, (10676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5207 states to 5207 states and 10676 transitions. [2022-01-17 23:44:25,074 INFO L78 Accepts]: Start accepts. Automaton has 5207 states and 10676 transitions. Word has length 99 [2022-01-17 23:44:25,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:25,074 INFO L470 AbstractCegarLoop]: Abstraction has 5207 states and 10676 transitions. [2022-01-17 23:44:25,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 5207 states and 10676 transitions. [2022-01-17 23:44:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:44:25,078 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:25,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:44:25,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-17 23:44:25,078 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:44:25,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash 867375413, now seen corresponding path program 13 times [2022-01-17 23:44:25,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:25,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556069699] [2022-01-17 23:44:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:25,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:26,145 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-17 23:44:26,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:26,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556069699] [2022-01-17 23:44:26,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556069699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:26,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:26,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-17 23:44:26,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811689221] [2022-01-17 23:44:26,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:26,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-17 23:44:26,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:26,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-17 23:44:26,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332 [2022-01-17 23:44:26,147 INFO L87 Difference]: Start difference. First operand 5207 states and 10676 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:32,606 INFO L93 Difference]: Finished difference Result 9846 states and 20243 transitions. [2022-01-17 23:44:32,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-17 23:44:32,607 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:44:32,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:32,616 INFO L225 Difference]: With dead ends: 9846 [2022-01-17 23:44:32,616 INFO L226 Difference]: Without dead ends: 9846 [2022-01-17 23:44:32,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1411, Invalid=7145, Unknown=0, NotChecked=0, Total=8556 [2022-01-17 23:44:32,617 INFO L933 BasicCegarLoop]: 568 mSDtfsCounter, 2129 mSDsluCounter, 11115 mSDsCounter, 0 mSdLazyCounter, 4472 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 11683 SdHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 4472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:32,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2129 Valid, 11683 Invalid, 4532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 4472 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-17 23:44:32,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states. [2022-01-17 23:44:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 5245. [2022-01-17 23:44:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5245 states, 5242 states have (on average 2.0507439908431895) internal successors, (10750), 5244 states have internal predecessors, (10750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5245 states to 5245 states and 10750 transitions. [2022-01-17 23:44:32,672 INFO L78 Accepts]: Start accepts. Automaton has 5245 states and 10750 transitions. Word has length 99 [2022-01-17 23:44:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:32,672 INFO L470 AbstractCegarLoop]: Abstraction has 5245 states and 10750 transitions. [2022-01-17 23:44:32,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5245 states and 10750 transitions. [2022-01-17 23:44:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:44:32,675 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:32,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:44:32,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-17 23:44:32,676 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:44:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:32,676 INFO L85 PathProgramCache]: Analyzing trace with hash -625515723, now seen corresponding path program 14 times [2022-01-17 23:44:32,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:32,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587587213] [2022-01-17 23:44:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:32,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:33,676 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-17 23:44:33,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:33,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587587213] [2022-01-17 23:44:33,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587587213] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:33,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:33,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-17 23:44:33,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587024920] [2022-01-17 23:44:33,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:33,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-17 23:44:33,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:33,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-17 23:44:33,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2022-01-17 23:44:33,678 INFO L87 Difference]: Start difference. First operand 5245 states and 10750 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:40,481 INFO L93 Difference]: Finished difference Result 9883 states and 20302 transitions. [2022-01-17 23:44:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-17 23:44:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:44:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:40,491 INFO L225 Difference]: With dead ends: 9883 [2022-01-17 23:44:40,491 INFO L226 Difference]: Without dead ends: 9883 [2022-01-17 23:44:40,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1745 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1408, Invalid=7148, Unknown=0, NotChecked=0, Total=8556 [2022-01-17 23:44:40,492 INFO L933 BasicCegarLoop]: 722 mSDtfsCounter, 1901 mSDsluCounter, 12857 mSDsCounter, 0 mSdLazyCounter, 4910 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 4969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:40,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1901 Valid, 13579 Invalid, 4969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4910 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-17 23:44:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9883 states. [2022-01-17 23:44:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9883 to 5095. [2022-01-17 23:44:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5092 states have (on average 2.0489002356637864) internal successors, (10433), 5094 states have internal predecessors, (10433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 10433 transitions. [2022-01-17 23:44:40,554 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 10433 transitions. Word has length 99 [2022-01-17 23:44:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:40,554 INFO L470 AbstractCegarLoop]: Abstraction has 5095 states and 10433 transitions. [2022-01-17 23:44:40,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 10433 transitions. [2022-01-17 23:44:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:44:40,558 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:40,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:44:40,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-17 23:44:40,559 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:44:40,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:40,559 INFO L85 PathProgramCache]: Analyzing trace with hash 658198483, now seen corresponding path program 15 times [2022-01-17 23:44:40,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:40,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539485154] [2022-01-17 23:44:40,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:40,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:41,391 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-17 23:44:41,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:41,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539485154] [2022-01-17 23:44:41,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539485154] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:41,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:41,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:44:41,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445235900] [2022-01-17 23:44:41,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:41,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:44:41,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:41,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:44:41,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:44:41,392 INFO L87 Difference]: Start difference. First operand 5095 states and 10433 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:45,804 INFO L93 Difference]: Finished difference Result 8286 states and 16996 transitions. [2022-01-17 23:44:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:44:45,805 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:44:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:45,815 INFO L225 Difference]: With dead ends: 8286 [2022-01-17 23:44:45,815 INFO L226 Difference]: Without dead ends: 8286 [2022-01-17 23:44:45,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:44:45,816 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 1806 mSDsluCounter, 8346 mSDsCounter, 0 mSdLazyCounter, 3149 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1806 SdHoareTripleChecker+Valid, 8906 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:45,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1806 Valid, 8906 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3149 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-17 23:44:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8286 states. [2022-01-17 23:44:45,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 4823. [2022-01-17 23:44:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 4820 states have (on average 2.0481327800829874) internal successors, (9872), 4822 states have internal predecessors, (9872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 9872 transitions. [2022-01-17 23:44:45,887 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 9872 transitions. Word has length 99 [2022-01-17 23:44:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:45,887 INFO L470 AbstractCegarLoop]: Abstraction has 4823 states and 9872 transitions. [2022-01-17 23:44:45,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 9872 transitions. [2022-01-17 23:44:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:44:45,892 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:45,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:44:45,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-17 23:44:45,892 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:44:45,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:45,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1242529499, now seen corresponding path program 16 times [2022-01-17 23:44:45,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:45,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769649853] [2022-01-17 23:44:45,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:45,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:46,782 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-17 23:44:46,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:46,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769649853] [2022-01-17 23:44:46,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769649853] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:46,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:46,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:44:46,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307141023] [2022-01-17 23:44:46,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:46,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:44:46,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:46,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:44:46,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:44:46,784 INFO L87 Difference]: Start difference. First operand 4823 states and 9872 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:51,443 INFO L93 Difference]: Finished difference Result 6556 states and 13431 transitions. [2022-01-17 23:44:51,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:44:51,443 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:44:51,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:51,449 INFO L225 Difference]: With dead ends: 6556 [2022-01-17 23:44:51,449 INFO L226 Difference]: Without dead ends: 6556 [2022-01-17 23:44:51,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=946, Invalid=4604, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:44:51,450 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 1517 mSDsluCounter, 10460 mSDsCounter, 0 mSdLazyCounter, 3924 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 11025 SdHoareTripleChecker+Invalid, 3958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:51,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1517 Valid, 11025 Invalid, 3958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3924 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:44:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6556 states. [2022-01-17 23:44:51,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6556 to 4823. [2022-01-17 23:44:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 4820 states have (on average 2.0481327800829874) internal successors, (9872), 4822 states have internal predecessors, (9872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 9872 transitions. [2022-01-17 23:44:51,495 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 9872 transitions. Word has length 99 [2022-01-17 23:44:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:51,495 INFO L470 AbstractCegarLoop]: Abstraction has 4823 states and 9872 transitions. [2022-01-17 23:44:51,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 9872 transitions. [2022-01-17 23:44:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:44:51,499 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:51,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:44:51,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-17 23:44:51,499 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:44:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1850403261, now seen corresponding path program 17 times [2022-01-17 23:44:51,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:51,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920986160] [2022-01-17 23:44:51,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:51,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:52,456 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-17 23:44:52,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:52,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920986160] [2022-01-17 23:44:52,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920986160] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:52,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:52,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:44:52,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418361987] [2022-01-17 23:44:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:52,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:44:52,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:52,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:44:52,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:44:52,460 INFO L87 Difference]: Start difference. First operand 4823 states and 9872 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:56,921 INFO L93 Difference]: Finished difference Result 6872 states and 14102 transitions. [2022-01-17 23:44:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:44:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:44:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:56,928 INFO L225 Difference]: With dead ends: 6872 [2022-01-17 23:44:56,928 INFO L226 Difference]: Without dead ends: 6872 [2022-01-17 23:44:56,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:44:56,929 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 1580 mSDsluCounter, 8894 mSDsCounter, 0 mSdLazyCounter, 3331 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 9452 SdHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:56,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1580 Valid, 9452 Invalid, 3366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3331 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-17 23:44:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6872 states. [2022-01-17 23:44:56,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6872 to 4858. [2022-01-17 23:44:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4858 states, 4855 states have (on average 2.048403707518023) internal successors, (9945), 4857 states have internal predecessors, (9945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4858 states to 4858 states and 9945 transitions. [2022-01-17 23:44:56,990 INFO L78 Accepts]: Start accepts. Automaton has 4858 states and 9945 transitions. Word has length 99 [2022-01-17 23:44:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:56,990 INFO L470 AbstractCegarLoop]: Abstraction has 4858 states and 9945 transitions. [2022-01-17 23:44:56,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4858 states and 9945 transitions. [2022-01-17 23:44:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:44:56,993 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:56,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:44:56,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-17 23:44:56,994 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:44:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1757759749, now seen corresponding path program 18 times [2022-01-17 23:44:56,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:56,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839683563] [2022-01-17 23:44:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:56,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:57,865 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-17 23:44:57,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:57,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839683563] [2022-01-17 23:44:57,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839683563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:57,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:57,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:44:57,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717049532] [2022-01-17 23:44:57,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:57,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:44:57,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:57,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:44:57,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:44:57,867 INFO L87 Difference]: Start difference. First operand 4858 states and 9945 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:03,077 INFO L93 Difference]: Finished difference Result 8931 states and 18348 transitions. [2022-01-17 23:45:03,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:45:03,078 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:45:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:03,086 INFO L225 Difference]: With dead ends: 8931 [2022-01-17 23:45:03,086 INFO L226 Difference]: Without dead ends: 8931 [2022-01-17 23:45:03,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1066, Invalid=5096, Unknown=0, NotChecked=0, Total=6162 [2022-01-17 23:45:03,087 INFO L933 BasicCegarLoop]: 604 mSDtfsCounter, 1665 mSDsluCounter, 10703 mSDsCounter, 0 mSdLazyCounter, 3953 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 11307 SdHoareTripleChecker+Invalid, 3994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:03,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1665 Valid, 11307 Invalid, 3994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3953 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:45:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8931 states. [2022-01-17 23:45:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8931 to 4860. [2022-01-17 23:45:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4860 states, 4857 states have (on average 2.0483837759934116) internal successors, (9949), 4859 states have internal predecessors, (9949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 9949 transitions. [2022-01-17 23:45:03,140 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 9949 transitions. Word has length 99 [2022-01-17 23:45:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:03,141 INFO L470 AbstractCegarLoop]: Abstraction has 4860 states and 9949 transitions. [2022-01-17 23:45:03,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 9949 transitions. [2022-01-17 23:45:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:45:03,144 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:03,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:45:03,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-17 23:45:03,144 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:45:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1330038123, now seen corresponding path program 19 times [2022-01-17 23:45:03,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:03,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923811083] [2022-01-17 23:45:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:03,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:03,918 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-17 23:45:03,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:03,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923811083] [2022-01-17 23:45:03,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923811083] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:03,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:03,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:45:03,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089580788] [2022-01-17 23:45:03,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:03,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:45:03,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:03,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:45:03,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:45:03,919 INFO L87 Difference]: Start difference. First operand 4860 states and 9949 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:08,698 INFO L93 Difference]: Finished difference Result 6973 states and 14306 transitions. [2022-01-17 23:45:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:45:08,699 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:45:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:08,707 INFO L225 Difference]: With dead ends: 6973 [2022-01-17 23:45:08,707 INFO L226 Difference]: Without dead ends: 6973 [2022-01-17 23:45:08,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=940, Invalid=4610, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:45:08,708 INFO L933 BasicCegarLoop]: 572 mSDtfsCounter, 1557 mSDsluCounter, 9787 mSDsCounter, 0 mSdLazyCounter, 3736 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 10359 SdHoareTripleChecker+Invalid, 3770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:08,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1557 Valid, 10359 Invalid, 3770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3736 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:45:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6973 states. [2022-01-17 23:45:08,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6973 to 4842. [2022-01-17 23:45:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4842 states, 4839 states have (on average 2.048150444306675) internal successors, (9911), 4841 states have internal predecessors, (9911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4842 states to 4842 states and 9911 transitions. [2022-01-17 23:45:08,773 INFO L78 Accepts]: Start accepts. Automaton has 4842 states and 9911 transitions. Word has length 99 [2022-01-17 23:45:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:08,774 INFO L470 AbstractCegarLoop]: Abstraction has 4842 states and 9911 transitions. [2022-01-17 23:45:08,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4842 states and 9911 transitions. [2022-01-17 23:45:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:45:08,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:08,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:45:08,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-17 23:45:08,777 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:45:08,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash 969706245, now seen corresponding path program 20 times [2022-01-17 23:45:08,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:08,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905386950] [2022-01-17 23:45:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:08,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:09,572 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-17 23:45:09,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:09,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905386950] [2022-01-17 23:45:09,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905386950] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:09,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:09,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:45:09,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256435851] [2022-01-17 23:45:09,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:09,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:45:09,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:09,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:45:09,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:45:09,574 INFO L87 Difference]: Start difference. First operand 4842 states and 9911 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:15,278 INFO L93 Difference]: Finished difference Result 7878 states and 16150 transitions. [2022-01-17 23:45:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-17 23:45:15,279 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:45:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:15,288 INFO L225 Difference]: With dead ends: 7878 [2022-01-17 23:45:15,288 INFO L226 Difference]: Without dead ends: 7878 [2022-01-17 23:45:15,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1181, Invalid=5461, Unknown=0, NotChecked=0, Total=6642 [2022-01-17 23:45:15,289 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 1751 mSDsluCounter, 11520 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 12117 SdHoareTripleChecker+Invalid, 4070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:15,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1751 Valid, 12117 Invalid, 4070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4030 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:45:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2022-01-17 23:45:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 4872. [2022-01-17 23:45:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions. [2022-01-17 23:45:15,352 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99 [2022-01-17 23:45:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:15,352 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions. [2022-01-17 23:45:15,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions. [2022-01-17 23:45:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:45:15,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:15,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:45:15,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-17 23:45:15,357 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:45:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash 948513173, now seen corresponding path program 21 times [2022-01-17 23:45:15,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:15,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867988154] [2022-01-17 23:45:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:15,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:16,390 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-17 23:45:16,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:16,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867988154] [2022-01-17 23:45:16,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867988154] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:16,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:16,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:45:16,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648097734] [2022-01-17 23:45:16,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:16,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:45:16,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:16,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:45:16,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:45:16,392 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:21,644 INFO L93 Difference]: Finished difference Result 7785 states and 15957 transitions. [2022-01-17 23:45:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:45:21,644 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:45:21,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:21,652 INFO L225 Difference]: With dead ends: 7785 [2022-01-17 23:45:21,652 INFO L226 Difference]: Without dead ends: 7785 [2022-01-17 23:45:21,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1060, Invalid=5102, Unknown=0, NotChecked=0, Total=6162 [2022-01-17 23:45:21,653 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 1929 mSDsluCounter, 10135 mSDsCounter, 0 mSdLazyCounter, 3759 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 10714 SdHoareTripleChecker+Invalid, 3800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:21,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1929 Valid, 10714 Invalid, 3800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3759 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:45:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7785 states. [2022-01-17 23:45:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7785 to 4874. [2022-01-17 23:45:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4871 states have (on average 2.048039416957504) internal successors, (9976), 4873 states have internal predecessors, (9976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 9976 transitions. [2022-01-17 23:45:21,711 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 9976 transitions. Word has length 99 [2022-01-17 23:45:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:21,711 INFO L470 AbstractCegarLoop]: Abstraction has 4874 states and 9976 transitions. [2022-01-17 23:45:21,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 9976 transitions. [2022-01-17 23:45:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:45:21,715 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:21,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:45:21,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-17 23:45:21,715 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:45:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:21,715 INFO L85 PathProgramCache]: Analyzing trace with hash -885464299, now seen corresponding path program 22 times [2022-01-17 23:45:21,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:21,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046303163] [2022-01-17 23:45:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:21,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:22,668 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-17 23:45:22,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:22,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046303163] [2022-01-17 23:45:22,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046303163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:22,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:22,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:45:22,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753100615] [2022-01-17 23:45:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:22,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:45:22,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:45:22,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:45:22,669 INFO L87 Difference]: Start difference. First operand 4874 states and 9976 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:27,561 INFO L93 Difference]: Finished difference Result 6740 states and 13803 transitions. [2022-01-17 23:45:27,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:45:27,562 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:45:27,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:27,569 INFO L225 Difference]: With dead ends: 6740 [2022-01-17 23:45:27,569 INFO L226 Difference]: Without dead ends: 6740 [2022-01-17 23:45:27,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=951, Invalid=4749, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:45:27,570 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 1521 mSDsluCounter, 10686 mSDsCounter, 0 mSdLazyCounter, 3957 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 11241 SdHoareTripleChecker+Invalid, 3997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:27,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 11241 Invalid, 3997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3957 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:45:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2022-01-17 23:45:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 4872. [2022-01-17 23:45:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions. [2022-01-17 23:45:27,618 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99 [2022-01-17 23:45:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:27,618 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions. [2022-01-17 23:45:27,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions. [2022-01-17 23:45:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:45:27,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:27,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:45:27,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-17 23:45:27,622 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:45:27,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash -917579705, now seen corresponding path program 23 times [2022-01-17 23:45:27,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:27,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021379569] [2022-01-17 23:45:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:27,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:28,758 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-17 23:45:28,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:28,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021379569] [2022-01-17 23:45:28,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021379569] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:28,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:28,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-17 23:45:28,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415912222] [2022-01-17 23:45:28,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:28,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-17 23:45:28,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:28,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-17 23:45:28,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1236, Unknown=0, NotChecked=0, Total=1332 [2022-01-17 23:45:28,759 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:34,964 INFO L93 Difference]: Finished difference Result 8263 states and 17009 transitions. [2022-01-17 23:45:34,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-17 23:45:34,964 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:45:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:34,972 INFO L225 Difference]: With dead ends: 8263 [2022-01-17 23:45:34,972 INFO L226 Difference]: Without dead ends: 8263 [2022-01-17 23:45:34,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1407, Invalid=7149, Unknown=0, NotChecked=0, Total=8556 [2022-01-17 23:45:34,973 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 2188 mSDsluCounter, 9560 mSDsCounter, 0 mSdLazyCounter, 3759 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 10127 SdHoareTripleChecker+Invalid, 3815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:34,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2188 Valid, 10127 Invalid, 3815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3759 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:45:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8263 states. [2022-01-17 23:45:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8263 to 5183. [2022-01-17 23:45:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 5180 states have (on average 2.0557915057915057) internal successors, (10649), 5182 states have internal predecessors, (10649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 10649 transitions. [2022-01-17 23:45:35,028 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 10649 transitions. Word has length 99 [2022-01-17 23:45:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:35,028 INFO L470 AbstractCegarLoop]: Abstraction has 5183 states and 10649 transitions. [2022-01-17 23:45:35,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 10649 transitions. [2022-01-17 23:45:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:45:35,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:35,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:45:35,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-17 23:45:35,031 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:45:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:35,032 INFO L85 PathProgramCache]: Analyzing trace with hash 184486275, now seen corresponding path program 24 times [2022-01-17 23:45:35,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:35,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482150082] [2022-01-17 23:45:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:35,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:35,916 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-17 23:45:35,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:35,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482150082] [2022-01-17 23:45:35,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482150082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:35,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:35,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:45:35,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986938109] [2022-01-17 23:45:35,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:35,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:45:35,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:35,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:45:35,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:45:35,917 INFO L87 Difference]: Start difference. First operand 5183 states and 10649 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:40,495 INFO L93 Difference]: Finished difference Result 8696 states and 17879 transitions. [2022-01-17 23:45:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:45:40,495 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:45:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:40,505 INFO L225 Difference]: With dead ends: 8696 [2022-01-17 23:45:40,505 INFO L226 Difference]: Without dead ends: 8696 [2022-01-17 23:45:40,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:45:40,506 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 1715 mSDsluCounter, 9215 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 9778 SdHoareTripleChecker+Invalid, 3480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:40,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1715 Valid, 9778 Invalid, 3480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:45:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8696 states. [2022-01-17 23:45:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8696 to 4890. [2022-01-17 23:45:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4887 states have (on average 2.04829138530796) internal successors, (10010), 4889 states have internal predecessors, (10010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 10010 transitions. [2022-01-17 23:45:40,570 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 10010 transitions. Word has length 99 [2022-01-17 23:45:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:40,570 INFO L470 AbstractCegarLoop]: Abstraction has 4890 states and 10010 transitions. [2022-01-17 23:45:40,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 10010 transitions. [2022-01-17 23:45:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:45:40,574 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:40,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:45:40,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-17 23:45:40,575 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:45:40,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:40,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1010223217, now seen corresponding path program 25 times [2022-01-17 23:45:40,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:40,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140762931] [2022-01-17 23:45:40,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:40,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:41,285 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-17 23:45:41,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:41,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140762931] [2022-01-17 23:45:41,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140762931] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:41,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:41,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:45:41,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152764220] [2022-01-17 23:45:41,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:41,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:45:41,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:41,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:45:41,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:45:41,287 INFO L87 Difference]: Start difference. First operand 4890 states and 10010 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:46,352 INFO L93 Difference]: Finished difference Result 9191 states and 18886 transitions. [2022-01-17 23:45:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:45:46,352 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:45:46,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:46,363 INFO L225 Difference]: With dead ends: 9191 [2022-01-17 23:45:46,363 INFO L226 Difference]: Without dead ends: 9191 [2022-01-17 23:45:46,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2022-01-17 23:45:46,364 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 1602 mSDsluCounter, 10636 mSDsCounter, 0 mSdLazyCounter, 3870 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 11245 SdHoareTripleChecker+Invalid, 3905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:46,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1602 Valid, 11245 Invalid, 3905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3870 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:45:46,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9191 states. [2022-01-17 23:45:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9191 to 4892. [2022-01-17 23:45:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 4889 states have (on average 2.048271630190223) internal successors, (10014), 4891 states have internal predecessors, (10014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 10014 transitions. [2022-01-17 23:45:46,456 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 10014 transitions. Word has length 99 [2022-01-17 23:45:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:46,456 INFO L470 AbstractCegarLoop]: Abstraction has 4892 states and 10014 transitions. [2022-01-17 23:45:46,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 10014 transitions. [2022-01-17 23:45:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:45:46,460 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:46,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:45:46,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-17 23:45:46,461 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:45:46,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:46,461 INFO L85 PathProgramCache]: Analyzing trace with hash 196946207, now seen corresponding path program 26 times [2022-01-17 23:45:46,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:46,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098349764] [2022-01-17 23:45:46,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:46,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:47,296 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-17 23:45:47,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:47,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098349764] [2022-01-17 23:45:47,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098349764] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:47,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:47,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:45:47,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293872612] [2022-01-17 23:45:47,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:47,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:45:47,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:47,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:45:47,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:45:47,297 INFO L87 Difference]: Start difference. First operand 4892 states and 10014 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:51,963 INFO L93 Difference]: Finished difference Result 7301 states and 14980 transitions. [2022-01-17 23:45:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:45:51,964 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:45:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:51,972 INFO L225 Difference]: With dead ends: 7301 [2022-01-17 23:45:51,972 INFO L226 Difference]: Without dead ends: 7301 [2022-01-17 23:45:51,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:45:51,972 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1726 mSDsluCounter, 9527 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 10104 SdHoareTripleChecker+Invalid, 3580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:51,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1726 Valid, 10104 Invalid, 3580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:45:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7301 states. [2022-01-17 23:45:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7301 to 4874. [2022-01-17 23:45:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4871 states have (on average 2.048039416957504) internal successors, (9976), 4873 states have internal predecessors, (9976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 9976 transitions. [2022-01-17 23:45:52,031 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 9976 transitions. Word has length 99 [2022-01-17 23:45:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:52,031 INFO L470 AbstractCegarLoop]: Abstraction has 4874 states and 9976 transitions. [2022-01-17 23:45:52,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 9976 transitions. [2022-01-17 23:45:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:45:52,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:52,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:45:52,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-17 23:45:52,035 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:45:52,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:52,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1806797157, now seen corresponding path program 27 times [2022-01-17 23:45:52,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:52,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463431582] [2022-01-17 23:45:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:52,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:53,134 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-17 23:45:53,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:53,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463431582] [2022-01-17 23:45:53,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463431582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:53,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:53,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-17 23:45:53,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136916437] [2022-01-17 23:45:53,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:53,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-17 23:45:53,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:53,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-17 23:45:53,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1172, Unknown=0, NotChecked=0, Total=1260 [2022-01-17 23:45:53,136 INFO L87 Difference]: Start difference. First operand 4874 states and 9976 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:59,055 INFO L93 Difference]: Finished difference Result 7661 states and 15725 transitions. [2022-01-17 23:45:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-17 23:45:59,055 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:45:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:59,065 INFO L225 Difference]: With dead ends: 7661 [2022-01-17 23:45:59,065 INFO L226 Difference]: Without dead ends: 7661 [2022-01-17 23:45:59,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1130, Invalid=5676, Unknown=0, NotChecked=0, Total=6806 [2022-01-17 23:45:59,066 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 1826 mSDsluCounter, 10712 mSDsCounter, 0 mSdLazyCounter, 4461 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 11277 SdHoareTripleChecker+Invalid, 4506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:59,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1826 Valid, 11277 Invalid, 4506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 4461 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-17 23:45:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7661 states. [2022-01-17 23:45:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7661 to 5139. [2022-01-17 23:45:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5139 states, 5136 states have (on average 2.052570093457944) internal successors, (10542), 5138 states have internal predecessors, (10542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 10542 transitions. [2022-01-17 23:45:59,145 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 10542 transitions. Word has length 99 [2022-01-17 23:45:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:59,145 INFO L470 AbstractCegarLoop]: Abstraction has 5139 states and 10542 transitions. [2022-01-17 23:45:59,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 10542 transitions. [2022-01-17 23:45:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:45:59,151 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:59,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:45:59,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-17 23:45:59,151 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:45:59,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:59,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1386104159, now seen corresponding path program 28 times [2022-01-17 23:45:59,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:59,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156289352] [2022-01-17 23:45:59,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:59,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:00,001 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-17 23:46:00,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:00,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156289352] [2022-01-17 23:46:00,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156289352] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:00,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:00,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:46:00,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22473355] [2022-01-17 23:46:00,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:00,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:46:00,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:00,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:46:00,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:46:00,003 INFO L87 Difference]: Start difference. First operand 5139 states and 10542 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:04,631 INFO L93 Difference]: Finished difference Result 8440 states and 17331 transitions. [2022-01-17 23:46:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:46:04,632 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:46:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:04,641 INFO L225 Difference]: With dead ends: 8440 [2022-01-17 23:46:04,641 INFO L226 Difference]: Without dead ends: 8440 [2022-01-17 23:46:04,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:46:04,642 INFO L933 BasicCegarLoop]: 561 mSDtfsCounter, 1581 mSDsluCounter, 9204 mSDsCounter, 0 mSdLazyCounter, 3517 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 9765 SdHoareTripleChecker+Invalid, 3551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:04,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1581 Valid, 9765 Invalid, 3551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3517 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:46:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8440 states. [2022-01-17 23:46:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8440 to 4872. [2022-01-17 23:46:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions. [2022-01-17 23:46:04,731 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99 [2022-01-17 23:46:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:04,731 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions. [2022-01-17 23:46:04,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions. [2022-01-17 23:46:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:46:04,735 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:04,735 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:46:04,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-17 23:46:04,735 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:46:04,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1671774703, now seen corresponding path program 29 times [2022-01-17 23:46:04,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:04,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526861946] [2022-01-17 23:46:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:04,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:05,705 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-17 23:46:05,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526861946] [2022-01-17 23:46:05,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526861946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:05,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:05,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-17 23:46:05,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810942901] [2022-01-17 23:46:05,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:05,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-17 23:46:05,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-17 23:46:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1168, Unknown=0, NotChecked=0, Total=1260 [2022-01-17 23:46:05,707 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:11,746 INFO L93 Difference]: Finished difference Result 7957 states and 16353 transitions. [2022-01-17 23:46:11,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-17 23:46:11,747 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:46:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:11,755 INFO L225 Difference]: With dead ends: 7957 [2022-01-17 23:46:11,755 INFO L226 Difference]: Without dead ends: 7957 [2022-01-17 23:46:11,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1134, Invalid=5672, Unknown=0, NotChecked=0, Total=6806 [2022-01-17 23:46:11,756 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1852 mSDsluCounter, 10718 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1852 SdHoareTripleChecker+Valid, 11285 SdHoareTripleChecker+Invalid, 4621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:11,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1852 Valid, 11285 Invalid, 4621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-17 23:46:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2022-01-17 23:46:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 5187. [2022-01-17 23:46:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5187 states, 5184 states have (on average 2.0557484567901234) internal successors, (10657), 5186 states have internal predecessors, (10657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 10657 transitions. [2022-01-17 23:46:11,813 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 10657 transitions. Word has length 99 [2022-01-17 23:46:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:11,813 INFO L470 AbstractCegarLoop]: Abstraction has 5187 states and 10657 transitions. [2022-01-17 23:46:11,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 10657 transitions. [2022-01-17 23:46:11,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:46:11,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:11,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:46:11,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-17 23:46:11,817 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:46:11,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:11,818 INFO L85 PathProgramCache]: Analyzing trace with hash -569708723, now seen corresponding path program 30 times [2022-01-17 23:46:11,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:11,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967459243] [2022-01-17 23:46:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:11,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:12,751 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-17 23:46:12,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:12,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967459243] [2022-01-17 23:46:12,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967459243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:12,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:12,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:46:12,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739058253] [2022-01-17 23:46:12,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:12,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:46:12,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:12,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:46:12,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:46:12,752 INFO L87 Difference]: Start difference. First operand 5187 states and 10657 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:17,539 INFO L93 Difference]: Finished difference Result 8753 states and 17993 transitions. [2022-01-17 23:46:17,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:46:17,543 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:46:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:17,553 INFO L225 Difference]: With dead ends: 8753 [2022-01-17 23:46:17,553 INFO L226 Difference]: Without dead ends: 8753 [2022-01-17 23:46:17,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:46:17,554 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 1548 mSDsluCounter, 10007 mSDsCounter, 0 mSdLazyCounter, 3909 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 10570 SdHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:17,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1548 Valid, 10570 Invalid, 3943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3909 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:46:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2022-01-17 23:46:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 4894. [2022-01-17 23:46:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4894 states, 4891 states have (on average 2.0482518912287877) internal successors, (10018), 4893 states have internal predecessors, (10018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 10018 transitions. [2022-01-17 23:46:17,618 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 10018 transitions. Word has length 99 [2022-01-17 23:46:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:17,618 INFO L470 AbstractCegarLoop]: Abstraction has 4894 states and 10018 transitions. [2022-01-17 23:46:17,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 10018 transitions. [2022-01-17 23:46:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:46:17,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:17,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:46:17,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-17 23:46:17,623 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:46:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:17,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1764418215, now seen corresponding path program 31 times [2022-01-17 23:46:17,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:17,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300569841] [2022-01-17 23:46:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:17,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:18,360 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-17 23:46:18,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:18,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300569841] [2022-01-17 23:46:18,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300569841] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:18,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:18,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:46:18,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84076729] [2022-01-17 23:46:18,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:18,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:46:18,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:18,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:46:18,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:46:18,362 INFO L87 Difference]: Start difference. First operand 4894 states and 10018 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:23,412 INFO L93 Difference]: Finished difference Result 9248 states and 19000 transitions. [2022-01-17 23:46:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:46:23,413 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:46:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:23,422 INFO L225 Difference]: With dead ends: 9248 [2022-01-17 23:46:23,422 INFO L226 Difference]: Without dead ends: 9248 [2022-01-17 23:46:23,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2022-01-17 23:46:23,423 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 1675 mSDsluCounter, 10211 mSDsCounter, 0 mSdLazyCounter, 3787 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 10820 SdHoareTripleChecker+Invalid, 3821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:23,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1675 Valid, 10820 Invalid, 3821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3787 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:46:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9248 states. [2022-01-17 23:46:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9248 to 4896. [2022-01-17 23:46:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4896 states, 4893 states have (on average 2.048232168403842) internal successors, (10022), 4895 states have internal predecessors, (10022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10022 transitions. [2022-01-17 23:46:23,488 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10022 transitions. Word has length 99 [2022-01-17 23:46:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:23,488 INFO L470 AbstractCegarLoop]: Abstraction has 4896 states and 10022 transitions. [2022-01-17 23:46:23,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10022 transitions. [2022-01-17 23:46:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:46:23,492 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:23,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:46:23,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-17 23:46:23,492 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:46:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash -557248791, now seen corresponding path program 32 times [2022-01-17 23:46:23,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:23,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409185528] [2022-01-17 23:46:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:23,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:24,339 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-17 23:46:24,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:24,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409185528] [2022-01-17 23:46:24,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409185528] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:24,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:24,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:46:24,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870651615] [2022-01-17 23:46:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:24,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:46:24,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:24,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:46:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:46:24,341 INFO L87 Difference]: Start difference. First operand 4896 states and 10022 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:29,042 INFO L93 Difference]: Finished difference Result 7358 states and 15094 transitions. [2022-01-17 23:46:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:46:29,042 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:46:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:29,051 INFO L225 Difference]: With dead ends: 7358 [2022-01-17 23:46:29,051 INFO L226 Difference]: Without dead ends: 7358 [2022-01-17 23:46:29,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:46:29,052 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1715 mSDsluCounter, 8754 mSDsCounter, 0 mSdLazyCounter, 3282 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 9331 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:29,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1715 Valid, 9331 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3282 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-17 23:46:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7358 states. [2022-01-17 23:46:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7358 to 4878. [2022-01-17 23:46:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4875 states have (on average 2.048) internal successors, (9984), 4877 states have internal predecessors, (9984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 9984 transitions. [2022-01-17 23:46:29,114 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 9984 transitions. Word has length 99 [2022-01-17 23:46:29,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:29,114 INFO L470 AbstractCegarLoop]: Abstraction has 4878 states and 9984 transitions. [2022-01-17 23:46:29,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 9984 transitions. [2022-01-17 23:46:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:46:29,118 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:29,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:46:29,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-17 23:46:29,118 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:46:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:29,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1052602159, now seen corresponding path program 33 times [2022-01-17 23:46:29,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:29,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639119889] [2022-01-17 23:46:29,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:29,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:29,948 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-17 23:46:29,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:29,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639119889] [2022-01-17 23:46:29,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639119889] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:29,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:29,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:46:29,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866368211] [2022-01-17 23:46:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:29,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:46:29,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:29,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:46:29,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:46:29,950 INFO L87 Difference]: Start difference. First operand 4878 states and 9984 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:34,694 INFO L93 Difference]: Finished difference Result 7386 states and 15167 transitions. [2022-01-17 23:46:34,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:46:34,694 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:46:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:34,702 INFO L225 Difference]: With dead ends: 7386 [2022-01-17 23:46:34,702 INFO L226 Difference]: Without dead ends: 7386 [2022-01-17 23:46:34,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:46:34,703 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1648 mSDsluCounter, 9926 mSDsCounter, 0 mSdLazyCounter, 3815 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 10493 SdHoareTripleChecker+Invalid, 3851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:34,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1648 Valid, 10493 Invalid, 3851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3815 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:46:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7386 states. [2022-01-17 23:46:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7386 to 4876. [2022-01-17 23:46:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4873 states have (on average 2.0480197003899034) internal successors, (9980), 4875 states have internal predecessors, (9980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 9980 transitions. [2022-01-17 23:46:34,758 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 9980 transitions. Word has length 99 [2022-01-17 23:46:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:34,759 INFO L470 AbstractCegarLoop]: Abstraction has 4876 states and 9980 transitions. [2022-01-17 23:46:34,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 9980 transitions. [2022-01-17 23:46:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:46:34,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:34,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:46:34,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-17 23:46:34,763 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:46:34,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:34,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1129847727, now seen corresponding path program 34 times [2022-01-17 23:46:34,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:34,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403638753] [2022-01-17 23:46:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:34,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:35,670 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-17 23:46:35,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:35,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403638753] [2022-01-17 23:46:35,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403638753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:35,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:35,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:46:35,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149025711] [2022-01-17 23:46:35,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:35,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:46:35,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:35,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:46:35,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:46:35,671 INFO L87 Difference]: Start difference. First operand 4876 states and 9980 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:40,292 INFO L93 Difference]: Finished difference Result 7043 states and 14445 transitions. [2022-01-17 23:46:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:46:40,292 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:46:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:40,300 INFO L225 Difference]: With dead ends: 7043 [2022-01-17 23:46:40,300 INFO L226 Difference]: Without dead ends: 7043 [2022-01-17 23:46:40,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:46:40,301 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 1739 mSDsluCounter, 8915 mSDsCounter, 0 mSdLazyCounter, 3532 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 9475 SdHoareTripleChecker+Invalid, 3571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:40,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1739 Valid, 9475 Invalid, 3571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3532 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:46:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7043 states. [2022-01-17 23:46:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7043 to 4872. [2022-01-17 23:46:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions. [2022-01-17 23:46:40,356 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99 [2022-01-17 23:46:40,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:40,356 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions. [2022-01-17 23:46:40,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions. [2022-01-17 23:46:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:46:40,360 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:40,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:46:40,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-17 23:46:40,360 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:46:40,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:40,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2006338119, now seen corresponding path program 35 times [2022-01-17 23:46:40,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:40,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265527796] [2022-01-17 23:46:40,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:40,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:41,302 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-17 23:46:41,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265527796] [2022-01-17 23:46:41,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265527796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:41,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:41,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:46:41,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227777559] [2022-01-17 23:46:41,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:41,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:46:41,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:41,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:46:41,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:46:41,304 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:46,028 INFO L93 Difference]: Finished difference Result 7396 states and 15187 transitions. [2022-01-17 23:46:46,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:46:46,028 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:46:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:46,037 INFO L225 Difference]: With dead ends: 7396 [2022-01-17 23:46:46,037 INFO L226 Difference]: Without dead ends: 7396 [2022-01-17 23:46:46,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:46:46,038 INFO L933 BasicCegarLoop]: 568 mSDtfsCounter, 1805 mSDsluCounter, 8932 mSDsCounter, 0 mSdLazyCounter, 3558 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1805 SdHoareTripleChecker+Valid, 9500 SdHoareTripleChecker+Invalid, 3596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:46,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1805 Valid, 9500 Invalid, 3596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3558 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:46:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7396 states. [2022-01-17 23:46:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7396 to 4900. [2022-01-17 23:46:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4900 states, 4897 states have (on average 2.0481927710843375) internal successors, (10030), 4899 states have internal predecessors, (10030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4900 states to 4900 states and 10030 transitions. [2022-01-17 23:46:46,106 INFO L78 Accepts]: Start accepts. Automaton has 4900 states and 10030 transitions. Word has length 99 [2022-01-17 23:46:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:46,106 INFO L470 AbstractCegarLoop]: Abstraction has 4900 states and 10030 transitions. [2022-01-17 23:46:46,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4900 states and 10030 transitions. [2022-01-17 23:46:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:46:46,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:46,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:46:46,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-17 23:46:46,110 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:46:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:46,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2098981631, now seen corresponding path program 36 times [2022-01-17 23:46:46,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:46,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131968051] [2022-01-17 23:46:46,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:46,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:46,820 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-17 23:46:46,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:46,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131968051] [2022-01-17 23:46:46,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131968051] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:46,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:46,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:46:46,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881184262] [2022-01-17 23:46:46,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:46,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:46:46,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:46,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:46:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:46:46,821 INFO L87 Difference]: Start difference. First operand 4900 states and 10030 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:51,893 INFO L93 Difference]: Finished difference Result 9343 states and 19190 transitions. [2022-01-17 23:46:51,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:46:51,894 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:46:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:51,909 INFO L225 Difference]: With dead ends: 9343 [2022-01-17 23:46:51,909 INFO L226 Difference]: Without dead ends: 9343 [2022-01-17 23:46:51,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2022-01-17 23:46:51,910 INFO L933 BasicCegarLoop]: 614 mSDtfsCounter, 1639 mSDsluCounter, 10325 mSDsCounter, 0 mSdLazyCounter, 3900 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 10939 SdHoareTripleChecker+Invalid, 3935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:51,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1639 Valid, 10939 Invalid, 3935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3900 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:46:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9343 states. [2022-01-17 23:46:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9343 to 4902. [2022-01-17 23:46:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 4899 states have (on average 2.0481730965503164) internal successors, (10034), 4901 states have internal predecessors, (10034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:52,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 10034 transitions. [2022-01-17 23:46:52,004 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 10034 transitions. Word has length 99 [2022-01-17 23:46:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:52,004 INFO L470 AbstractCegarLoop]: Abstraction has 4902 states and 10034 transitions. [2022-01-17 23:46:52,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 10034 transitions. [2022-01-17 23:46:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:46:52,008 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:52,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:46:52,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-17 23:46:52,008 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:46:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:52,009 INFO L85 PathProgramCache]: Analyzing trace with hash -891812207, now seen corresponding path program 37 times [2022-01-17 23:46:52,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:52,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743180309] [2022-01-17 23:46:52,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:52,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:52,841 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-17 23:46:52,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:52,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743180309] [2022-01-17 23:46:52,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743180309] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:52,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:52,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:46:52,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095394754] [2022-01-17 23:46:52,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:52,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:46:52,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:52,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:46:52,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:46:52,843 INFO L87 Difference]: Start difference. First operand 4902 states and 10034 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:57,660 INFO L93 Difference]: Finished difference Result 7453 states and 15284 transitions. [2022-01-17 23:46:57,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:46:57,661 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:46:57,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:57,669 INFO L225 Difference]: With dead ends: 7453 [2022-01-17 23:46:57,670 INFO L226 Difference]: Without dead ends: 7453 [2022-01-17 23:46:57,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:46:57,670 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 1670 mSDsluCounter, 9797 mSDsCounter, 0 mSdLazyCounter, 3759 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 10379 SdHoareTripleChecker+Invalid, 3802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:57,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1670 Valid, 10379 Invalid, 3802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3759 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:46:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2022-01-17 23:46:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 4884. [2022-01-17 23:46:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4884 states, 4881 states have (on average 2.047940995697603) internal successors, (9996), 4883 states have internal predecessors, (9996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 9996 transitions. [2022-01-17 23:46:57,742 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 9996 transitions. Word has length 99 [2022-01-17 23:46:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:57,743 INFO L470 AbstractCegarLoop]: Abstraction has 4884 states and 9996 transitions. [2022-01-17 23:46:57,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 9996 transitions. [2022-01-17 23:46:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:46:57,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:57,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:46:57,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-17 23:46:57,747 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:46:57,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash 718038743, now seen corresponding path program 38 times [2022-01-17 23:46:57,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:57,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013077412] [2022-01-17 23:46:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:57,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:58,579 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-17 23:46:58,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:58,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013077412] [2022-01-17 23:46:58,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013077412] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:58,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:58,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:46:58,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029073843] [2022-01-17 23:46:58,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:58,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:46:58,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:58,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:46:58,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:46:58,581 INFO L87 Difference]: Start difference. First operand 4884 states and 9996 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:03,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:03,301 INFO L93 Difference]: Finished difference Result 7481 states and 15357 transitions. [2022-01-17 23:47:03,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:47:03,301 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:47:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:03,309 INFO L225 Difference]: With dead ends: 7481 [2022-01-17 23:47:03,309 INFO L226 Difference]: Without dead ends: 7481 [2022-01-17 23:47:03,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:47:03,310 INFO L933 BasicCegarLoop]: 572 mSDtfsCounter, 1596 mSDsluCounter, 9045 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 9617 SdHoareTripleChecker+Invalid, 3572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:03,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1596 Valid, 9617 Invalid, 3572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:47:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7481 states. [2022-01-17 23:47:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7481 to 4882. [2022-01-17 23:47:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4882 states, 4879 states have (on average 2.047960647673704) internal successors, (9992), 4881 states have internal predecessors, (9992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 9992 transitions. [2022-01-17 23:47:03,389 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 9992 transitions. Word has length 99 [2022-01-17 23:47:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:03,389 INFO L470 AbstractCegarLoop]: Abstraction has 4882 states and 9992 transitions. [2022-01-17 23:47:03,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 9992 transitions. [2022-01-17 23:47:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:47:03,393 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:03,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:47:03,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-17 23:47:03,393 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:47:03,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:03,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1464411143, now seen corresponding path program 39 times [2022-01-17 23:47:03,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:03,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643828577] [2022-01-17 23:47:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:03,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:04,389 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-17 23:47:04,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:04,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643828577] [2022-01-17 23:47:04,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643828577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:04,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:04,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:47:04,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809929405] [2022-01-17 23:47:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:04,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:47:04,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:04,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:47:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:47:04,390 INFO L87 Difference]: Start difference. First operand 4882 states and 9992 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:09,119 INFO L93 Difference]: Finished difference Result 7532 states and 15459 transitions. [2022-01-17 23:47:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:47:09,119 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:47:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:09,127 INFO L225 Difference]: With dead ends: 7532 [2022-01-17 23:47:09,128 INFO L226 Difference]: Without dead ends: 7532 [2022-01-17 23:47:09,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=959, Invalid=4741, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:47:09,128 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1616 mSDsluCounter, 10036 mSDsCounter, 0 mSdLazyCounter, 3862 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 10607 SdHoareTripleChecker+Invalid, 3901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:09,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1616 Valid, 10607 Invalid, 3901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3862 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:47:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7532 states. [2022-01-17 23:47:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7532 to 4878. [2022-01-17 23:47:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4875 states have (on average 2.048) internal successors, (9984), 4877 states have internal predecessors, (9984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 9984 transitions. [2022-01-17 23:47:09,184 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 9984 transitions. Word has length 99 [2022-01-17 23:47:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:09,184 INFO L470 AbstractCegarLoop]: Abstraction has 4878 states and 9984 transitions. [2022-01-17 23:47:09,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 9984 transitions. [2022-01-17 23:47:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:47:09,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:09,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:47:09,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-17 23:47:09,188 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:47:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash 259071161, now seen corresponding path program 40 times [2022-01-17 23:47:09,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:09,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318552542] [2022-01-17 23:47:09,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:09,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:10,102 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-17 23:47:10,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:10,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318552542] [2022-01-17 23:47:10,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318552542] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:10,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:10,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:47:10,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584592165] [2022-01-17 23:47:10,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:10,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:47:10,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:10,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:47:10,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:47:10,104 INFO L87 Difference]: Start difference. First operand 4878 states and 9984 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:14,623 INFO L93 Difference]: Finished difference Result 7134 states and 14627 transitions. [2022-01-17 23:47:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:47:14,623 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:47:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:14,631 INFO L225 Difference]: With dead ends: 7134 [2022-01-17 23:47:14,631 INFO L226 Difference]: Without dead ends: 7134 [2022-01-17 23:47:14,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:47:14,632 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1531 mSDsluCounter, 8982 mSDsCounter, 0 mSdLazyCounter, 3520 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 9548 SdHoareTripleChecker+Invalid, 3553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:14,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1531 Valid, 9548 Invalid, 3553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3520 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:47:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7134 states. [2022-01-17 23:47:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7134 to 4872. [2022-01-17 23:47:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions. [2022-01-17 23:47:14,687 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99 [2022-01-17 23:47:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:14,687 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions. [2022-01-17 23:47:14,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions. [2022-01-17 23:47:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:47:14,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:14,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:47:14,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-01-17 23:47:14,691 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:47:14,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1251499575, now seen corresponding path program 41 times [2022-01-17 23:47:14,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:14,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712910292] [2022-01-17 23:47:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:14,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:15,673 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-17 23:47:15,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:15,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712910292] [2022-01-17 23:47:15,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712910292] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:15,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:15,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:47:15,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011450261] [2022-01-17 23:47:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:15,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:47:15,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:15,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:47:15,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:47:15,675 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:20,548 INFO L93 Difference]: Finished difference Result 7472 states and 15339 transitions. [2022-01-17 23:47:20,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:47:20,549 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:47:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:20,557 INFO L225 Difference]: With dead ends: 7472 [2022-01-17 23:47:20,557 INFO L226 Difference]: Without dead ends: 7472 [2022-01-17 23:47:20,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:47:20,558 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1693 mSDsluCounter, 9833 mSDsCounter, 0 mSdLazyCounter, 3888 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 10404 SdHoareTripleChecker+Invalid, 3923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:20,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1693 Valid, 10404 Invalid, 3923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3888 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:47:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2022-01-17 23:47:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 4902. [2022-01-17 23:47:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 4899 states have (on average 2.0481730965503164) internal successors, (10034), 4901 states have internal predecessors, (10034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 10034 transitions. [2022-01-17 23:47:20,627 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 10034 transitions. Word has length 99 [2022-01-17 23:47:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:20,627 INFO L470 AbstractCegarLoop]: Abstraction has 4902 states and 10034 transitions. [2022-01-17 23:47:20,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 10034 transitions. [2022-01-17 23:47:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:47:20,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:20,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:47:20,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-01-17 23:47:20,631 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:47:20,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1158856063, now seen corresponding path program 42 times [2022-01-17 23:47:20,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:20,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682909910] [2022-01-17 23:47:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:20,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:21,468 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-17 23:47:21,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:21,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682909910] [2022-01-17 23:47:21,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682909910] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:21,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:21,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:47:21,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968413418] [2022-01-17 23:47:21,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:21,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:47:21,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:47:21,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:47:21,469 INFO L87 Difference]: Start difference. First operand 4902 states and 10034 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:26,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:26,367 INFO L93 Difference]: Finished difference Result 9419 states and 19342 transitions. [2022-01-17 23:47:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:47:26,367 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:47:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:26,377 INFO L225 Difference]: With dead ends: 9419 [2022-01-17 23:47:26,377 INFO L226 Difference]: Without dead ends: 9419 [2022-01-17 23:47:26,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1066, Invalid=5096, Unknown=0, NotChecked=0, Total=6162 [2022-01-17 23:47:26,378 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 1966 mSDsluCounter, 9933 mSDsCounter, 0 mSdLazyCounter, 3570 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 10550 SdHoareTripleChecker+Invalid, 3616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:26,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1966 Valid, 10550 Invalid, 3616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3570 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:47:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9419 states. [2022-01-17 23:47:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9419 to 4904. [2022-01-17 23:47:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4904 states, 4901 states have (on average 2.0481534380738626) internal successors, (10038), 4903 states have internal predecessors, (10038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4904 states to 4904 states and 10038 transitions. [2022-01-17 23:47:26,462 INFO L78 Accepts]: Start accepts. Automaton has 4904 states and 10038 transitions. Word has length 99 [2022-01-17 23:47:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:26,463 INFO L470 AbstractCegarLoop]: Abstraction has 4904 states and 10038 transitions. [2022-01-17 23:47:26,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4904 states and 10038 transitions. [2022-01-17 23:47:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:47:26,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:26,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:47:26,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-01-17 23:47:26,468 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:47:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:26,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1928941809, now seen corresponding path program 43 times [2022-01-17 23:47:26,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:26,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318926123] [2022-01-17 23:47:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:26,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:27,383 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-17 23:47:27,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:27,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318926123] [2022-01-17 23:47:27,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318926123] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:27,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:27,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:47:27,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486234854] [2022-01-17 23:47:27,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:27,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:47:27,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:27,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:47:27,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:47:27,384 INFO L87 Difference]: Start difference. First operand 4904 states and 10038 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:32,159 INFO L93 Difference]: Finished difference Result 7529 states and 15436 transitions. [2022-01-17 23:47:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:47:32,160 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:47:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:32,167 INFO L225 Difference]: With dead ends: 7529 [2022-01-17 23:47:32,168 INFO L226 Difference]: Without dead ends: 7529 [2022-01-17 23:47:32,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:47:32,168 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 1697 mSDsluCounter, 9445 mSDsCounter, 0 mSdLazyCounter, 3485 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 10030 SdHoareTripleChecker+Invalid, 3527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:32,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1697 Valid, 10030 Invalid, 3527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3485 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:47:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7529 states. [2022-01-17 23:47:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7529 to 4886. [2022-01-17 23:47:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4886 states, 4883 states have (on average 2.047921359819783) internal successors, (10000), 4885 states have internal predecessors, (10000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 10000 transitions. [2022-01-17 23:47:32,225 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 10000 transitions. Word has length 99 [2022-01-17 23:47:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:32,225 INFO L470 AbstractCegarLoop]: Abstraction has 4886 states and 10000 transitions. [2022-01-17 23:47:32,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 10000 transitions. [2022-01-17 23:47:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:47:32,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:32,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:47:32,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-01-17 23:47:32,229 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:47:32,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash -319090859, now seen corresponding path program 44 times [2022-01-17 23:47:32,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:32,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683277705] [2022-01-17 23:47:32,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:32,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:33,064 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-17 23:47:33,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:33,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683277705] [2022-01-17 23:47:33,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683277705] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:33,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:33,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:47:33,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193544567] [2022-01-17 23:47:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:33,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:47:33,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:33,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:47:33,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:47:33,066 INFO L87 Difference]: Start difference. First operand 4886 states and 10000 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:37,766 INFO L93 Difference]: Finished difference Result 7557 states and 15509 transitions. [2022-01-17 23:47:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:47:37,767 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:47:37,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:37,775 INFO L225 Difference]: With dead ends: 7557 [2022-01-17 23:47:37,775 INFO L226 Difference]: Without dead ends: 7557 [2022-01-17 23:47:37,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:47:37,775 INFO L933 BasicCegarLoop]: 575 mSDtfsCounter, 1699 mSDsluCounter, 9769 mSDsCounter, 0 mSdLazyCounter, 3810 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 10344 SdHoareTripleChecker+Invalid, 3845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:37,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1699 Valid, 10344 Invalid, 3845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3810 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:47:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7557 states. [2022-01-17 23:47:37,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7557 to 4884. [2022-01-17 23:47:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4884 states, 4881 states have (on average 2.047940995697603) internal successors, (9996), 4883 states have internal predecessors, (9996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 9996 transitions. [2022-01-17 23:47:37,828 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 9996 transitions. Word has length 99 [2022-01-17 23:47:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:37,828 INFO L470 AbstractCegarLoop]: Abstraction has 4884 states and 9996 transitions. [2022-01-17 23:47:37,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 9996 transitions. [2022-01-17 23:47:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:47:37,831 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:37,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:47:37,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-01-17 23:47:37,832 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:47:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:37,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1793426551, now seen corresponding path program 45 times [2022-01-17 23:47:37,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:37,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382882404] [2022-01-17 23:47:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:37,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:38,809 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-17 23:47:38,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382882404] [2022-01-17 23:47:38,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382882404] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:38,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:38,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:47:38,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839700545] [2022-01-17 23:47:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:38,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:47:38,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:38,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:47:38,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:47:38,811 INFO L87 Difference]: Start difference. First operand 4884 states and 9996 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:43,464 INFO L93 Difference]: Finished difference Result 7608 states and 15611 transitions. [2022-01-17 23:47:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:47:43,464 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:47:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:43,473 INFO L225 Difference]: With dead ends: 7608 [2022-01-17 23:47:43,473 INFO L226 Difference]: Without dead ends: 7608 [2022-01-17 23:47:43,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:47:43,474 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 1669 mSDsluCounter, 9368 mSDsCounter, 0 mSdLazyCounter, 3652 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 9942 SdHoareTripleChecker+Invalid, 3686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:43,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1669 Valid, 9942 Invalid, 3686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3652 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:47:43,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7608 states. [2022-01-17 23:47:43,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7608 to 4880. [2022-01-17 23:47:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 4877 states have (on average 2.04798031576789) internal successors, (9988), 4879 states have internal predecessors, (9988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 9988 transitions. [2022-01-17 23:47:43,536 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 9988 transitions. Word has length 99 [2022-01-17 23:47:43,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:43,536 INFO L470 AbstractCegarLoop]: Abstraction has 4880 states and 9988 transitions. [2022-01-17 23:47:43,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 9988 transitions. [2022-01-17 23:47:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:47:43,540 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:43,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:47:43,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-01-17 23:47:43,540 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:47:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash -778058441, now seen corresponding path program 46 times [2022-01-17 23:47:43,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:43,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517696160] [2022-01-17 23:47:43,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:43,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:44,332 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-17 23:47:44,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:44,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517696160] [2022-01-17 23:47:44,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517696160] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:44,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:44,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:47:44,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912184309] [2022-01-17 23:47:44,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:44,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:47:44,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:44,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:47:44,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:47:44,333 INFO L87 Difference]: Start difference. First operand 4880 states and 9988 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:49,074 INFO L93 Difference]: Finished difference Result 7693 states and 15781 transitions. [2022-01-17 23:47:49,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:47:49,075 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:47:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:49,082 INFO L225 Difference]: With dead ends: 7693 [2022-01-17 23:47:49,082 INFO L226 Difference]: Without dead ends: 7693 [2022-01-17 23:47:49,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:47:49,083 INFO L933 BasicCegarLoop]: 578 mSDtfsCounter, 1520 mSDsluCounter, 9500 mSDsCounter, 0 mSdLazyCounter, 3674 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 10078 SdHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:49,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1520 Valid, 10078 Invalid, 3705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3674 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:47:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7693 states. [2022-01-17 23:47:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7693 to 4874. [2022-01-17 23:47:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4871 states have (on average 2.048039416957504) internal successors, (9976), 4873 states have internal predecessors, (9976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 9976 transitions. [2022-01-17 23:47:49,130 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 9976 transitions. Word has length 99 [2022-01-17 23:47:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:49,130 INFO L470 AbstractCegarLoop]: Abstraction has 4874 states and 9976 transitions. [2022-01-17 23:47:49,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 9976 transitions. [2022-01-17 23:47:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:47:49,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:49,134 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:47:49,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-01-17 23:47:49,134 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:47:49,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2006609387, now seen corresponding path program 47 times [2022-01-17 23:47:49,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:49,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340011744] [2022-01-17 23:47:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:49,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:50,103 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-17 23:47:50,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:50,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340011744] [2022-01-17 23:47:50,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340011744] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:50,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:50,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-17 23:47:50,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742879299] [2022-01-17 23:47:50,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:50,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-17 23:47:50,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:50,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-17 23:47:50,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2022-01-17 23:47:50,105 INFO L87 Difference]: Start difference. First operand 4874 states and 9976 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:55,641 INFO L93 Difference]: Finished difference Result 7877 states and 16157 transitions. [2022-01-17 23:47:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-17 23:47:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:47:55,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:55,649 INFO L225 Difference]: With dead ends: 7877 [2022-01-17 23:47:55,650 INFO L226 Difference]: Without dead ends: 7877 [2022-01-17 23:47:55,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1131, Invalid=5675, Unknown=0, NotChecked=0, Total=6806 [2022-01-17 23:47:55,650 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 1805 mSDsluCounter, 10129 mSDsCounter, 0 mSdLazyCounter, 4035 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1805 SdHoareTripleChecker+Valid, 10702 SdHoareTripleChecker+Invalid, 4078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:55,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1805 Valid, 10702 Invalid, 4078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4035 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:47:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7877 states. [2022-01-17 23:47:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7877 to 5241. [2022-01-17 23:47:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5241 states, 5238 states have (on average 2.051546391752577) internal successors, (10746), 5240 states have internal predecessors, (10746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 10746 transitions. [2022-01-17 23:47:55,702 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 10746 transitions. Word has length 99 [2022-01-17 23:47:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:55,702 INFO L470 AbstractCegarLoop]: Abstraction has 5241 states and 10746 transitions. [2022-01-17 23:47:55,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 10746 transitions. [2022-01-17 23:47:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:47:55,706 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:55,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:47:55,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-01-17 23:47:55,706 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:47:55,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:55,707 INFO L85 PathProgramCache]: Analyzing trace with hash -904543407, now seen corresponding path program 48 times [2022-01-17 23:47:55,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:55,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132731907] [2022-01-17 23:47:55,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:55,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:56,585 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-17 23:47:56,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:56,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132731907] [2022-01-17 23:47:56,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132731907] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:56,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:56,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:47:56,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942386299] [2022-01-17 23:47:56,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:56,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:47:56,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:56,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:47:56,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:47:56,586 INFO L87 Difference]: Start difference. First operand 5241 states and 10746 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:01,210 INFO L93 Difference]: Finished difference Result 8656 states and 17763 transitions. [2022-01-17 23:48:01,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:48:01,211 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:48:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:01,220 INFO L225 Difference]: With dead ends: 8656 [2022-01-17 23:48:01,220 INFO L226 Difference]: Without dead ends: 8656 [2022-01-17 23:48:01,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:48:01,220 INFO L933 BasicCegarLoop]: 569 mSDtfsCounter, 1596 mSDsluCounter, 9357 mSDsCounter, 0 mSdLazyCounter, 3475 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 9926 SdHoareTripleChecker+Invalid, 3508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:01,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1596 Valid, 9926 Invalid, 3508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3475 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:48:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2022-01-17 23:48:01,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 4872. [2022-01-17 23:48:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions. [2022-01-17 23:48:01,285 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99 [2022-01-17 23:48:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:01,285 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions. [2022-01-17 23:48:01,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions. [2022-01-17 23:48:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:48:01,289 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:01,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:48:01,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-01-17 23:48:01,289 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:48:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1348039269, now seen corresponding path program 49 times [2022-01-17 23:48:01,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:01,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412797452] [2022-01-17 23:48:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:01,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:02,255 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-17 23:48:02,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:02,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412797452] [2022-01-17 23:48:02,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412797452] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:02,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:02,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:48:02,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309193711] [2022-01-17 23:48:02,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:02,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:48:02,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:02,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:48:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:48:02,257 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:07,179 INFO L93 Difference]: Finished difference Result 7510 states and 15415 transitions. [2022-01-17 23:48:07,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:48:07,179 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:48:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:07,187 INFO L225 Difference]: With dead ends: 7510 [2022-01-17 23:48:07,187 INFO L226 Difference]: Without dead ends: 7510 [2022-01-17 23:48:07,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:48:07,188 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 1809 mSDsluCounter, 9882 mSDsCounter, 0 mSdLazyCounter, 3870 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 10455 SdHoareTripleChecker+Invalid, 3913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:07,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1809 Valid, 10455 Invalid, 3913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3870 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:48:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7510 states. [2022-01-17 23:48:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7510 to 4904. [2022-01-17 23:48:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4904 states, 4901 states have (on average 2.0481534380738626) internal successors, (10038), 4903 states have internal predecessors, (10038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4904 states to 4904 states and 10038 transitions. [2022-01-17 23:48:07,244 INFO L78 Accepts]: Start accepts. Automaton has 4904 states and 10038 transitions. Word has length 99 [2022-01-17 23:48:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:07,244 INFO L470 AbstractCegarLoop]: Abstraction has 4904 states and 10038 transitions. [2022-01-17 23:48:07,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4904 states and 10038 transitions. [2022-01-17 23:48:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:48:07,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:07,247 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:48:07,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-01-17 23:48:07,248 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:48:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1255395757, now seen corresponding path program 50 times [2022-01-17 23:48:07,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:07,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647915745] [2022-01-17 23:48:07,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:07,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:07,950 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-17 23:48:07,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:07,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647915745] [2022-01-17 23:48:07,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647915745] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:07,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:07,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:48:07,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172320230] [2022-01-17 23:48:07,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:07,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:48:07,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:07,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:48:07,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:48:07,951 INFO L87 Difference]: Start difference. First operand 4904 states and 10038 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:13,152 INFO L93 Difference]: Finished difference Result 9457 states and 19418 transitions. [2022-01-17 23:48:13,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:48:13,153 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:48:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:13,162 INFO L225 Difference]: With dead ends: 9457 [2022-01-17 23:48:13,162 INFO L226 Difference]: Without dead ends: 9457 [2022-01-17 23:48:13,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2022-01-17 23:48:13,163 INFO L933 BasicCegarLoop]: 619 mSDtfsCounter, 1590 mSDsluCounter, 11957 mSDsCounter, 0 mSdLazyCounter, 4423 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 12576 SdHoareTripleChecker+Invalid, 4457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:13,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1590 Valid, 12576 Invalid, 4457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4423 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-17 23:48:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9457 states. [2022-01-17 23:48:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9457 to 4906. [2022-01-17 23:48:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4906 states, 4903 states have (on average 2.048133795635325) internal successors, (10042), 4905 states have internal predecessors, (10042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 10042 transitions. [2022-01-17 23:48:13,225 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 10042 transitions. Word has length 99 [2022-01-17 23:48:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:13,225 INFO L470 AbstractCegarLoop]: Abstraction has 4906 states and 10042 transitions. [2022-01-17 23:48:13,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 10042 transitions. [2022-01-17 23:48:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:48:13,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:13,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:48:13,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-01-17 23:48:13,229 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:48:13,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:13,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1832402115, now seen corresponding path program 51 times [2022-01-17 23:48:13,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:13,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268337377] [2022-01-17 23:48:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:13,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:14,073 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-17 23:48:14,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:14,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268337377] [2022-01-17 23:48:14,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268337377] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:14,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:14,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:48:14,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146841457] [2022-01-17 23:48:14,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:14,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:48:14,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:14,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:48:14,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:48:14,074 INFO L87 Difference]: Start difference. First operand 4906 states and 10042 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:18,947 INFO L93 Difference]: Finished difference Result 7567 states and 15512 transitions. [2022-01-17 23:48:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:48:18,947 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:48:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:18,955 INFO L225 Difference]: With dead ends: 7567 [2022-01-17 23:48:18,955 INFO L226 Difference]: Without dead ends: 7567 [2022-01-17 23:48:18,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:48:18,956 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 1771 mSDsluCounter, 9979 mSDsCounter, 0 mSdLazyCounter, 3674 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 10566 SdHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:18,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1771 Valid, 10566 Invalid, 3719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3674 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:48:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2022-01-17 23:48:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 4888. [2022-01-17 23:48:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4888 states, 4885 states have (on average 2.0479017400204707) internal successors, (10004), 4887 states have internal predecessors, (10004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10004 transitions. [2022-01-17 23:48:19,014 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10004 transitions. Word has length 99 [2022-01-17 23:48:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:19,014 INFO L470 AbstractCegarLoop]: Abstraction has 4888 states and 10004 transitions. [2022-01-17 23:48:19,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10004 transitions. [2022-01-17 23:48:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:48:19,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:19,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:48:19,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-01-17 23:48:19,018 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:48:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash -222551165, now seen corresponding path program 52 times [2022-01-17 23:48:19,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:19,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848603744] [2022-01-17 23:48:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:19,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:20,168 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-17 23:48:20,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:20,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848603744] [2022-01-17 23:48:20,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848603744] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:20,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:20,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-17 23:48:20,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66748851] [2022-01-17 23:48:20,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:20,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-17 23:48:20,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:20,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-17 23:48:20,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332 [2022-01-17 23:48:20,169 INFO L87 Difference]: Start difference. First operand 4888 states and 10004 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:26,579 INFO L93 Difference]: Finished difference Result 8631 states and 17745 transitions. [2022-01-17 23:48:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-17 23:48:26,579 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:48:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:26,589 INFO L225 Difference]: With dead ends: 8631 [2022-01-17 23:48:26,589 INFO L226 Difference]: Without dead ends: 8631 [2022-01-17 23:48:26,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1403, Invalid=7153, Unknown=0, NotChecked=0, Total=8556 [2022-01-17 23:48:26,590 INFO L933 BasicCegarLoop]: 581 mSDtfsCounter, 2137 mSDsluCounter, 10541 mSDsCounter, 0 mSdLazyCounter, 4251 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 11122 SdHoareTripleChecker+Invalid, 4305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 4251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:26,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2137 Valid, 11122 Invalid, 4305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 4251 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:48:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8631 states. [2022-01-17 23:48:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8631 to 5153. [2022-01-17 23:48:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5153 states, 5150 states have (on average 2.0524271844660196) internal successors, (10570), 5152 states have internal predecessors, (10570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 10570 transitions. [2022-01-17 23:48:26,661 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 10570 transitions. Word has length 99 [2022-01-17 23:48:26,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:26,661 INFO L470 AbstractCegarLoop]: Abstraction has 5153 states and 10570 transitions. [2022-01-17 23:48:26,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 10570 transitions. [2022-01-17 23:48:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:48:26,665 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:26,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:48:26,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-01-17 23:48:26,666 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:48:26,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash 879514815, now seen corresponding path program 53 times [2022-01-17 23:48:26,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:26,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076152350] [2022-01-17 23:48:26,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:26,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:27,513 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-17 23:48:27,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:27,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076152350] [2022-01-17 23:48:27,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076152350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:27,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:27,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:48:27,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536877065] [2022-01-17 23:48:27,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:27,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:48:27,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:27,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:48:27,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:48:27,515 INFO L87 Difference]: Start difference. First operand 5153 states and 10570 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:32,453 INFO L93 Difference]: Finished difference Result 9047 states and 18581 transitions. [2022-01-17 23:48:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:48:32,453 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:48:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:32,463 INFO L225 Difference]: With dead ends: 9047 [2022-01-17 23:48:32,464 INFO L226 Difference]: Without dead ends: 9047 [2022-01-17 23:48:32,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=959, Invalid=4741, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:48:32,464 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1672 mSDsluCounter, 10537 mSDsCounter, 0 mSdLazyCounter, 4061 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 11114 SdHoareTripleChecker+Invalid, 4103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:32,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1672 Valid, 11114 Invalid, 4103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4061 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:48:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9047 states. [2022-01-17 23:48:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9047 to 4886. [2022-01-17 23:48:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4886 states, 4883 states have (on average 2.047921359819783) internal successors, (10000), 4885 states have internal predecessors, (10000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 10000 transitions. [2022-01-17 23:48:32,533 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 10000 transitions. Word has length 99 [2022-01-17 23:48:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:32,533 INFO L470 AbstractCegarLoop]: Abstraction has 4886 states and 10000 transitions. [2022-01-17 23:48:32,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 10000 transitions. [2022-01-17 23:48:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:48:32,537 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:32,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:48:32,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-01-17 23:48:32,537 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:48:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1889966245, now seen corresponding path program 54 times [2022-01-17 23:48:32,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:32,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307515885] [2022-01-17 23:48:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:32,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:33,604 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-17 23:48:33,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:33,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307515885] [2022-01-17 23:48:33,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307515885] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:33,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:33,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-17 23:48:33,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068179939] [2022-01-17 23:48:33,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:33,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-17 23:48:33,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:33,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-17 23:48:33,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332 [2022-01-17 23:48:33,605 INFO L87 Difference]: Start difference. First operand 4886 states and 10000 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:40,261 INFO L93 Difference]: Finished difference Result 8682 states and 17847 transitions. [2022-01-17 23:48:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-17 23:48:40,261 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:48:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:40,272 INFO L225 Difference]: With dead ends: 8682 [2022-01-17 23:48:40,272 INFO L226 Difference]: Without dead ends: 8682 [2022-01-17 23:48:40,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1403, Invalid=7153, Unknown=0, NotChecked=0, Total=8556 [2022-01-17 23:48:40,272 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 2006 mSDsluCounter, 10881 mSDsCounter, 0 mSdLazyCounter, 4550 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 11461 SdHoareTripleChecker+Invalid, 4599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 4550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:40,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2006 Valid, 11461 Invalid, 4599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 4550 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-17 23:48:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states. [2022-01-17 23:48:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 5185. [2022-01-17 23:48:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5185 states, 5182 states have (on average 2.052103434967194) internal successors, (10634), 5184 states have internal predecessors, (10634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 10634 transitions. [2022-01-17 23:48:40,347 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 10634 transitions. Word has length 99 [2022-01-17 23:48:40,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:40,347 INFO L470 AbstractCegarLoop]: Abstraction has 5185 states and 10634 transitions. [2022-01-17 23:48:40,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 10634 transitions. [2022-01-17 23:48:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:48:40,351 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:40,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:48:40,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-01-17 23:48:40,352 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:48:40,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:40,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1302935071, now seen corresponding path program 55 times [2022-01-17 23:48:40,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:40,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320914000] [2022-01-17 23:48:40,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:40,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:41,190 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-17 23:48:41,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:41,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320914000] [2022-01-17 23:48:41,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320914000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:41,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:41,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:48:41,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630106593] [2022-01-17 23:48:41,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:41,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:48:41,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:41,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:48:41,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:48:41,192 INFO L87 Difference]: Start difference. First operand 5185 states and 10634 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:45,943 INFO L93 Difference]: Finished difference Result 9098 states and 18683 transitions. [2022-01-17 23:48:45,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:48:45,943 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:48:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:45,952 INFO L225 Difference]: With dead ends: 9098 [2022-01-17 23:48:45,952 INFO L226 Difference]: Without dead ends: 9098 [2022-01-17 23:48:45,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:48:45,953 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 1537 mSDsluCounter, 9821 mSDsCounter, 0 mSdLazyCounter, 3763 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 10397 SdHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:45,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 10397 Invalid, 3794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3763 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:48:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2022-01-17 23:48:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 4882. [2022-01-17 23:48:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4882 states, 4879 states have (on average 2.047960647673704) internal successors, (9992), 4881 states have internal predecessors, (9992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 9992 transitions. [2022-01-17 23:48:46,011 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 9992 transitions. Word has length 99 [2022-01-17 23:48:46,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:46,011 INFO L470 AbstractCegarLoop]: Abstraction has 4882 states and 9992 transitions. [2022-01-17 23:48:46,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 9992 transitions. [2022-01-17 23:48:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:48:46,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:46,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:48:46,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-01-17 23:48:46,014 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:48:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:46,015 INFO L85 PathProgramCache]: Analyzing trace with hash -681518747, now seen corresponding path program 56 times [2022-01-17 23:48:46,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:46,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415227743] [2022-01-17 23:48:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:46,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:46,996 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-17 23:48:46,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:46,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415227743] [2022-01-17 23:48:46,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415227743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:46,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:46,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-17 23:48:46,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411115976] [2022-01-17 23:48:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:46,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-17 23:48:46,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:46,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-17 23:48:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2022-01-17 23:48:46,998 INFO L87 Difference]: Start difference. First operand 4882 states and 9992 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:52,789 INFO L93 Difference]: Finished difference Result 8404 states and 17247 transitions. [2022-01-17 23:48:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-17 23:48:52,789 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:48:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:52,797 INFO L225 Difference]: With dead ends: 8404 [2022-01-17 23:48:52,797 INFO L226 Difference]: Without dead ends: 8404 [2022-01-17 23:48:52,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1131, Invalid=5675, Unknown=0, NotChecked=0, Total=6806 [2022-01-17 23:48:52,797 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 1839 mSDsluCounter, 10404 mSDsCounter, 0 mSdLazyCounter, 4172 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 10988 SdHoareTripleChecker+Invalid, 4217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:52,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1839 Valid, 10988 Invalid, 4217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 4172 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:48:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8404 states. [2022-01-17 23:48:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8404 to 5232. [2022-01-17 23:48:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5232 states, 5229 states have (on average 2.0516351118760756) internal successors, (10728), 5231 states have internal predecessors, (10728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5232 states to 5232 states and 10728 transitions. [2022-01-17 23:48:52,858 INFO L78 Accepts]: Start accepts. Automaton has 5232 states and 10728 transitions. Word has length 99 [2022-01-17 23:48:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:52,858 INFO L470 AbstractCegarLoop]: Abstraction has 5232 states and 10728 transitions. [2022-01-17 23:48:52,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 5232 states and 10728 transitions. [2022-01-17 23:48:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:48:52,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:52,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:48:52,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-01-17 23:48:52,862 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:48:52,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:52,862 INFO L85 PathProgramCache]: Analyzing trace with hash 420547233, now seen corresponding path program 57 times [2022-01-17 23:48:52,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:52,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458393202] [2022-01-17 23:48:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:52,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:53,664 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-17 23:48:53,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:53,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458393202] [2022-01-17 23:48:53,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458393202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:53,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:53,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:48:53,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151762112] [2022-01-17 23:48:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:53,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:48:53,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:53,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:48:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:48:53,665 INFO L87 Difference]: Start difference. First operand 5232 states and 10728 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:58,382 INFO L93 Difference]: Finished difference Result 9183 states and 18853 transitions. [2022-01-17 23:48:58,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:48:58,382 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:48:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:58,391 INFO L225 Difference]: With dead ends: 9183 [2022-01-17 23:48:58,391 INFO L226 Difference]: Without dead ends: 9183 [2022-01-17 23:48:58,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:48:58,392 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 1702 mSDsluCounter, 10281 mSDsCounter, 0 mSdLazyCounter, 3881 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 10861 SdHoareTripleChecker+Invalid, 3922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:58,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1702 Valid, 10861 Invalid, 3922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3881 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:48:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9183 states. [2022-01-17 23:48:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9183 to 4876. [2022-01-17 23:48:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4873 states have (on average 2.0480197003899034) internal successors, (9980), 4875 states have internal predecessors, (9980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 9980 transitions. [2022-01-17 23:48:58,449 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 9980 transitions. Word has length 99 [2022-01-17 23:48:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:58,449 INFO L470 AbstractCegarLoop]: Abstraction has 4876 states and 9980 transitions. [2022-01-17 23:48:58,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 9980 transitions. [2022-01-17 23:48:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:48:58,452 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:58,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:48:58,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-01-17 23:48:58,452 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:48:58,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:58,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1910069693, now seen corresponding path program 58 times [2022-01-17 23:48:58,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:58,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231543740] [2022-01-17 23:48:58,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:58,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:59,252 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-17 23:48:59,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:59,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231543740] [2022-01-17 23:48:59,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231543740] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:59,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:59,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:48:59,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119753728] [2022-01-17 23:48:59,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:59,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:48:59,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:59,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:48:59,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:48:59,253 INFO L87 Difference]: Start difference. First operand 4876 states and 9980 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:03,961 INFO L93 Difference]: Finished difference Result 7799 states and 15993 transitions. [2022-01-17 23:49:03,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:49:03,961 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:49:03,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:03,971 INFO L225 Difference]: With dead ends: 7799 [2022-01-17 23:49:03,971 INFO L226 Difference]: Without dead ends: 7799 [2022-01-17 23:49:03,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:49:03,972 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 1692 mSDsluCounter, 10232 mSDsCounter, 0 mSdLazyCounter, 3786 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 10814 SdHoareTripleChecker+Invalid, 3823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:03,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1692 Valid, 10814 Invalid, 3823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3786 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:49:03,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7799 states. [2022-01-17 23:49:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7799 to 4874. [2022-01-17 23:49:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4871 states have (on average 2.048039416957504) internal successors, (9976), 4873 states have internal predecessors, (9976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 9976 transitions. [2022-01-17 23:49:04,051 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 9976 transitions. Word has length 99 [2022-01-17 23:49:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:04,051 INFO L470 AbstractCegarLoop]: Abstraction has 4874 states and 9976 transitions. [2022-01-17 23:49:04,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 9976 transitions. [2022-01-17 23:49:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:49:04,056 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:04,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:49:04,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-01-17 23:49:04,056 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:49:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:04,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1959007845, now seen corresponding path program 59 times [2022-01-17 23:49:04,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:04,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339818150] [2022-01-17 23:49:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:04,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:49:05,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:05,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339818150] [2022-01-17 23:49:05,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339818150] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:05,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:05,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-17 23:49:05,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754895929] [2022-01-17 23:49:05,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:05,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-17 23:49:05,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:05,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-17 23:49:05,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1172, Unknown=0, NotChecked=0, Total=1260 [2022-01-17 23:49:05,018 INFO L87 Difference]: Start difference. First operand 4874 states and 9976 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:10,783 INFO L93 Difference]: Finished difference Result 7913 states and 16229 transitions. [2022-01-17 23:49:10,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-17 23:49:10,783 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:49:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:10,793 INFO L225 Difference]: With dead ends: 7913 [2022-01-17 23:49:10,793 INFO L226 Difference]: Without dead ends: 7913 [2022-01-17 23:49:10,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1130, Invalid=5676, Unknown=0, NotChecked=0, Total=6806 [2022-01-17 23:49:10,794 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 1712 mSDsluCounter, 10665 mSDsCounter, 0 mSdLazyCounter, 4300 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 11239 SdHoareTripleChecker+Invalid, 4342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:10,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1712 Valid, 11239 Invalid, 4342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4300 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-17 23:49:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7913 states. [2022-01-17 23:49:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 5258. [2022-01-17 23:49:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5258 states, 5255 states have (on average 2.0513796384395815) internal successors, (10780), 5257 states have internal predecessors, (10780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5258 states to 5258 states and 10780 transitions. [2022-01-17 23:49:10,863 INFO L78 Accepts]: Start accepts. Automaton has 5258 states and 10780 transitions. Word has length 99 [2022-01-17 23:49:10,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:10,863 INFO L470 AbstractCegarLoop]: Abstraction has 5258 states and 10780 transitions. [2022-01-17 23:49:10,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 10780 transitions. [2022-01-17 23:49:10,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:49:10,868 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:10,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:49:10,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-01-17 23:49:10,868 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:49:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1233893471, now seen corresponding path program 60 times [2022-01-17 23:49:10,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:10,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57721161] [2022-01-17 23:49:10,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:10,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:49:11,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:11,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57721161] [2022-01-17 23:49:11,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57721161] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:11,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:11,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:49:11,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802196849] [2022-01-17 23:49:11,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:11,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:49:11,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:11,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:49:11,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:49:11,779 INFO L87 Difference]: Start difference. First operand 5258 states and 10780 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:16,436 INFO L93 Difference]: Finished difference Result 8692 states and 17835 transitions. [2022-01-17 23:49:16,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:49:16,436 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:49:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:16,445 INFO L225 Difference]: With dead ends: 8692 [2022-01-17 23:49:16,445 INFO L226 Difference]: Without dead ends: 8692 [2022-01-17 23:49:16,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:49:16,446 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 1568 mSDsluCounter, 10032 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 10602 SdHoareTripleChecker+Invalid, 3745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:16,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1568 Valid, 10602 Invalid, 3745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3712 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:49:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8692 states. [2022-01-17 23:49:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8692 to 4872. [2022-01-17 23:49:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions. [2022-01-17 23:49:16,507 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99 [2022-01-17 23:49:16,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:16,507 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions. [2022-01-17 23:49:16,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions. [2022-01-17 23:49:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:49:16,511 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:16,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:49:16,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-01-17 23:49:16,511 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:49:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1893386159, now seen corresponding path program 61 times [2022-01-17 23:49:16,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:16,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766974793] [2022-01-17 23:49:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:16,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:17,345 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-17 23:49:17,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:17,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766974793] [2022-01-17 23:49:17,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766974793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:17,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:17,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:49:17,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180060836] [2022-01-17 23:49:17,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:17,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:49:17,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:17,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:49:17,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:49:17,346 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:21,878 INFO L93 Difference]: Finished difference Result 7206 states and 14788 transitions. [2022-01-17 23:49:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:49:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:49:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:21,886 INFO L225 Difference]: With dead ends: 7206 [2022-01-17 23:49:21,886 INFO L226 Difference]: Without dead ends: 7206 [2022-01-17 23:49:21,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:49:21,887 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 1628 mSDsluCounter, 8780 mSDsCounter, 0 mSdLazyCounter, 3176 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 9356 SdHoareTripleChecker+Invalid, 3211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:21,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1628 Valid, 9356 Invalid, 3211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3176 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-17 23:49:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7206 states. [2022-01-17 23:49:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7206 to 4910. [2022-01-17 23:49:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4910 states, 4907 states have (on average 2.04809455879356) internal successors, (10050), 4909 states have internal predecessors, (10050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 10050 transitions. [2022-01-17 23:49:21,941 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 10050 transitions. Word has length 99 [2022-01-17 23:49:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:21,941 INFO L470 AbstractCegarLoop]: Abstraction has 4910 states and 10050 transitions. [2022-01-17 23:49:21,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 10050 transitions. [2022-01-17 23:49:21,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:49:21,945 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:21,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:49:21,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-01-17 23:49:21,945 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:49:21,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:21,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1986029671, now seen corresponding path program 62 times [2022-01-17 23:49:21,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:21,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755182420] [2022-01-17 23:49:21,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:21,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:22,667 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-17 23:49:22,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:22,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755182420] [2022-01-17 23:49:22,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755182420] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:22,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:22,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:49:22,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186459350] [2022-01-17 23:49:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:22,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:49:22,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:22,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:49:22,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:49:22,668 INFO L87 Difference]: Start difference. First operand 4910 states and 10050 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:27,694 INFO L93 Difference]: Finished difference Result 9153 states and 18791 transitions. [2022-01-17 23:49:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:49:27,694 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:49:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:27,702 INFO L225 Difference]: With dead ends: 9153 [2022-01-17 23:49:27,702 INFO L226 Difference]: Without dead ends: 9153 [2022-01-17 23:49:27,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1066, Invalid=5096, Unknown=0, NotChecked=0, Total=6162 [2022-01-17 23:49:27,703 INFO L933 BasicCegarLoop]: 622 mSDtfsCounter, 1666 mSDsluCounter, 10217 mSDsCounter, 0 mSdLazyCounter, 3620 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 10839 SdHoareTripleChecker+Invalid, 3661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:27,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1666 Valid, 10839 Invalid, 3661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3620 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:49:27,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9153 states. [2022-01-17 23:49:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9153 to 4912. [2022-01-17 23:49:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4912 states, 4909 states have (on average 2.0480749643511915) internal successors, (10054), 4911 states have internal predecessors, (10054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 10054 transitions. [2022-01-17 23:49:27,758 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 10054 transitions. Word has length 99 [2022-01-17 23:49:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:27,758 INFO L470 AbstractCegarLoop]: Abstraction has 4912 states and 10054 transitions. [2022-01-17 23:49:27,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 10054 transitions. [2022-01-17 23:49:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:49:27,761 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:27,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:49:27,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-01-17 23:49:27,761 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:49:27,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash -778860247, now seen corresponding path program 63 times [2022-01-17 23:49:27,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:27,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807397612] [2022-01-17 23:49:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:27,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:28,579 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-17 23:49:28,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:28,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807397612] [2022-01-17 23:49:28,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807397612] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:28,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:28,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:49:28,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830104185] [2022-01-17 23:49:28,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:28,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:49:28,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:28,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:49:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:49:28,581 INFO L87 Difference]: Start difference. First operand 4912 states and 10054 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:33,515 INFO L93 Difference]: Finished difference Result 7263 states and 14885 transitions. [2022-01-17 23:49:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:49:33,516 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:49:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:33,523 INFO L225 Difference]: With dead ends: 7263 [2022-01-17 23:49:33,523 INFO L226 Difference]: Without dead ends: 7263 [2022-01-17 23:49:33,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:49:33,524 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1503 mSDsluCounter, 10879 mSDsCounter, 0 mSdLazyCounter, 4040 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 11469 SdHoareTripleChecker+Invalid, 4078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:33,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1503 Valid, 11469 Invalid, 4078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4040 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:49:33,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7263 states. [2022-01-17 23:49:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7263 to 4894. [2022-01-17 23:49:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4894 states, 4891 states have (on average 2.0478429768963404) internal successors, (10016), 4893 states have internal predecessors, (10016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 10016 transitions. [2022-01-17 23:49:33,575 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 10016 transitions. Word has length 99 [2022-01-17 23:49:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:33,575 INFO L470 AbstractCegarLoop]: Abstraction has 4894 states and 10016 transitions. [2022-01-17 23:49:33,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 10016 transitions. [2022-01-17 23:49:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:49:33,579 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:33,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:49:33,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-01-17 23:49:33,579 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:49:33,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash 830990703, now seen corresponding path program 64 times [2022-01-17 23:49:33,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:33,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340870916] [2022-01-17 23:49:33,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:33,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:34,451 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-17 23:49:34,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:34,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340870916] [2022-01-17 23:49:34,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340870916] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:34,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:34,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:49:34,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591086770] [2022-01-17 23:49:34,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:34,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:49:34,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:34,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:49:34,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:49:34,452 INFO L87 Difference]: Start difference. First operand 4894 states and 10016 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:39,280 INFO L93 Difference]: Finished difference Result 7291 states and 14958 transitions. [2022-01-17 23:49:39,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:49:39,280 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:49:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:39,287 INFO L225 Difference]: With dead ends: 7291 [2022-01-17 23:49:39,287 INFO L226 Difference]: Without dead ends: 7291 [2022-01-17 23:49:39,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:49:39,287 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 1745 mSDsluCounter, 9585 mSDsCounter, 0 mSdLazyCounter, 3736 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 10165 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:39,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1745 Valid, 10165 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3736 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:49:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7291 states. [2022-01-17 23:49:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7291 to 4892. [2022-01-17 23:49:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 4889 states have (on average 2.047862548578441) internal successors, (10012), 4891 states have internal predecessors, (10012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 10012 transitions. [2022-01-17 23:49:39,336 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 10012 transitions. Word has length 99 [2022-01-17 23:49:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:39,337 INFO L470 AbstractCegarLoop]: Abstraction has 4892 states and 10012 transitions. [2022-01-17 23:49:39,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 10012 transitions. [2022-01-17 23:49:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:49:39,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:39,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:49:39,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-01-17 23:49:39,340 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:49:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1351459183, now seen corresponding path program 65 times [2022-01-17 23:49:39,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:39,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187407396] [2022-01-17 23:49:39,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:39,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:40,370 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-17 23:49:40,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:40,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187407396] [2022-01-17 23:49:40,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187407396] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:40,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:40,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-17 23:49:40,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556179273] [2022-01-17 23:49:40,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:40,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-17 23:49:40,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:40,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-17 23:49:40,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332 [2022-01-17 23:49:40,372 INFO L87 Difference]: Start difference. First operand 4892 states and 10012 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:47,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:47,028 INFO L93 Difference]: Finished difference Result 8378 states and 17220 transitions. [2022-01-17 23:49:47,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-17 23:49:47,028 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:49:47,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:47,037 INFO L225 Difference]: With dead ends: 8378 [2022-01-17 23:49:47,037 INFO L226 Difference]: Without dead ends: 8378 [2022-01-17 23:49:47,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1403, Invalid=7153, Unknown=0, NotChecked=0, Total=8556 [2022-01-17 23:49:47,037 INFO L933 BasicCegarLoop]: 583 mSDtfsCounter, 1878 mSDsluCounter, 11571 mSDsCounter, 0 mSdLazyCounter, 4692 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 12154 SdHoareTripleChecker+Invalid, 4739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:47,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1878 Valid, 12154 Invalid, 4739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 4692 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-17 23:49:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8378 states. [2022-01-17 23:49:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8378 to 5191. [2022-01-17 23:49:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 5188 states have (on average 2.052043176561295) internal successors, (10646), 5190 states have internal predecessors, (10646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 10646 transitions. [2022-01-17 23:49:47,100 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 10646 transitions. Word has length 99 [2022-01-17 23:49:47,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:47,100 INFO L470 AbstractCegarLoop]: Abstraction has 5191 states and 10646 transitions. [2022-01-17 23:49:47,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 10646 transitions. [2022-01-17 23:49:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:49:47,104 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:47,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:49:47,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-01-17 23:49:47,105 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:49:47,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:47,105 INFO L85 PathProgramCache]: Analyzing trace with hash -249393203, now seen corresponding path program 66 times [2022-01-17 23:49:47,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:47,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806525142] [2022-01-17 23:49:47,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:47,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:47,897 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-17 23:49:47,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:47,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806525142] [2022-01-17 23:49:47,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806525142] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:47,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:47,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:49:47,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875284666] [2022-01-17 23:49:47,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:47,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:49:47,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:47,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:49:47,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:49:47,899 INFO L87 Difference]: Start difference. First operand 5191 states and 10646 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:52,532 INFO L93 Difference]: Finished difference Result 8794 states and 18056 transitions. [2022-01-17 23:49:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:49:52,532 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:49:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:52,541 INFO L225 Difference]: With dead ends: 8794 [2022-01-17 23:49:52,541 INFO L226 Difference]: Without dead ends: 8794 [2022-01-17 23:49:52,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:49:52,541 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 1636 mSDsluCounter, 9253 mSDsCounter, 0 mSdLazyCounter, 3541 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 9832 SdHoareTripleChecker+Invalid, 3575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:52,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1636 Valid, 9832 Invalid, 3575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3541 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:49:52,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8794 states. [2022-01-17 23:49:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8794 to 4888. [2022-01-17 23:49:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4888 states, 4885 states have (on average 2.0479017400204707) internal successors, (10004), 4887 states have internal predecessors, (10004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10004 transitions. [2022-01-17 23:49:52,597 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10004 transitions. Word has length 99 [2022-01-17 23:49:52,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:52,598 INFO L470 AbstractCegarLoop]: Abstraction has 4888 states and 10004 transitions. [2022-01-17 23:49:52,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10004 transitions. [2022-01-17 23:49:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:49:52,601 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:52,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:49:52,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-01-17 23:49:52,601 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:49:52,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash 372023121, now seen corresponding path program 67 times [2022-01-17 23:49:52,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:52,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254646456] [2022-01-17 23:49:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:52,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:53,419 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-17 23:49:53,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:53,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254646456] [2022-01-17 23:49:53,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254646456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:53,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:53,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:49:53,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114171317] [2022-01-17 23:49:53,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:53,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:49:53,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:53,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:49:53,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:49:53,420 INFO L87 Difference]: Start difference. First operand 4888 states and 10004 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:58,370 INFO L93 Difference]: Finished difference Result 7427 states and 15230 transitions. [2022-01-17 23:49:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:49:58,371 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:49:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:58,378 INFO L225 Difference]: With dead ends: 7427 [2022-01-17 23:49:58,379 INFO L226 Difference]: Without dead ends: 7427 [2022-01-17 23:49:58,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:49:58,379 INFO L933 BasicCegarLoop]: 583 mSDtfsCounter, 1563 mSDsluCounter, 10682 mSDsCounter, 0 mSdLazyCounter, 4111 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 11265 SdHoareTripleChecker+Invalid, 4147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:58,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1563 Valid, 11265 Invalid, 4147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4111 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:49:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7427 states. [2022-01-17 23:49:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7427 to 4882. [2022-01-17 23:49:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4882 states, 4879 states have (on average 2.047960647673704) internal successors, (9992), 4881 states have internal predecessors, (9992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 9992 transitions. [2022-01-17 23:49:58,438 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 9992 transitions. Word has length 99 [2022-01-17 23:49:58,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:58,438 INFO L470 AbstractCegarLoop]: Abstraction has 4882 states and 9992 transitions. [2022-01-17 23:49:58,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 9992 transitions. [2022-01-17 23:49:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:49:58,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:58,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:49:58,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-01-17 23:49:58,442 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:49:58,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash -856527825, now seen corresponding path program 68 times [2022-01-17 23:49:58,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:58,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139031935] [2022-01-17 23:49:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:58,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:59,236 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-17 23:49:59,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:59,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139031935] [2022-01-17 23:49:59,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139031935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:59,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:59,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:49:59,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921724821] [2022-01-17 23:49:59,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:59,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:49:59,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:59,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:49:59,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:49:59,237 INFO L87 Difference]: Start difference. First operand 4882 states and 9992 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:03,738 INFO L93 Difference]: Finished difference Result 7495 states and 15366 transitions. [2022-01-17 23:50:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:50:03,739 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:50:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:03,747 INFO L225 Difference]: With dead ends: 7495 [2022-01-17 23:50:03,747 INFO L226 Difference]: Without dead ends: 7495 [2022-01-17 23:50:03,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:50:03,748 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 1667 mSDsluCounter, 8993 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 9578 SdHoareTripleChecker+Invalid, 3465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:03,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1667 Valid, 9578 Invalid, 3465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:50:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7495 states. [2022-01-17 23:50:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7495 to 4880. [2022-01-17 23:50:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 4877 states have (on average 2.04798031576789) internal successors, (9988), 4879 states have internal predecessors, (9988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 9988 transitions. [2022-01-17 23:50:03,818 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 9988 transitions. Word has length 99 [2022-01-17 23:50:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:03,818 INFO L470 AbstractCegarLoop]: Abstraction has 4880 states and 9988 transitions. [2022-01-17 23:50:03,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 9988 transitions. [2022-01-17 23:50:03,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:50:03,821 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:03,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:50:03,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-01-17 23:50:03,822 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:50:03,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1282417583, now seen corresponding path program 69 times [2022-01-17 23:50:03,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:03,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555442156] [2022-01-17 23:50:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:03,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:04,920 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-17 23:50:04,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:04,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555442156] [2022-01-17 23:50:04,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555442156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:04,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:04,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-17 23:50:04,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030582998] [2022-01-17 23:50:04,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:04,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-17 23:50:04,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:04,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-17 23:50:04,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332 [2022-01-17 23:50:04,923 INFO L87 Difference]: Start difference. First operand 4880 states and 9988 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:11,493 INFO L93 Difference]: Finished difference Result 8565 states and 17594 transitions. [2022-01-17 23:50:11,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-17 23:50:11,493 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:50:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:11,503 INFO L225 Difference]: With dead ends: 8565 [2022-01-17 23:50:11,503 INFO L226 Difference]: Without dead ends: 8565 [2022-01-17 23:50:11,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1403, Invalid=7153, Unknown=0, NotChecked=0, Total=8556 [2022-01-17 23:50:11,504 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 2155 mSDsluCounter, 10796 mSDsCounter, 0 mSdLazyCounter, 4466 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 11386 SdHoareTripleChecker+Invalid, 4521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:11,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2155 Valid, 11386 Invalid, 4521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4466 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-17 23:50:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8565 states. [2022-01-17 23:50:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8565 to 5264. [2022-01-17 23:50:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5264 states, 5261 states have (on average 2.0513210416270673) internal successors, (10792), 5263 states have internal predecessors, (10792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5264 states to 5264 states and 10792 transitions. [2022-01-17 23:50:11,579 INFO L78 Accepts]: Start accepts. Automaton has 5264 states and 10792 transitions. Word has length 99 [2022-01-17 23:50:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:11,580 INFO L470 AbstractCegarLoop]: Abstraction has 5264 states and 10792 transitions. [2022-01-17 23:50:11,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5264 states and 10792 transitions. [2022-01-17 23:50:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:50:11,584 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:11,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:50:11,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-01-17 23:50:11,584 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:50:11,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash -180351603, now seen corresponding path program 70 times [2022-01-17 23:50:11,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:11,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146202414] [2022-01-17 23:50:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:11,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:12,425 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-17 23:50:12,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:12,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146202414] [2022-01-17 23:50:12,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146202414] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:12,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:12,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:50:12,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469278731] [2022-01-17 23:50:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:12,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:50:12,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:12,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:50:12,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:50:12,428 INFO L87 Difference]: Start difference. First operand 5264 states and 10792 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:16,985 INFO L93 Difference]: Finished difference Result 8981 states and 18430 transitions. [2022-01-17 23:50:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:50:16,986 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:50:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:16,995 INFO L225 Difference]: With dead ends: 8981 [2022-01-17 23:50:16,995 INFO L226 Difference]: Without dead ends: 8981 [2022-01-17 23:50:16,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:50:16,996 INFO L933 BasicCegarLoop]: 586 mSDtfsCounter, 1548 mSDsluCounter, 9410 mSDsCounter, 0 mSdLazyCounter, 3546 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 9996 SdHoareTripleChecker+Invalid, 3579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:16,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1548 Valid, 9996 Invalid, 3579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3546 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:50:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8981 states. [2022-01-17 23:50:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8981 to 4878. [2022-01-17 23:50:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4875 states have (on average 2.048) internal successors, (9984), 4877 states have internal predecessors, (9984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 9984 transitions. [2022-01-17 23:50:17,068 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 9984 transitions. Word has length 99 [2022-01-17 23:50:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:17,068 INFO L470 AbstractCegarLoop]: Abstraction has 4878 states and 9984 transitions. [2022-01-17 23:50:17,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 9984 transitions. [2022-01-17 23:50:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:50:17,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:17,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:50:17,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-01-17 23:50:17,072 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:50:17,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:17,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1718301777, now seen corresponding path program 71 times [2022-01-17 23:50:17,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:17,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286668854] [2022-01-17 23:50:17,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:17,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:17,910 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-17 23:50:17,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:17,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286668854] [2022-01-17 23:50:17,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286668854] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:17,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:17,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:50:17,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832747774] [2022-01-17 23:50:17,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:17,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:50:17,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:17,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:50:17,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:50:17,911 INFO L87 Difference]: Start difference. First operand 4878 states and 9984 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:22,580 INFO L93 Difference]: Finished difference Result 6934 states and 14208 transitions. [2022-01-17 23:50:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:50:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:50:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:22,588 INFO L225 Difference]: With dead ends: 6934 [2022-01-17 23:50:22,588 INFO L226 Difference]: Without dead ends: 6934 [2022-01-17 23:50:22,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=959, Invalid=4741, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:50:22,589 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 1641 mSDsluCounter, 10269 mSDsCounter, 0 mSdLazyCounter, 3692 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 10843 SdHoareTripleChecker+Invalid, 3732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:22,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1641 Valid, 10843 Invalid, 3732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3692 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:50:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6934 states. [2022-01-17 23:50:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6934 to 4872. [2022-01-17 23:50:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions. [2022-01-17 23:50:22,641 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99 [2022-01-17 23:50:22,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:22,641 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions. [2022-01-17 23:50:22,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions. [2022-01-17 23:50:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:50:22,644 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:22,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:50:22,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-01-17 23:50:22,645 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:50:22,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:22,645 INFO L85 PathProgramCache]: Analyzing trace with hash -86186341, now seen corresponding path program 72 times [2022-01-17 23:50:22,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:22,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351206437] [2022-01-17 23:50:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:22,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:23,478 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-17 23:50:23,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:23,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351206437] [2022-01-17 23:50:23,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351206437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:23,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:23,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:50:23,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801984429] [2022-01-17 23:50:23,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:23,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:50:23,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:50:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:50:23,479 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:28,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:28,224 INFO L93 Difference]: Finished difference Result 6530 states and 13401 transitions. [2022-01-17 23:50:28,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:50:28,224 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:50:28,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:28,232 INFO L225 Difference]: With dead ends: 6530 [2022-01-17 23:50:28,232 INFO L226 Difference]: Without dead ends: 6530 [2022-01-17 23:50:28,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:50:28,233 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 1689 mSDsluCounter, 9441 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 9993 SdHoareTripleChecker+Invalid, 3747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:28,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1689 Valid, 9993 Invalid, 3747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3712 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:50:28,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6530 states. [2022-01-17 23:50:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6530 to 4896. [2022-01-17 23:50:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4896 states, 4893 states have (on average 2.0484365419987736) internal successors, (10023), 4895 states have internal predecessors, (10023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10023 transitions. [2022-01-17 23:50:28,288 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10023 transitions. Word has length 99 [2022-01-17 23:50:28,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:28,288 INFO L470 AbstractCegarLoop]: Abstraction has 4896 states and 10023 transitions. [2022-01-17 23:50:28,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10023 transitions. [2022-01-17 23:50:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:50:28,292 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:28,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:50:28,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-01-17 23:50:28,292 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:50:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:28,293 INFO L85 PathProgramCache]: Analyzing trace with hash -178829853, now seen corresponding path program 73 times [2022-01-17 23:50:28,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:28,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259735009] [2022-01-17 23:50:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:28,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:29,021 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-17 23:50:29,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:29,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259735009] [2022-01-17 23:50:29,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259735009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:29,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:29,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:50:29,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145691093] [2022-01-17 23:50:29,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:29,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:50:29,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:29,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:50:29,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:50:29,022 INFO L87 Difference]: Start difference. First operand 4896 states and 10023 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:34,119 INFO L93 Difference]: Finished difference Result 8589 states and 17647 transitions. [2022-01-17 23:50:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:50:34,119 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:50:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:34,129 INFO L225 Difference]: With dead ends: 8589 [2022-01-17 23:50:34,129 INFO L226 Difference]: Without dead ends: 8589 [2022-01-17 23:50:34,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1050, Invalid=4956, Unknown=0, NotChecked=0, Total=6006 [2022-01-17 23:50:34,129 INFO L933 BasicCegarLoop]: 598 mSDtfsCounter, 1725 mSDsluCounter, 10087 mSDsCounter, 0 mSdLazyCounter, 3715 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 10685 SdHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:34,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1725 Valid, 10685 Invalid, 3752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3715 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:50:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8589 states. [2022-01-17 23:50:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8589 to 4898. [2022-01-17 23:50:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4898 states, 4895 states have (on average 2.0484167517875385) internal successors, (10027), 4897 states have internal predecessors, (10027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4898 states to 4898 states and 10027 transitions. [2022-01-17 23:50:34,187 INFO L78 Accepts]: Start accepts. Automaton has 4898 states and 10027 transitions. Word has length 99 [2022-01-17 23:50:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:34,188 INFO L470 AbstractCegarLoop]: Abstraction has 4898 states and 10027 transitions. [2022-01-17 23:50:34,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4898 states and 10027 transitions. [2022-01-17 23:50:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:50:34,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:34,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:50:34,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-01-17 23:50:34,191 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:50:34,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1028339571, now seen corresponding path program 74 times [2022-01-17 23:50:34,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:34,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035978335] [2022-01-17 23:50:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:34,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:35,036 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-17 23:50:35,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:35,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035978335] [2022-01-17 23:50:35,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035978335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:35,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:35,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:50:35,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698518060] [2022-01-17 23:50:35,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:35,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:50:35,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:35,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:50:35,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:50:35,037 INFO L87 Difference]: Start difference. First operand 4898 states and 10027 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:40,121 INFO L93 Difference]: Finished difference Result 6631 states and 13605 transitions. [2022-01-17 23:50:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:50:40,121 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:50:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:40,128 INFO L225 Difference]: With dead ends: 6631 [2022-01-17 23:50:40,128 INFO L226 Difference]: Without dead ends: 6631 [2022-01-17 23:50:40,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=954, Invalid=4746, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:50:40,129 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1577 mSDsluCounter, 10337 mSDsCounter, 0 mSdLazyCounter, 4034 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 10903 SdHoareTripleChecker+Invalid, 4074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:40,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1577 Valid, 10903 Invalid, 4074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4034 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:50:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6631 states. [2022-01-17 23:50:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6631 to 4880. [2022-01-17 23:50:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 4877 states have (on average 2.048185359852368) internal successors, (9989), 4879 states have internal predecessors, (9989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 9989 transitions. [2022-01-17 23:50:40,180 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 9989 transitions. Word has length 99 [2022-01-17 23:50:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:40,180 INFO L470 AbstractCegarLoop]: Abstraction has 4880 states and 9989 transitions. [2022-01-17 23:50:40,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 9989 transitions. [2022-01-17 23:50:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:50:40,183 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:40,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:50:40,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-01-17 23:50:40,184 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:50:40,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash -966883357, now seen corresponding path program 75 times [2022-01-17 23:50:40,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:40,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546253448] [2022-01-17 23:50:40,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:40,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:40,970 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-17 23:50:40,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:40,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546253448] [2022-01-17 23:50:40,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546253448] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:40,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:40,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:50:40,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002077307] [2022-01-17 23:50:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:40,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:50:40,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:40,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:50:40,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:50:40,972 INFO L87 Difference]: Start difference. First operand 4880 states and 9989 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:46,666 INFO L93 Difference]: Finished difference Result 8741 states and 17957 transitions. [2022-01-17 23:50:46,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-17 23:50:46,667 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:50:46,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:46,675 INFO L225 Difference]: With dead ends: 8741 [2022-01-17 23:50:46,675 INFO L226 Difference]: Without dead ends: 8741 [2022-01-17 23:50:46,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1180, Invalid=5462, Unknown=0, NotChecked=0, Total=6642 [2022-01-17 23:50:46,676 INFO L933 BasicCegarLoop]: 622 mSDtfsCounter, 1714 mSDsluCounter, 11419 mSDsCounter, 0 mSdLazyCounter, 4123 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 12041 SdHoareTripleChecker+Invalid, 4160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 4123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:46,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1714 Valid, 12041 Invalid, 4160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 4123 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:50:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8741 states. [2022-01-17 23:50:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8741 to 4881. [2022-01-17 23:50:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4881 states, 4878 states have (on average 2.0481754817548175) internal successors, (9991), 4880 states have internal predecessors, (9991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 9991 transitions. [2022-01-17 23:50:46,735 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 9991 transitions. Word has length 99 [2022-01-17 23:50:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:46,735 INFO L470 AbstractCegarLoop]: Abstraction has 4881 states and 9991 transitions. [2022-01-17 23:50:46,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 9991 transitions. [2022-01-17 23:50:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:50:46,739 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:46,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:50:46,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-01-17 23:50:46,739 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:50:46,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash -988076429, now seen corresponding path program 76 times [2022-01-17 23:50:46,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:46,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752075855] [2022-01-17 23:50:46,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:46,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:47,444 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-17 23:50:47,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:47,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752075855] [2022-01-17 23:50:47,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752075855] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:47,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:47,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:50:47,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823979166] [2022-01-17 23:50:47,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:47,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:50:47,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:50:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:50:47,445 INFO L87 Difference]: Start difference. First operand 4881 states and 9991 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:52,512 INFO L93 Difference]: Finished difference Result 7688 states and 15784 transitions. [2022-01-17 23:50:52,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:50:52,512 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:50:52,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:52,520 INFO L225 Difference]: With dead ends: 7688 [2022-01-17 23:50:52,520 INFO L226 Difference]: Without dead ends: 7688 [2022-01-17 23:50:52,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1044, Invalid=4962, Unknown=0, NotChecked=0, Total=6006 [2022-01-17 23:50:52,520 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1843 mSDsluCounter, 10085 mSDsCounter, 0 mSdLazyCounter, 3670 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 10675 SdHoareTripleChecker+Invalid, 3703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:52,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1843 Valid, 10675 Invalid, 3703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3670 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:50:52,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7688 states. [2022-01-17 23:50:52,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7688 to 4883. [2022-01-17 23:50:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4883 states, 4880 states have (on average 2.048155737704918) internal successors, (9995), 4882 states have internal predecessors, (9995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4883 states to 4883 states and 9995 transitions. [2022-01-17 23:50:52,575 INFO L78 Accepts]: Start accepts. Automaton has 4883 states and 9995 transitions. Word has length 99 [2022-01-17 23:50:52,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:52,575 INFO L470 AbstractCegarLoop]: Abstraction has 4883 states and 9995 transitions. [2022-01-17 23:50:52,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:52,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4883 states and 9995 transitions. [2022-01-17 23:50:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:50:52,579 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:52,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:50:52,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-01-17 23:50:52,579 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:50:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1472913395, now seen corresponding path program 77 times [2022-01-17 23:50:52,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:52,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659511661] [2022-01-17 23:50:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:52,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:53,437 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-17 23:50:53,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:53,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659511661] [2022-01-17 23:50:53,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659511661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:53,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:53,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:50:53,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331006004] [2022-01-17 23:50:53,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:53,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:50:53,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:53,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:50:53,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:50:53,439 INFO L87 Difference]: Start difference. First operand 4883 states and 9995 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:58,236 INFO L93 Difference]: Finished difference Result 6643 states and 13630 transitions. [2022-01-17 23:50:58,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:50:58,237 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:50:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:58,243 INFO L225 Difference]: With dead ends: 6643 [2022-01-17 23:50:58,244 INFO L226 Difference]: Without dead ends: 6643 [2022-01-17 23:50:58,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=950, Invalid=4750, Unknown=0, NotChecked=0, Total=5700 [2022-01-17 23:50:58,244 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1515 mSDsluCounter, 9693 mSDsCounter, 0 mSdLazyCounter, 3509 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 10259 SdHoareTripleChecker+Invalid, 3549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:58,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 10259 Invalid, 3549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3509 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:50:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6643 states. [2022-01-17 23:50:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6643 to 4872. [2022-01-17 23:50:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions. [2022-01-17 23:50:58,296 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99 [2022-01-17 23:50:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:58,296 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions. [2022-01-17 23:50:58,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions. [2022-01-17 23:50:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:50:58,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:58,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:50:58,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-01-17 23:50:58,300 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:50:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1628672577, now seen corresponding path program 78 times [2022-01-17 23:50:58,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:58,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701385457] [2022-01-17 23:50:58,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:58,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:59,023 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-17 23:50:59,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:59,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701385457] [2022-01-17 23:50:59,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701385457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:59,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:59,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:50:59,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92786578] [2022-01-17 23:50:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:59,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:50:59,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:50:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:50:59,025 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:51:04,646 INFO L93 Difference]: Finished difference Result 7027 states and 14376 transitions. [2022-01-17 23:51:04,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-17 23:51:04,647 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:51:04,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:51:04,655 INFO L225 Difference]: With dead ends: 7027 [2022-01-17 23:51:04,656 INFO L226 Difference]: Without dead ends: 7027 [2022-01-17 23:51:04,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1251, Invalid=5721, Unknown=0, NotChecked=0, Total=6972 [2022-01-17 23:51:04,656 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1976 mSDsluCounter, 10521 mSDsCounter, 0 mSdLazyCounter, 3681 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 11111 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:51:04,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1976 Valid, 11111 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3681 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:51:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states. [2022-01-17 23:51:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 4887. [2022-01-17 23:51:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4884 states have (on average 2.0479115479115477) internal successors, (10002), 4886 states have internal predecessors, (10002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 10002 transitions. [2022-01-17 23:51:04,718 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 10002 transitions. Word has length 99 [2022-01-17 23:51:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:51:04,718 INFO L470 AbstractCegarLoop]: Abstraction has 4887 states and 10002 transitions. [2022-01-17 23:51:04,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 10002 transitions. [2022-01-17 23:51:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:51:04,722 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:51:04,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:51:04,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-01-17 23:51:04,723 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:51:04,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:51:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1781291341, now seen corresponding path program 79 times [2022-01-17 23:51:04,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:51:04,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373464213] [2022-01-17 23:51:04,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:51:04,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:51:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:51:05,532 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-17 23:51:05,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:51:05,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373464213] [2022-01-17 23:51:05,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373464213] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:51:05,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:51:05,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-17 23:51:05,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431756548] [2022-01-17 23:51:05,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:51:05,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-17 23:51:05,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:51:05,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-17 23:51:05,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 23:51:05,534 INFO L87 Difference]: Start difference. First operand 4887 states and 10002 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:51:11,007 INFO L93 Difference]: Finished difference Result 7452 states and 15275 transitions. [2022-01-17 23:51:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-17 23:51:11,007 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:51:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:51:11,015 INFO L225 Difference]: With dead ends: 7452 [2022-01-17 23:51:11,015 INFO L226 Difference]: Without dead ends: 7452 [2022-01-17 23:51:11,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1172, Invalid=5470, Unknown=0, NotChecked=0, Total=6642 [2022-01-17 23:51:11,016 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 2070 mSDsluCounter, 10479 mSDsCounter, 0 mSdLazyCounter, 3699 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2070 SdHoareTripleChecker+Valid, 11069 SdHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:51:11,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2070 Valid, 11069 Invalid, 3746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3699 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-17 23:51:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2022-01-17 23:51:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 4888. [2022-01-17 23:51:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4888 states, 4885 states have (on average 2.0479017400204707) internal successors, (10004), 4887 states have internal predecessors, (10004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10004 transitions. [2022-01-17 23:51:11,074 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10004 transitions. Word has length 99 [2022-01-17 23:51:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:51:11,074 INFO L470 AbstractCegarLoop]: Abstraction has 4888 states and 10004 transitions. [2022-01-17 23:51:11,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10004 transitions. [2022-01-17 23:51:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:51:11,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:51:11,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:51:11,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-01-17 23:51:11,080 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:51:11,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:51:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1760098269, now seen corresponding path program 80 times [2022-01-17 23:51:11,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:51:11,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661117491] [2022-01-17 23:51:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:51:11,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:51:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:51:11,869 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-17 23:51:11,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:51:11,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661117491] [2022-01-17 23:51:11,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661117491] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:51:11,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:51:11,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:51:11,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057437216] [2022-01-17 23:51:11,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:51:11,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:51:11,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:51:11,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:51:11,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:51:11,870 INFO L87 Difference]: Start difference. First operand 4888 states and 10004 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:51:16,884 INFO L93 Difference]: Finished difference Result 7365 states and 15098 transitions. [2022-01-17 23:51:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-17 23:51:16,885 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:51:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:51:16,892 INFO L225 Difference]: With dead ends: 7365 [2022-01-17 23:51:16,892 INFO L226 Difference]: Without dead ends: 7365 [2022-01-17 23:51:16,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1038, Invalid=4968, Unknown=0, NotChecked=0, Total=6006 [2022-01-17 23:51:16,893 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1647 mSDsluCounter, 10351 mSDsCounter, 0 mSdLazyCounter, 3807 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 10918 SdHoareTripleChecker+Invalid, 3845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:51:16,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1647 Valid, 10918 Invalid, 3845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3807 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-17 23:51:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7365 states. [2022-01-17 23:51:16,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7365 to 4890. [2022-01-17 23:51:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4887 states have (on average 2.0478821362799264) internal successors, (10008), 4889 states have internal predecessors, (10008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 10008 transitions. [2022-01-17 23:51:16,947 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 10008 transitions. Word has length 99 [2022-01-17 23:51:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:51:16,947 INFO L470 AbstractCegarLoop]: Abstraction has 4890 states and 10008 transitions. [2022-01-17 23:51:16,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 10008 transitions. [2022-01-17 23:51:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:51:16,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:51:16,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:51:16,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-01-17 23:51:16,951 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:51:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:51:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash -73879203, now seen corresponding path program 81 times [2022-01-17 23:51:16,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:51:16,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079291695] [2022-01-17 23:51:16,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:51:16,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:51:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:51:17,789 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-17 23:51:17,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:51:17,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079291695] [2022-01-17 23:51:17,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079291695] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:51:17,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:51:17,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:51:17,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430644023] [2022-01-17 23:51:17,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:51:17,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:51:17,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:51:17,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:51:17,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:51:17,790 INFO L87 Difference]: Start difference. First operand 4890 states and 10008 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:51:22,365 INFO L93 Difference]: Finished difference Result 6320 states and 12944 transitions. [2022-01-17 23:51:22,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:51:22,366 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-17 23:51:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:51:22,372 INFO L225 Difference]: With dead ends: 6320 [2022-01-17 23:51:22,372 INFO L226 Difference]: Without dead ends: 6320 [2022-01-17 23:51:22,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=931, Invalid=4619, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:51:22,372 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 1613 mSDsluCounter, 9090 mSDsCounter, 0 mSdLazyCounter, 3339 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 9633 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:51:22,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 9633 Invalid, 3378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3339 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:51:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6320 states. [2022-01-17 23:51:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6320 to 4887. [2022-01-17 23:51:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4884 states have (on average 2.0479115479115477) internal successors, (10002), 4886 states have internal predecessors, (10002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 10002 transitions. [2022-01-17 23:51:22,420 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 10002 transitions. Word has length 99 [2022-01-17 23:51:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:51:22,420 INFO L470 AbstractCegarLoop]: Abstraction has 4887 states and 10002 transitions. [2022-01-17 23:51:22,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 10002 transitions. [2022-01-17 23:51:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-17 23:51:22,424 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:51:22,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 23:51:22,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-01-17 23:51:22,424 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-17 23:51:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:51:22,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1594576337, now seen corresponding path program 82 times [2022-01-17 23:51:22,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:51:22,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88465871] [2022-01-17 23:51:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:51:22,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:51:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:51:23,254 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-17 23:51:23,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:51:23,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88465871] [2022-01-17 23:51:23,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88465871] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:51:23,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:51:23,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-17 23:51:23,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813834055] [2022-01-17 23:51:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:51:23,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-17 23:51:23,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:51:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-17 23:51:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-01-17 23:51:23,256 INFO L87 Difference]: Start difference. First operand 4887 states and 10002 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-01-17 23:51:27,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-17 23:51:27,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=911, Invalid=4345, Unknown=0, NotChecked=0, Total=5256 [2022-01-17 23:51:27,525 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 1194 mSDsluCounter, 7838 mSDsCounter, 0 mSdLazyCounter, 2949 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 8283 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-17 23:51:27,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1194 Valid, 8283 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2949 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-17 23:51:27,526 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-17 23:51:27,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-01-17 23:51:27,527 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (4887states) and FLOYD_HOARE automaton (currently 44 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (4897 states constructed, input type IntersectNwa). [2022-01-17 23:51:27,529 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-17 23:51:27,529 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-01-17 23:51:27,529 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-01-17 23:51:27,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 7 remaining) [2022-01-17 23:51:27,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-01-17 23:51:27,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-17 23:51:27,536 INFO L732 BasicCegarLoop]: Path program histogram: [82, 24, 1, 1, 1] [2022-01-17 23:51:27,540 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-17 23:51:27,540 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-17 23:51:27,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.01 11:51:27 BasicIcfg [2022-01-17 23:51:27,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-17 23:51:27,542 INFO L158 Benchmark]: Toolchain (without parser) took 680016.53ms. Allocated memory was 375.4MB in the beginning and 484.4MB in the end (delta: 109.1MB). Free memory was 319.7MB in the beginning and 371.6MB in the end (delta: -51.9MB). Peak memory consumption was 58.3MB. Max. memory is 16.0GB. [2022-01-17 23:51:27,542 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 375.4MB. Free memory is still 337.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-17 23:51:27,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.79ms. Allocated memory is still 375.4MB. Free memory was 319.5MB in the beginning and 333.4MB in the end (delta: -13.8MB). Peak memory consumption was 15.8MB. Max. memory is 16.0GB. [2022-01-17 23:51:27,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.49ms. Allocated memory is still 375.4MB. Free memory was 333.4MB in the beginning and 330.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-17 23:51:27,542 INFO L158 Benchmark]: Boogie Preprocessor took 35.75ms. Allocated memory is still 375.4MB. Free memory was 330.2MB in the beginning and 328.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-17 23:51:27,543 INFO L158 Benchmark]: RCFGBuilder took 481.51ms. Allocated memory is still 375.4MB. Free memory was 328.1MB in the beginning and 311.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-17 23:51:27,543 INFO L158 Benchmark]: TraceAbstraction took 678940.90ms. Allocated memory was 375.4MB in the beginning and 484.4MB in the end (delta: 109.1MB). Free memory was 311.4MB in the beginning and 371.6MB in the end (delta: -60.3MB). Peak memory consumption was 50.9MB. Max. memory is 16.0GB. [2022-01-17 23:51:27,543 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 375.4MB. Free memory is still 337.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 480.79ms. Allocated memory is still 375.4MB. Free memory was 319.5MB in the beginning and 333.4MB in the end (delta: -13.8MB). Peak memory consumption was 15.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.49ms. Allocated memory is still 375.4MB. Free memory was 333.4MB in the beginning and 330.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.75ms. Allocated memory is still 375.4MB. Free memory was 330.2MB in the beginning and 328.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 481.51ms. Allocated memory is still 375.4MB. Free memory was 328.1MB in the beginning and 311.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 678940.90ms. Allocated memory was 375.4MB in the beginning and 484.4MB in the end (delta: 109.1MB). Free memory was 311.4MB in the beginning and 371.6MB in the end (delta: -60.3MB). Peak memory consumption was 50.9MB. Max. memory is 16.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 - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (4887states) and FLOYD_HOARE automaton (currently 44 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (4897 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 836]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (4887states) and FLOYD_HOARE automaton (currently 44 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (4897 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 837]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (4887states) and FLOYD_HOARE automaton (currently 44 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (4897 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 854]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (4887states) and FLOYD_HOARE automaton (currently 44 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (4897 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 220 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 678.7s, OverallIterations: 109, TraceHistogramMax: 1, PathProgramHistogramMax: 82, EmptinessCheckTime: 0.4s, AutomataDifference: 582.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173408 SdHoareTripleChecker+Valid, 150.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173408 mSDsluCounter, 977986 SdHoareTripleChecker+Invalid, 127.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 921542 mSDsCounter, 4198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362850 IncrementalHoareTripleChecker+Invalid, 367048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4198 mSolverCounterUnsat, 56444 mSDtfsCounter, 362850 mSolverCounterSat, 2.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8674 GetRequests, 451 SyntacticMatches, 60 SemanticMatches, 8163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116591 ImplicationChecksByTransitivity, 465.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5264occurred in iteration=96, InterpolantAutomatonStates: 5273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.6s AutomataMinimizationTime, 108 MinimizatonAttempts, 262118 StatesRemovedByMinimization, 107 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 87.1s InterpolantComputationTime, 10577 NumberOfCodeBlocks, 10577 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 10468 ConstructedInterpolants, 0 QuantifiedInterpolants, 187098 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 109 InterpolantComputations, 109 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown