/usr/bin/java -Xmx8000000000 -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.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 11:46:32,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 11:46:32,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 11:46:32,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 11:46:32,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 11:46:32,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 11:46:32,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 11:46:32,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 11:46:32,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 11:46:32,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 11:46:32,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 11:46:32,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 11:46:32,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 11:46:32,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 11:46:32,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 11:46:32,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 11:46:32,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 11:46:32,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 11:46:32,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 11:46:32,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 11:46:32,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 11:46:32,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 11:46:32,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 11:46:32,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 11:46:32,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 11:46:32,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 11:46:32,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 11:46:32,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 11:46:32,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 11:46:32,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 11:46:32,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 11:46:32,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 11:46:32,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 11:46:32,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 11:46:32,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 11:46:32,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 11:46:32,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 11:46:32,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 11:46:32,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 11:46:32,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 11:46:32,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 11:46:32,772 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 [2021-08-21 11:46:32,800 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 11:46:32,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 11:46:32,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-21 11:46:32,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-21 11:46:32,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 11:46:32,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 11:46:32,803 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 11:46:32,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 11:46:32,803 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 11:46:32,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 11:46:32,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 11:46:32,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 11:46:32,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 11:46:32,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 11:46:32,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 11:46:32,804 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 11:46:32,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 11:46:32,805 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 11:46:32,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 11:46:32,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 11:46:32,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 11:46:32,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 11:46:32,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 11:46:32,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:46:32,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 11:46:32,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 11:46:32,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 11:46:32,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 11:46:32,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 11:46:32,806 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 11:46:32,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 11:46:32,806 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 [2021-08-21 11:46:33,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 11:46:33,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 11:46:33,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 11:46:33,086 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 11:46:33,087 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 11:46:33,088 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 [2021-08-21 11:46:33,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d9dc0a4d/86795725ae2e48cd8f187146e35dbc72/FLAGe684b8e94 [2021-08-21 11:46:33,770 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 11:46:33,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2021-08-21 11:46:33,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d9dc0a4d/86795725ae2e48cd8f187146e35dbc72/FLAGe684b8e94 [2021-08-21 11:46:33,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d9dc0a4d/86795725ae2e48cd8f187146e35dbc72 [2021-08-21 11:46:33,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 11:46:33,912 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 11:46:33,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 11:46:33,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 11:46:33,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 11:46:33,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:46:33" (1/1) ... [2021-08-21 11:46:33,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e190af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:33, skipping insertion in model container [2021-08-21 11:46:33,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:46:33" (1/1) ... [2021-08-21 11:46:33,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 11:46:33,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 11:46:34,036 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-21 11:46:34,254 WARN L228 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] [2021-08-21 11:46:34,258 WARN L228 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] [2021-08-21 11:46:34,259 WARN L228 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] [2021-08-21 11:46:34,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:46:34,275 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 11:46:34,290 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-21 11:46:34,315 WARN L228 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] [2021-08-21 11:46:34,316 WARN L228 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] [2021-08-21 11:46:34,316 WARN L228 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] [2021-08-21 11:46:34,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:46:34,353 INFO L208 MainTranslator]: Completed translation [2021-08-21 11:46:34,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34 WrapperNode [2021-08-21 11:46:34,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 11:46:34,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 11:46:34,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 11:46:34,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 11:46:34,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34" (1/1) ... [2021-08-21 11:46:34,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34" (1/1) ... [2021-08-21 11:46:34,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 11:46:34,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 11:46:34,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 11:46:34,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 11:46:34,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34" (1/1) ... [2021-08-21 11:46:34,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34" (1/1) ... [2021-08-21 11:46:34,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34" (1/1) ... [2021-08-21 11:46:34,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34" (1/1) ... [2021-08-21 11:46:34,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34" (1/1) ... [2021-08-21 11:46:34,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34" (1/1) ... [2021-08-21 11:46:34,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34" (1/1) ... [2021-08-21 11:46:34,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 11:46:34,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 11:46:34,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 11:46:34,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 11:46:34,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34" (1/1) ... [2021-08-21 11:46:34,458 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:46:34,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 11:46:34,478 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) [2021-08-21 11:46:34,502 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 [2021-08-21 11:46:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2021-08-21 11:46:34,516 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2021-08-21 11:46:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 11:46:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 11:46:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-21 11:46:34,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 11:46:34,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 11:46:34,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 11:46:34,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 11:46:34,519 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 11:46:34,868 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 11:46:34,868 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-08-21 11:46:34,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:46:34 BoogieIcfgContainer [2021-08-21 11:46:34,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 11:46:34,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 11:46:34,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 11:46:34,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 11:46:34,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 11:46:33" (1/3) ... [2021-08-21 11:46:34,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286c6aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:46:34, skipping insertion in model container [2021-08-21 11:46:34,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:34" (2/3) ... [2021-08-21 11:46:34,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286c6aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:46:34, skipping insertion in model container [2021-08-21 11:46:34,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:46:34" (3/3) ... [2021-08-21 11:46:34,874 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2021-08-21 11:46:34,882 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 11:46:34,883 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 11:46:34,883 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-08-21 11:46:34,883 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 11:46:34,926 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,926 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,926 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,926 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,928 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,928 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,928 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,928 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,929 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,929 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,929 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,929 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,929 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,929 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,930 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,930 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,930 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,930 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,930 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,930 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,931 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,931 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,931 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,931 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,931 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,931 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,932 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,932 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,933 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,933 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,933 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,933 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,934 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,934 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,935 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,935 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,935 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,936 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,936 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,936 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,938 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,939 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,939 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,939 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,939 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,939 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,939 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,939 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,939 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,939 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,940 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,940 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,940 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,940 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,940 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,941 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,941 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,941 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,941 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,941 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,942 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,942 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,942 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,942 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,942 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,942 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,942 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,942 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,942 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,942 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,942 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,943 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,943 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,943 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,943 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,943 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,943 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,943 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,943 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,944 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,944 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,944 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,944 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,944 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,944 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,944 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,944 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,944 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,945 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,945 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,945 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,946 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,946 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,946 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,947 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,949 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,953 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,953 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,953 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,953 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,954 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,954 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,954 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,954 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,954 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,955 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,955 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,955 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,955 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,955 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,955 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,955 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,956 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,956 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,956 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,956 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,956 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,956 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,956 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,956 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,956 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,956 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,956 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,957 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,957 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,957 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,957 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,957 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,957 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,957 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,957 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,957 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,958 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,958 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,958 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,958 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,958 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,958 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,958 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,958 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,959 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,960 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,960 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,960 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,960 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,960 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,961 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,961 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,962 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,962 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,962 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,962 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,962 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,962 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,962 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,962 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,962 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,962 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,962 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,963 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,964 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,965 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,965 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,965 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,965 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,965 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,965 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,965 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,965 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,965 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,965 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,966 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,966 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,967 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,967 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,967 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,967 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,967 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,967 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,967 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,968 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,970 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,970 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,970 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,970 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,971 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,972 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,975 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,976 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:34,982 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-08-21 11:46:35,011 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 11:46:35,017 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, mConcurrency=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 [2021-08-21 11:46:35,017 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-21 11:46:35,029 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 142 transitions, 292 flow [2021-08-21 11:46:35,098 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2067 states, 2064 states have (on average 2.142926356589147) internal successors, (4423), 2066 states have internal predecessors, (4423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 2067 states, 2064 states have (on average 2.142926356589147) internal successors, (4423), 2066 states have internal predecessors, (4423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-21 11:46:35,109 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:46:35,110 INFO L512 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] [2021-08-21 11:46:35,110 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)] === [2021-08-21 11:46:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:46:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1385072715, now seen corresponding path program 1 times [2021-08-21 11:46:35,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:46:35,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886645925] [2021-08-21 11:46:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:46:35,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:46:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:46:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:46:35,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:46:35,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886645925] [2021-08-21 11:46:35,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886645925] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:46:35,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:46:35,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 11:46:35,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355700056] [2021-08-21 11:46:35,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-21 11:46:35,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:46:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-21 11:46:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-21 11:46:35,285 INFO L87 Difference]: Start difference. First operand has 2067 states, 2064 states have (on average 2.142926356589147) internal successors, (4423), 2066 states have internal predecessors, (4423), 0 states have call successors, (0), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:46:35,327 INFO L93 Difference]: Finished difference Result 2067 states and 4201 transitions. [2021-08-21 11:46:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-21 11:46:35,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-08-21 11:46:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:46:35,348 INFO L225 Difference]: With dead ends: 2067 [2021-08-21 11:46:35,349 INFO L226 Difference]: Without dead ends: 2067 [2021-08-21 11:46:35,349 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-21 11:46:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2021-08-21 11:46:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2067. [2021-08-21 11:46:35,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 2064 states have (on average 2.0353682170542635) internal successors, (4201), 2066 states have internal predecessors, (4201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 4201 transitions. [2021-08-21 11:46:35,454 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 4201 transitions. Word has length 35 [2021-08-21 11:46:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:46:35,454 INFO L470 AbstractCegarLoop]: Abstraction has 2067 states and 4201 transitions. [2021-08-21 11:46:35,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 4201 transitions. [2021-08-21 11:46:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-21 11:46:35,455 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:46:35,455 INFO L512 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] [2021-08-21 11:46:35,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 11:46:35,456 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)] === [2021-08-21 11:46:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:46:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 12387332, now seen corresponding path program 1 times [2021-08-21 11:46:35,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:46:35,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964447911] [2021-08-21 11:46:35,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:46:35,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:46:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:46:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:46:35,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:46:35,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964447911] [2021-08-21 11:46:35,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964447911] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:46:35,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:46:35,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 11:46:35,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540117264] [2021-08-21 11:46:35,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 11:46:35,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:46:35,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 11:46:35,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:46:35,507 INFO L87 Difference]: Start difference. First operand 2067 states and 4201 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:46:35,542 INFO L93 Difference]: Finished difference Result 3359 states and 6857 transitions. [2021-08-21 11:46:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 11:46:35,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-08-21 11:46:35,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:46:35,554 INFO L225 Difference]: With dead ends: 3359 [2021-08-21 11:46:35,554 INFO L226 Difference]: Without dead ends: 3359 [2021-08-21 11:46:35,555 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:46:35,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2021-08-21 11:46:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 2543. [2021-08-21 11:46:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2540 states have (on average 2.0476377952755906) internal successors, (5201), 2542 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 5201 transitions. [2021-08-21 11:46:35,612 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 5201 transitions. Word has length 36 [2021-08-21 11:46:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:46:35,612 INFO L470 AbstractCegarLoop]: Abstraction has 2543 states and 5201 transitions. [2021-08-21 11:46:35,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 5201 transitions. [2021-08-21 11:46:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-21 11:46:35,616 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:46:35,616 INFO L512 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] [2021-08-21 11:46:35,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 11:46:35,616 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)] === [2021-08-21 11:46:35,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:46:35,617 INFO L82 PathProgramCache]: Analyzing trace with hash 761184174, now seen corresponding path program 1 times [2021-08-21 11:46:35,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:46:35,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910045250] [2021-08-21 11:46:35,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:46:35,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:46:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:46:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:46:36,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:46:36,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910045250] [2021-08-21 11:46:36,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910045250] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:46:36,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:46:36,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-21 11:46:36,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139839495] [2021-08-21 11:46:36,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-21 11:46:36,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:46:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-21 11:46:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-08-21 11:46:36,277 INFO L87 Difference]: Start difference. First operand 2543 states and 5201 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:46:38,048 INFO L93 Difference]: Finished difference Result 2806 states and 5743 transitions. [2021-08-21 11:46:38,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-21 11:46:38,048 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2021-08-21 11:46:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:46:38,057 INFO L225 Difference]: With dead ends: 2806 [2021-08-21 11:46:38,057 INFO L226 Difference]: Without dead ends: 2691 [2021-08-21 11:46:38,058 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1426.9ms TimeCoverageRelationStatistics Valid=375, Invalid=1031, Unknown=0, NotChecked=0, Total=1406 [2021-08-21 11:46:38,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2021-08-21 11:46:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2499. [2021-08-21 11:46:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2499 states, 2496 states have (on average 2.0516826923076925) internal successors, (5121), 2498 states have internal predecessors, (5121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 5121 transitions. [2021-08-21 11:46:38,106 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 5121 transitions. Word has length 65 [2021-08-21 11:46:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:46:38,107 INFO L470 AbstractCegarLoop]: Abstraction has 2499 states and 5121 transitions. [2021-08-21 11:46:38,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 5121 transitions. [2021-08-21 11:46:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:46:38,110 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:46:38,110 INFO L512 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] [2021-08-21 11:46:38,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 11:46:38,111 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)] === [2021-08-21 11:46:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:46:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1137939345, now seen corresponding path program 1 times [2021-08-21 11:46:38,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:46:38,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070435422] [2021-08-21 11:46:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:46:38,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:46:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:46:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:46:38,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:46:38,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070435422] [2021-08-21 11:46:38,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070435422] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:46:38,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:46:38,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-08-21 11:46:38,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469860353] [2021-08-21 11:46:38,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-21 11:46:38,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:46:38,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-21 11:46:38,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-08-21 11:46:38,988 INFO L87 Difference]: Start difference. First operand 2499 states and 5121 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:46:51,498 INFO L93 Difference]: Finished difference Result 3468 states and 7100 transitions. [2021-08-21 11:46:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-08-21 11:46:51,499 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:46:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:46:51,510 INFO L225 Difference]: With dead ends: 3468 [2021-08-21 11:46:51,510 INFO L226 Difference]: Without dead ends: 3468 [2021-08-21 11:46:51,512 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 11147.9ms TimeCoverageRelationStatistics Valid=3036, Invalid=7470, Unknown=0, NotChecked=0, Total=10506 [2021-08-21 11:46:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2021-08-21 11:46:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 2894. [2021-08-21 11:46:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 2891 states have (on average 2.051193358699412) internal successors, (5930), 2893 states have internal predecessors, (5930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 5930 transitions. [2021-08-21 11:46:51,587 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 5930 transitions. Word has length 85 [2021-08-21 11:46:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:46:51,588 INFO L470 AbstractCegarLoop]: Abstraction has 2894 states and 5930 transitions. [2021-08-21 11:46:51,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 5930 transitions. [2021-08-21 11:46:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:46:51,592 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:46:51,592 INFO L512 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] [2021-08-21 11:46:51,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 11:46:51,592 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)] === [2021-08-21 11:46:51,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:46:51,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2136371281, now seen corresponding path program 2 times [2021-08-21 11:46:51,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:46:51,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586561793] [2021-08-21 11:46:51,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:46:51,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:46:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:46:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:46:52,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:46:52,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586561793] [2021-08-21 11:46:52,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586561793] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:46:52,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:46:52,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-21 11:46:52,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003870376] [2021-08-21 11:46:52,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-21 11:46:52,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:46:52,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-21 11:46:52,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2021-08-21 11:46:52,355 INFO L87 Difference]: Start difference. First operand 2894 states and 5930 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:47:06,552 INFO L93 Difference]: Finished difference Result 4383 states and 8992 transitions. [2021-08-21 11:47:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-08-21 11:47:06,552 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:47:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:47:06,585 INFO L225 Difference]: With dead ends: 4383 [2021-08-21 11:47:06,585 INFO L226 Difference]: Without dead ends: 4383 [2021-08-21 11:47:06,587 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 12556.1ms TimeCoverageRelationStatistics Valid=3762, Invalid=9120, Unknown=0, NotChecked=0, Total=12882 [2021-08-21 11:47:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2021-08-21 11:47:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 3158. [2021-08-21 11:47:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3158 states, 3155 states have (on average 2.05229793977813) internal successors, (6475), 3157 states have internal predecessors, (6475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 3158 states and 6475 transitions. [2021-08-21 11:47:06,641 INFO L78 Accepts]: Start accepts. Automaton has 3158 states and 6475 transitions. Word has length 85 [2021-08-21 11:47:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:47:06,642 INFO L470 AbstractCegarLoop]: Abstraction has 3158 states and 6475 transitions. [2021-08-21 11:47:06,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3158 states and 6475 transitions. [2021-08-21 11:47:06,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:47:06,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:47:06,646 INFO L512 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] [2021-08-21 11:47:06,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 11:47:06,646 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)] === [2021-08-21 11:47:06,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:47:06,646 INFO L82 PathProgramCache]: Analyzing trace with hash 515892591, now seen corresponding path program 3 times [2021-08-21 11:47:06,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:47:06,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406947988] [2021-08-21 11:47:06,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:47:06,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:47:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:47:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:47:07,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:47:07,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406947988] [2021-08-21 11:47:07,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406947988] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:47:07,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:47:07,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-21 11:47:07,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583831347] [2021-08-21 11:47:07,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-21 11:47:07,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:47:07,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-21 11:47:07,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2021-08-21 11:47:07,289 INFO L87 Difference]: Start difference. First operand 3158 states and 6475 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:47:22,990 INFO L93 Difference]: Finished difference Result 4503 states and 9234 transitions. [2021-08-21 11:47:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2021-08-21 11:47:22,990 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:47:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:47:23,003 INFO L225 Difference]: With dead ends: 4503 [2021-08-21 11:47:23,003 INFO L226 Difference]: Without dead ends: 4503 [2021-08-21 11:47:23,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2612 ImplicationChecksByTransitivity, 14371.5ms TimeCoverageRelationStatistics Valid=4383, Invalid=10869, Unknown=0, NotChecked=0, Total=15252 [2021-08-21 11:47:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4503 states. [2021-08-21 11:47:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4503 to 3167. [2021-08-21 11:47:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 3164 states have (on average 2.052465233881163) internal successors, (6494), 3166 states have internal predecessors, (6494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 6494 transitions. [2021-08-21 11:47:23,062 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 6494 transitions. Word has length 85 [2021-08-21 11:47:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:47:23,062 INFO L470 AbstractCegarLoop]: Abstraction has 3167 states and 6494 transitions. [2021-08-21 11:47:23,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 6494 transitions. [2021-08-21 11:47:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:47:23,066 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:47:23,066 INFO L512 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] [2021-08-21 11:47:23,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 11:47:23,066 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)] === [2021-08-21 11:47:23,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:47:23,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1257140399, now seen corresponding path program 4 times [2021-08-21 11:47:23,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:47:23,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413914940] [2021-08-21 11:47:23,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:47:23,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:47:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:47:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:47:23,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:47:23,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413914940] [2021-08-21 11:47:23,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413914940] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:47:23,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:47:23,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-21 11:47:23,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080767633] [2021-08-21 11:47:23,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-21 11:47:23,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:47:23,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-21 11:47:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2021-08-21 11:47:23,688 INFO L87 Difference]: Start difference. First operand 3167 states and 6494 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:47:35,738 INFO L93 Difference]: Finished difference Result 4118 states and 8438 transitions. [2021-08-21 11:47:35,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-08-21 11:47:35,739 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:47:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:47:35,745 INFO L225 Difference]: With dead ends: 4118 [2021-08-21 11:47:35,746 INFO L226 Difference]: Without dead ends: 4118 [2021-08-21 11:47:35,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 10988.0ms TimeCoverageRelationStatistics Valid=3410, Invalid=8362, Unknown=0, NotChecked=0, Total=11772 [2021-08-21 11:47:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2021-08-21 11:47:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 2895. [2021-08-21 11:47:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2892 states have (on average 2.050829875518672) internal successors, (5931), 2894 states have internal predecessors, (5931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 5931 transitions. [2021-08-21 11:47:35,792 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 5931 transitions. Word has length 85 [2021-08-21 11:47:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:47:35,792 INFO L470 AbstractCegarLoop]: Abstraction has 2895 states and 5931 transitions. [2021-08-21 11:47:35,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 5931 transitions. [2021-08-21 11:47:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:47:35,795 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:47:35,795 INFO L512 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] [2021-08-21 11:47:35,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 11:47:35,795 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)] === [2021-08-21 11:47:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:47:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash -959742609, now seen corresponding path program 5 times [2021-08-21 11:47:35,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:47:35,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404310599] [2021-08-21 11:47:35,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:47:35,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:47:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:47:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:47:36,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:47:36,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404310599] [2021-08-21 11:47:36,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404310599] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:47:36,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:47:36,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-21 11:47:36,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86901485] [2021-08-21 11:47:36,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-21 11:47:36,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:47:36,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-21 11:47:36,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2021-08-21 11:47:36,399 INFO L87 Difference]: Start difference. First operand 2895 states and 5931 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:47:43,948 INFO L93 Difference]: Finished difference Result 3811 states and 7820 transitions. [2021-08-21 11:47:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:47:43,948 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:47:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:47:43,954 INFO L225 Difference]: With dead ends: 3811 [2021-08-21 11:47:43,954 INFO L226 Difference]: Without dead ends: 3811 [2021-08-21 11:47:43,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 6786.6ms TimeCoverageRelationStatistics Valid=1611, Invalid=3791, Unknown=0, NotChecked=0, Total=5402 [2021-08-21 11:47:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2021-08-21 11:47:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 2897. [2021-08-21 11:47:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2894 states have (on average 2.0507947477539736) internal successors, (5935), 2896 states have internal predecessors, (5935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 5935 transitions. [2021-08-21 11:47:43,997 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 5935 transitions. Word has length 85 [2021-08-21 11:47:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:47:43,997 INFO L470 AbstractCegarLoop]: Abstraction has 2897 states and 5935 transitions. [2021-08-21 11:47:43,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 5935 transitions. [2021-08-21 11:47:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:47:44,000 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:47:44,001 INFO L512 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] [2021-08-21 11:47:44,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 11:47:44,001 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)] === [2021-08-21 11:47:44,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:47:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1692521263, now seen corresponding path program 6 times [2021-08-21 11:47:44,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:47:44,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199327343] [2021-08-21 11:47:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:47:44,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:47:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:47:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:47:44,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:47:44,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199327343] [2021-08-21 11:47:44,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199327343] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:47:44,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:47:44,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-21 11:47:44,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671521349] [2021-08-21 11:47:44,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-21 11:47:44,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:47:44,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-21 11:47:44,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2021-08-21 11:47:44,616 INFO L87 Difference]: Start difference. First operand 2897 states and 5935 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:47:55,824 INFO L93 Difference]: Finished difference Result 4079 states and 8378 transitions. [2021-08-21 11:47:55,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-08-21 11:47:55,825 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:47:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:47:55,831 INFO L225 Difference]: With dead ends: 4079 [2021-08-21 11:47:55,831 INFO L226 Difference]: Without dead ends: 4079 [2021-08-21 11:47:55,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 10024.0ms TimeCoverageRelationStatistics Valid=2508, Invalid=5864, Unknown=0, NotChecked=0, Total=8372 [2021-08-21 11:47:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2021-08-21 11:47:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 2906. [2021-08-21 11:47:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2903 states have (on average 2.0509817430244572) internal successors, (5954), 2905 states have internal predecessors, (5954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:55,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 5954 transitions. [2021-08-21 11:47:55,881 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 5954 transitions. Word has length 85 [2021-08-21 11:47:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:47:55,881 INFO L470 AbstractCegarLoop]: Abstraction has 2906 states and 5954 transitions. [2021-08-21 11:47:55,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 5954 transitions. [2021-08-21 11:47:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:47:55,884 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:47:55,884 INFO L512 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] [2021-08-21 11:47:55,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 11:47:55,885 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)] === [2021-08-21 11:47:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:47:55,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1861198225, now seen corresponding path program 7 times [2021-08-21 11:47:55,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:47:55,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476859763] [2021-08-21 11:47:55,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:47:55,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:47:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:47:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:47:56,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:47:56,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476859763] [2021-08-21 11:47:56,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476859763] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:47:56,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:47:56,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-21 11:47:56,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827659980] [2021-08-21 11:47:56,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-21 11:47:56,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:47:56,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-21 11:47:56,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2021-08-21 11:47:56,481 INFO L87 Difference]: Start difference. First operand 2906 states and 5954 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:48:11,048 INFO L93 Difference]: Finished difference Result 4099 states and 8405 transitions. [2021-08-21 11:48:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2021-08-21 11:48:11,050 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:48:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:48:11,056 INFO L225 Difference]: With dead ends: 4099 [2021-08-21 11:48:11,056 INFO L226 Difference]: Without dead ends: 4099 [2021-08-21 11:48:11,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2435 ImplicationChecksByTransitivity, 12961.8ms TimeCoverageRelationStatistics Valid=4273, Invalid=10489, Unknown=0, NotChecked=0, Total=14762 [2021-08-21 11:48:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2021-08-21 11:48:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 2895. [2021-08-21 11:48:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2892 states have (on average 2.050829875518672) internal successors, (5931), 2894 states have internal predecessors, (5931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 5931 transitions. [2021-08-21 11:48:11,099 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 5931 transitions. Word has length 85 [2021-08-21 11:48:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:48:11,099 INFO L470 AbstractCegarLoop]: Abstraction has 2895 states and 5931 transitions. [2021-08-21 11:48:11,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 5931 transitions. [2021-08-21 11:48:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:48:11,102 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:48:11,102 INFO L512 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] [2021-08-21 11:48:11,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 11:48:11,102 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)] === [2021-08-21 11:48:11,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:48:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1684613763, now seen corresponding path program 8 times [2021-08-21 11:48:11,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:48:11,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007689634] [2021-08-21 11:48:11,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:48:11,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:48:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:48:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:48:11,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:48:11,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007689634] [2021-08-21 11:48:11,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007689634] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:48:11,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:48:11,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-08-21 11:48:11,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554752609] [2021-08-21 11:48:11,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-21 11:48:11,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:48:11,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-21 11:48:11,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2021-08-21 11:48:11,791 INFO L87 Difference]: Start difference. First operand 2895 states and 5931 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:48:18,896 INFO L93 Difference]: Finished difference Result 3618 states and 7415 transitions. [2021-08-21 11:48:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-08-21 11:48:18,896 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:48:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:48:18,902 INFO L225 Difference]: With dead ends: 3618 [2021-08-21 11:48:18,902 INFO L226 Difference]: Without dead ends: 3618 [2021-08-21 11:48:18,903 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 6414.3ms TimeCoverageRelationStatistics Valid=1391, Invalid=3439, Unknown=0, NotChecked=0, Total=4830 [2021-08-21 11:48:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3618 states. [2021-08-21 11:48:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3618 to 3146. [2021-08-21 11:48:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 3143 states have (on average 2.0531339484568885) internal successors, (6453), 3145 states have internal predecessors, (6453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 6453 transitions. [2021-08-21 11:48:18,953 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 6453 transitions. Word has length 85 [2021-08-21 11:48:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:48:18,954 INFO L470 AbstractCegarLoop]: Abstraction has 3146 states and 6453 transitions. [2021-08-21 11:48:18,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 6453 transitions. [2021-08-21 11:48:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:48:18,959 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:48:18,959 INFO L512 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] [2021-08-21 11:48:18,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 11:48:18,959 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)] === [2021-08-21 11:48:18,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:48:18,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1869105725, now seen corresponding path program 9 times [2021-08-21 11:48:18,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:48:18,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264374668] [2021-08-21 11:48:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:48:18,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:48:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:48:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:48:19,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:48:19,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264374668] [2021-08-21 11:48:19,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264374668] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:48:19,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:48:19,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-08-21 11:48:19,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067550182] [2021-08-21 11:48:19,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-21 11:48:19,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:48:19,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-21 11:48:19,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2021-08-21 11:48:19,653 INFO L87 Difference]: Start difference. First operand 3146 states and 6453 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:37,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:48:37,365 INFO L93 Difference]: Finished difference Result 3915 states and 8019 transitions. [2021-08-21 11:48:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-08-21 11:48:37,366 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:48:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:48:37,371 INFO L225 Difference]: With dead ends: 3915 [2021-08-21 11:48:37,371 INFO L226 Difference]: Without dead ends: 3915 [2021-08-21 11:48:37,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3078 ImplicationChecksByTransitivity, 16239.0ms TimeCoverageRelationStatistics Valid=5039, Invalid=12783, Unknown=0, NotChecked=0, Total=17822 [2021-08-21 11:48:37,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2021-08-21 11:48:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3150. [2021-08-21 11:48:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 3147 states have (on average 2.0530664124563076) internal successors, (6461), 3149 states have internal predecessors, (6461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 6461 transitions. [2021-08-21 11:48:37,416 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 6461 transitions. Word has length 85 [2021-08-21 11:48:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:48:37,416 INFO L470 AbstractCegarLoop]: Abstraction has 3150 states and 6461 transitions. [2021-08-21 11:48:37,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 6461 transitions. [2021-08-21 11:48:37,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:48:37,420 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:48:37,420 INFO L512 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] [2021-08-21 11:48:37,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 11:48:37,420 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)] === [2021-08-21 11:48:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:48:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash 582002913, now seen corresponding path program 10 times [2021-08-21 11:48:37,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:48:37,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325754586] [2021-08-21 11:48:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:48:37,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:48:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:48:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:48:38,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:48:38,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325754586] [2021-08-21 11:48:38,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325754586] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:48:38,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:48:38,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-08-21 11:48:38,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948616769] [2021-08-21 11:48:38,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-21 11:48:38,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:48:38,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-21 11:48:38,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2021-08-21 11:48:38,059 INFO L87 Difference]: Start difference. First operand 3150 states and 6461 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:48:51,407 INFO L93 Difference]: Finished difference Result 3696 states and 7574 transitions. [2021-08-21 11:48:51,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-08-21 11:48:51,407 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:48:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:48:51,412 INFO L225 Difference]: With dead ends: 3696 [2021-08-21 11:48:51,412 INFO L226 Difference]: Without dead ends: 3696 [2021-08-21 11:48:51,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 12313.6ms TimeCoverageRelationStatistics Valid=3861, Invalid=9711, Unknown=0, NotChecked=0, Total=13572 [2021-08-21 11:48:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2021-08-21 11:48:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 2556. [2021-08-21 11:48:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2553 states have (on average 2.0505287896592246) internal successors, (5235), 2555 states have internal predecessors, (5235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 5235 transitions. [2021-08-21 11:48:51,446 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 5235 transitions. Word has length 85 [2021-08-21 11:48:51,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:48:51,447 INFO L470 AbstractCegarLoop]: Abstraction has 2556 states and 5235 transitions. [2021-08-21 11:48:51,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 5235 transitions. [2021-08-21 11:48:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:48:51,449 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:48:51,449 INFO L512 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] [2021-08-21 11:48:51,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 11:48:51,449 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)] === [2021-08-21 11:48:51,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:48:51,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1277330547, now seen corresponding path program 1 times [2021-08-21 11:48:51,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:48:51,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325532480] [2021-08-21 11:48:51,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:48:51,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:48:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:48:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:48:52,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:48:52,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325532480] [2021-08-21 11:48:52,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325532480] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:48:52,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:48:52,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:48:52,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788302365] [2021-08-21 11:48:52,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:48:52,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:48:52,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:48:52,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:48:52,468 INFO L87 Difference]: Start difference. First operand 2556 states and 5235 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:48:58,409 INFO L93 Difference]: Finished difference Result 4831 states and 9927 transitions. [2021-08-21 11:48:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:48:58,410 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:48:58,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:48:58,415 INFO L225 Difference]: With dead ends: 4831 [2021-08-21 11:48:58,415 INFO L226 Difference]: Without dead ends: 4831 [2021-08-21 11:48:58,416 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 4696.7ms TimeCoverageRelationStatistics Valid=1185, Invalid=5457, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:48:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2021-08-21 11:48:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 3624. [2021-08-21 11:48:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3621 states have (on average 2.0538525269262635) internal successors, (7437), 3623 states have internal predecessors, (7437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 7437 transitions. [2021-08-21 11:48:58,464 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 7437 transitions. Word has length 88 [2021-08-21 11:48:58,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:48:58,464 INFO L470 AbstractCegarLoop]: Abstraction has 3624 states and 7437 transitions. [2021-08-21 11:48:58,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:58,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 7437 transitions. [2021-08-21 11:48:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:48:58,468 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:48:58,468 INFO L512 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] [2021-08-21 11:48:58,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 11:48:58,468 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)] === [2021-08-21 11:48:58,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:48:58,469 INFO L82 PathProgramCache]: Analyzing trace with hash 763817129, now seen corresponding path program 2 times [2021-08-21 11:48:58,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:48:58,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224657333] [2021-08-21 11:48:58,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:48:58,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:48:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:48:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:48:59,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:48:59,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224657333] [2021-08-21 11:48:59,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224657333] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:48:59,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:48:59,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:48:59,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605504295] [2021-08-21 11:48:59,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:48:59,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:48:59,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:48:59,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:48:59,415 INFO L87 Difference]: Start difference. First operand 3624 states and 7437 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:05,022 INFO L93 Difference]: Finished difference Result 5088 states and 10448 transitions. [2021-08-21 11:49:05,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:49:05,022 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:49:05,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:05,028 INFO L225 Difference]: With dead ends: 5088 [2021-08-21 11:49:05,028 INFO L226 Difference]: Without dead ends: 5088 [2021-08-21 11:49:05,028 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 4293.6ms TimeCoverageRelationStatistics Valid=1052, Invalid=4954, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:49:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5088 states. [2021-08-21 11:49:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5088 to 3639. [2021-08-21 11:49:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3636 states have (on average 2.0536303630363038) internal successors, (7467), 3638 states have internal predecessors, (7467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 7467 transitions. [2021-08-21 11:49:05,081 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 7467 transitions. Word has length 88 [2021-08-21 11:49:05,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:49:05,082 INFO L470 AbstractCegarLoop]: Abstraction has 3639 states and 7467 transitions. [2021-08-21 11:49:05,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 7467 transitions. [2021-08-21 11:49:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:49:05,086 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:49:05,086 INFO L512 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] [2021-08-21 11:49:05,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-21 11:49:05,086 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)] === [2021-08-21 11:49:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:49:05,086 INFO L82 PathProgramCache]: Analyzing trace with hash 125614841, now seen corresponding path program 3 times [2021-08-21 11:49:05,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:49:05,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566951636] [2021-08-21 11:49:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:49:05,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:49:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:49:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:49:06,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:49:06,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566951636] [2021-08-21 11:49:06,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566951636] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:49:06,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:49:06,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:49:06,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964297082] [2021-08-21 11:49:06,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:49:06,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:49:06,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:49:06,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:49:06,099 INFO L87 Difference]: Start difference. First operand 3639 states and 7467 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:11,882 INFO L93 Difference]: Finished difference Result 5178 states and 10643 transitions. [2021-08-21 11:49:11,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:49:11,882 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:49:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:11,888 INFO L225 Difference]: With dead ends: 5178 [2021-08-21 11:49:11,888 INFO L226 Difference]: Without dead ends: 5178 [2021-08-21 11:49:11,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 4520.5ms TimeCoverageRelationStatistics Valid=1095, Invalid=5067, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:49:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2021-08-21 11:49:11,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 3759. [2021-08-21 11:49:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3756 states have (on average 2.0559105431309903) internal successors, (7722), 3758 states have internal predecessors, (7722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 7722 transitions. [2021-08-21 11:49:11,937 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 7722 transitions. Word has length 88 [2021-08-21 11:49:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:49:11,937 INFO L470 AbstractCegarLoop]: Abstraction has 3759 states and 7722 transitions. [2021-08-21 11:49:11,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 7722 transitions. [2021-08-21 11:49:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:49:11,941 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:49:11,941 INFO L512 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] [2021-08-21 11:49:11,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-21 11:49:11,941 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)] === [2021-08-21 11:49:11,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:49:11,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1629753341, now seen corresponding path program 4 times [2021-08-21 11:49:11,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:49:11,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803903696] [2021-08-21 11:49:11,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:49:11,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:49:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:49:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:49:12,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:49:12,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803903696] [2021-08-21 11:49:12,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803903696] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:49:12,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:49:12,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:49:12,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119129849] [2021-08-21 11:49:12,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:49:12,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:49:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:49:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:49:12,971 INFO L87 Difference]: Start difference. First operand 3759 states and 7722 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:18,469 INFO L93 Difference]: Finished difference Result 5313 states and 10928 transitions. [2021-08-21 11:49:18,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:49:18,470 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:49:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:18,475 INFO L225 Difference]: With dead ends: 5313 [2021-08-21 11:49:18,475 INFO L226 Difference]: Without dead ends: 5313 [2021-08-21 11:49:18,475 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 4352.5ms TimeCoverageRelationStatistics Valid=1056, Invalid=4950, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:49:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2021-08-21 11:49:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 3774. [2021-08-21 11:49:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3774 states, 3771 states have (on average 2.0556881463802705) internal successors, (7752), 3773 states have internal predecessors, (7752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 7752 transitions. [2021-08-21 11:49:18,534 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 7752 transitions. Word has length 88 [2021-08-21 11:49:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:49:18,534 INFO L470 AbstractCegarLoop]: Abstraction has 3774 states and 7752 transitions. [2021-08-21 11:49:18,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 7752 transitions. [2021-08-21 11:49:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:49:18,538 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:49:18,538 INFO L512 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] [2021-08-21 11:49:18,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-21 11:49:18,538 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)] === [2021-08-21 11:49:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:49:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash 185759053, now seen corresponding path program 5 times [2021-08-21 11:49:18,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:49:18,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330705034] [2021-08-21 11:49:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:49:18,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:49:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:49:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:49:19,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:49:19,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330705034] [2021-08-21 11:49:19,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330705034] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:49:19,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:49:19,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:49:19,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222028736] [2021-08-21 11:49:19,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:49:19,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:49:19,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:49:19,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:49:19,562 INFO L87 Difference]: Start difference. First operand 3774 states and 7752 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:25,190 INFO L93 Difference]: Finished difference Result 5358 states and 11018 transitions. [2021-08-21 11:49:25,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:49:25,190 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:49:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:25,196 INFO L225 Difference]: With dead ends: 5358 [2021-08-21 11:49:25,196 INFO L226 Difference]: Without dead ends: 5358 [2021-08-21 11:49:25,196 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 4263.5ms TimeCoverageRelationStatistics Valid=1056, Invalid=4950, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:49:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5358 states. [2021-08-21 11:49:25,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5358 to 3804. [2021-08-21 11:49:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3804 states, 3801 states have (on average 2.0552486187845305) internal successors, (7812), 3803 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 7812 transitions. [2021-08-21 11:49:25,245 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 7812 transitions. Word has length 88 [2021-08-21 11:49:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:49:25,245 INFO L470 AbstractCegarLoop]: Abstraction has 3804 states and 7812 transitions. [2021-08-21 11:49:25,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 7812 transitions. [2021-08-21 11:49:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:49:25,249 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:49:25,249 INFO L512 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] [2021-08-21 11:49:25,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-21 11:49:25,249 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)] === [2021-08-21 11:49:25,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:49:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1219852225, now seen corresponding path program 6 times [2021-08-21 11:49:25,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:49:25,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257830388] [2021-08-21 11:49:25,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:49:25,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:49:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:49:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:49:26,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:49:26,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257830388] [2021-08-21 11:49:26,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257830388] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:49:26,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:49:26,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:49:26,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258337676] [2021-08-21 11:49:26,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:49:26,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:49:26,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:49:26,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:49:26,221 INFO L87 Difference]: Start difference. First operand 3804 states and 7812 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:31,912 INFO L93 Difference]: Finished difference Result 5418 states and 11138 transitions. [2021-08-21 11:49:31,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:49:31,913 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:49:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:31,920 INFO L225 Difference]: With dead ends: 5418 [2021-08-21 11:49:31,920 INFO L226 Difference]: Without dead ends: 5418 [2021-08-21 11:49:31,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 4306.3ms TimeCoverageRelationStatistics Valid=1057, Invalid=4949, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:49:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5418 states. [2021-08-21 11:49:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5418 to 3834. [2021-08-21 11:49:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3834 states, 3831 states have (on average 2.0548159749412687) internal successors, (7872), 3833 states have internal predecessors, (7872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 3834 states and 7872 transitions. [2021-08-21 11:49:31,974 INFO L78 Accepts]: Start accepts. Automaton has 3834 states and 7872 transitions. Word has length 88 [2021-08-21 11:49:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:49:31,975 INFO L470 AbstractCegarLoop]: Abstraction has 3834 states and 7872 transitions. [2021-08-21 11:49:31,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 7872 transitions. [2021-08-21 11:49:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:49:31,978 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:49:31,979 INFO L512 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] [2021-08-21 11:49:31,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-21 11:49:31,979 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)] === [2021-08-21 11:49:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:49:31,979 INFO L82 PathProgramCache]: Analyzing trace with hash -367208527, now seen corresponding path program 7 times [2021-08-21 11:49:31,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:49:31,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586754769] [2021-08-21 11:49:31,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:49:31,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:49:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:49:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:49:32,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:49:32,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586754769] [2021-08-21 11:49:32,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586754769] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:49:32,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:49:32,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:49:32,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925982657] [2021-08-21 11:49:32,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:49:32,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:49:32,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:49:32,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:49:32,997 INFO L87 Difference]: Start difference. First operand 3834 states and 7872 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:38,574 INFO L93 Difference]: Finished difference Result 5463 states and 11228 transitions. [2021-08-21 11:49:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:49:38,575 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:49:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:38,582 INFO L225 Difference]: With dead ends: 5463 [2021-08-21 11:49:38,583 INFO L226 Difference]: Without dead ends: 5463 [2021-08-21 11:49:38,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 4265.0ms TimeCoverageRelationStatistics Valid=1057, Invalid=4949, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:49:38,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2021-08-21 11:49:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 3849. [2021-08-21 11:49:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3846 states have (on average 2.0546021840873636) internal successors, (7902), 3848 states have internal predecessors, (7902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 7902 transitions. [2021-08-21 11:49:38,629 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 7902 transitions. Word has length 88 [2021-08-21 11:49:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:49:38,629 INFO L470 AbstractCegarLoop]: Abstraction has 3849 states and 7902 transitions. [2021-08-21 11:49:38,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 7902 transitions. [2021-08-21 11:49:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:49:38,633 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:49:38,633 INFO L512 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] [2021-08-21 11:49:38,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-21 11:49:38,633 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)] === [2021-08-21 11:49:38,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:49:38,633 INFO L82 PathProgramCache]: Analyzing trace with hash 502636665, now seen corresponding path program 8 times [2021-08-21 11:49:38,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:49:38,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071490936] [2021-08-21 11:49:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:49:38,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:49:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:49:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:49:39,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:49:39,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071490936] [2021-08-21 11:49:39,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071490936] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:49:39,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:49:39,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:49:39,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617831875] [2021-08-21 11:49:39,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:49:39,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:49:39,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:49:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:49:39,633 INFO L87 Difference]: Start difference. First operand 3849 states and 7902 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:45,288 INFO L93 Difference]: Finished difference Result 5493 states and 11288 transitions. [2021-08-21 11:49:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:49:45,288 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:49:45,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:45,294 INFO L225 Difference]: With dead ends: 5493 [2021-08-21 11:49:45,294 INFO L226 Difference]: Without dead ends: 5493 [2021-08-21 11:49:45,295 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 4247.9ms TimeCoverageRelationStatistics Valid=1056, Invalid=4950, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:49:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5493 states. [2021-08-21 11:49:45,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5493 to 3864. [2021-08-21 11:49:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3864 states, 3861 states have (on average 2.0543900543900544) internal successors, (7932), 3863 states have internal predecessors, (7932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 7932 transitions. [2021-08-21 11:49:45,358 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 7932 transitions. Word has length 88 [2021-08-21 11:49:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:49:45,358 INFO L470 AbstractCegarLoop]: Abstraction has 3864 states and 7932 transitions. [2021-08-21 11:49:45,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 7932 transitions. [2021-08-21 11:49:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:49:45,362 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:49:45,362 INFO L512 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] [2021-08-21 11:49:45,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-21 11:49:45,362 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)] === [2021-08-21 11:49:45,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:49:45,363 INFO L82 PathProgramCache]: Analyzing trace with hash 88686025, now seen corresponding path program 9 times [2021-08-21 11:49:45,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:49:45,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502170204] [2021-08-21 11:49:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:49:45,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:49:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:49:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:49:46,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:49:46,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502170204] [2021-08-21 11:49:46,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502170204] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:49:46,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:49:46,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:49:46,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117909071] [2021-08-21 11:49:46,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:49:46,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:49:46,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:49:46,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:49:46,391 INFO L87 Difference]: Start difference. First operand 3864 states and 7932 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:51,716 INFO L93 Difference]: Finished difference Result 5553 states and 11408 transitions. [2021-08-21 11:49:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:49:51,717 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:49:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:51,723 INFO L225 Difference]: With dead ends: 5553 [2021-08-21 11:49:51,723 INFO L226 Difference]: Without dead ends: 5553 [2021-08-21 11:49:51,723 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 4274.8ms TimeCoverageRelationStatistics Valid=1056, Invalid=4950, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:49:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5553 states. [2021-08-21 11:49:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5553 to 3909. [2021-08-21 11:49:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3909 states, 3906 states have (on average 2.053763440860215) internal successors, (8022), 3908 states have internal predecessors, (8022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 8022 transitions. [2021-08-21 11:49:51,775 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 8022 transitions. Word has length 88 [2021-08-21 11:49:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:49:51,775 INFO L470 AbstractCegarLoop]: Abstraction has 3909 states and 8022 transitions. [2021-08-21 11:49:51,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 8022 transitions. [2021-08-21 11:49:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:49:51,779 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:49:51,779 INFO L512 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] [2021-08-21 11:49:51,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-21 11:49:51,779 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)] === [2021-08-21 11:49:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:49:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash -554146413, now seen corresponding path program 10 times [2021-08-21 11:49:51,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:49:51,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141228041] [2021-08-21 11:49:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:49:51,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:49:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:49:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:49:52,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:49:52,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141228041] [2021-08-21 11:49:52,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141228041] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:49:52,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:49:52,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:49:52,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331469541] [2021-08-21 11:49:52,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:49:52,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:49:52,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:49:52,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:49:52,757 INFO L87 Difference]: Start difference. First operand 3909 states and 8022 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:58,476 INFO L93 Difference]: Finished difference Result 5313 states and 10913 transitions. [2021-08-21 11:49:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:49:58,477 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:49:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:58,482 INFO L225 Difference]: With dead ends: 5313 [2021-08-21 11:49:58,483 INFO L226 Difference]: Without dead ends: 5313 [2021-08-21 11:49:58,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 4356.9ms TimeCoverageRelationStatistics Valid=1057, Invalid=4949, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:49:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2021-08-21 11:49:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 3909. [2021-08-21 11:49:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3909 states, 3906 states have (on average 2.053763440860215) internal successors, (8022), 3908 states have internal predecessors, (8022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 8022 transitions. [2021-08-21 11:49:58,522 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 8022 transitions. Word has length 88 [2021-08-21 11:49:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:49:58,522 INFO L470 AbstractCegarLoop]: Abstraction has 3909 states and 8022 transitions. [2021-08-21 11:49:58,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 8022 transitions. [2021-08-21 11:49:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:49:58,526 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:49:58,526 INFO L512 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] [2021-08-21 11:49:58,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-21 11:49:58,526 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)] === [2021-08-21 11:49:58,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:49:58,526 INFO L82 PathProgramCache]: Analyzing trace with hash -708269163, now seen corresponding path program 11 times [2021-08-21 11:49:58,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:49:58,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326235033] [2021-08-21 11:49:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:49:58,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:49:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:49:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:49:59,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:49:59,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326235033] [2021-08-21 11:49:59,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326235033] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:49:59,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:49:59,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:49:59,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697638477] [2021-08-21 11:49:59,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:49:59,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:49:59,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:49:59,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:49:59,631 INFO L87 Difference]: Start difference. First operand 3909 states and 8022 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:50:06,095 INFO L93 Difference]: Finished difference Result 6577 states and 13535 transitions. [2021-08-21 11:50:06,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:50:06,095 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:50:06,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:50:06,102 INFO L225 Difference]: With dead ends: 6577 [2021-08-21 11:50:06,103 INFO L226 Difference]: Without dead ends: 6577 [2021-08-21 11:50:06,103 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4960.6ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:50:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2021-08-21 11:50:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 3942. [2021-08-21 11:50:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3939 states have (on average 2.053820766692054) internal successors, (8090), 3941 states have internal predecessors, (8090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 8090 transitions. [2021-08-21 11:50:06,148 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 8090 transitions. Word has length 88 [2021-08-21 11:50:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:50:06,149 INFO L470 AbstractCegarLoop]: Abstraction has 3942 states and 8090 transitions. [2021-08-21 11:50:06,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 8090 transitions. [2021-08-21 11:50:06,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:50:06,152 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:50:06,152 INFO L512 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] [2021-08-21 11:50:06,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-21 11:50:06,152 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)] === [2021-08-21 11:50:06,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:50:06,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1221782581, now seen corresponding path program 12 times [2021-08-21 11:50:06,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:50:06,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163382441] [2021-08-21 11:50:06,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:50:06,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:50:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:50:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:50:07,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:50:07,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163382441] [2021-08-21 11:50:07,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163382441] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:50:07,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:50:07,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:50:07,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153571143] [2021-08-21 11:50:07,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:50:07,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:50:07,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:50:07,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:50:07,197 INFO L87 Difference]: Start difference. First operand 3942 states and 8090 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:50:13,208 INFO L93 Difference]: Finished difference Result 5855 states and 12034 transitions. [2021-08-21 11:50:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:50:13,209 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:50:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:50:13,215 INFO L225 Difference]: With dead ends: 5855 [2021-08-21 11:50:13,215 INFO L226 Difference]: Without dead ends: 5855 [2021-08-21 11:50:13,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4711.2ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:50:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2021-08-21 11:50:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 3940. [2021-08-21 11:50:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3940 states, 3937 states have (on average 2.0538481076962154) internal successors, (8086), 3939 states have internal predecessors, (8086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 8086 transitions. [2021-08-21 11:50:13,258 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 8086 transitions. Word has length 88 [2021-08-21 11:50:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:50:13,258 INFO L470 AbstractCegarLoop]: Abstraction has 3940 states and 8086 transitions. [2021-08-21 11:50:13,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 8086 transitions. [2021-08-21 11:50:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:50:13,261 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:50:13,262 INFO L512 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] [2021-08-21 11:50:13,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-21 11:50:13,262 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)] === [2021-08-21 11:50:13,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:50:13,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1859984869, now seen corresponding path program 13 times [2021-08-21 11:50:13,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:50:13,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872020140] [2021-08-21 11:50:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:50:13,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:50:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:50:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:50:14,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:50:14,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872020140] [2021-08-21 11:50:14,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872020140] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:50:14,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:50:14,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:50:14,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692987333] [2021-08-21 11:50:14,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:50:14,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:50:14,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:50:14,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:50:14,274 INFO L87 Difference]: Start difference. First operand 3940 states and 8086 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:50:20,705 INFO L93 Difference]: Finished difference Result 5894 states and 12127 transitions. [2021-08-21 11:50:20,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:50:20,705 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:50:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:50:20,711 INFO L225 Difference]: With dead ends: 5894 [2021-08-21 11:50:20,711 INFO L226 Difference]: Without dead ends: 5894 [2021-08-21 11:50:20,712 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 4928.6ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:50:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5894 states. [2021-08-21 11:50:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5894 to 3924. [2021-08-21 11:50:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3921 states have (on average 2.053557765876052) internal successors, (8052), 3923 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) [2021-08-21 11:50:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 8052 transitions. [2021-08-21 11:50:20,753 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 8052 transitions. Word has length 88 [2021-08-21 11:50:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:50:20,753 INFO L470 AbstractCegarLoop]: Abstraction has 3924 states and 8052 transitions. [2021-08-21 11:50:20,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 8052 transitions. [2021-08-21 11:50:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:50:20,756 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:50:20,756 INFO L512 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] [2021-08-21 11:50:20,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-21 11:50:20,757 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)] === [2021-08-21 11:50:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:50:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash 679614245, now seen corresponding path program 14 times [2021-08-21 11:50:20,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:50:20,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974700440] [2021-08-21 11:50:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:50:20,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:50:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:50:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:50:21,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:50:21,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974700440] [2021-08-21 11:50:21,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974700440] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:50:21,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:50:21,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:50:21,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056847792] [2021-08-21 11:50:21,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:50:21,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:50:21,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:50:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:50:21,899 INFO L87 Difference]: Start difference. First operand 3924 states and 8052 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:50:27,672 INFO L93 Difference]: Finished difference Result 6029 states and 12412 transitions. [2021-08-21 11:50:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:50:27,672 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:50:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:50:27,678 INFO L225 Difference]: With dead ends: 6029 [2021-08-21 11:50:27,678 INFO L226 Difference]: Without dead ends: 6029 [2021-08-21 11:50:27,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4529.9ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:50:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2021-08-21 11:50:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3922. [2021-08-21 11:50:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3922 states, 3919 states have (on average 2.053585098239347) internal successors, (8048), 3921 states have internal predecessors, (8048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 8048 transitions. [2021-08-21 11:50:27,722 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 8048 transitions. Word has length 88 [2021-08-21 11:50:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:50:27,723 INFO L470 AbstractCegarLoop]: Abstraction has 3922 states and 8048 transitions. [2021-08-21 11:50:27,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 8048 transitions. [2021-08-21 11:50:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:50:27,726 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:50:27,726 INFO L512 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] [2021-08-21 11:50:27,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-21 11:50:27,727 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)] === [2021-08-21 11:50:27,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:50:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1799840657, now seen corresponding path program 15 times [2021-08-21 11:50:27,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:50:27,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388802352] [2021-08-21 11:50:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:50:27,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:50:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:50:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:50:28,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:50:28,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388802352] [2021-08-21 11:50:28,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388802352] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:50:28,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:50:28,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:50:28,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84782447] [2021-08-21 11:50:28,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:50:28,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:50:28,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:50:28,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:50:28,800 INFO L87 Difference]: Start difference. First operand 3922 states and 8048 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:50:34,815 INFO L93 Difference]: Finished difference Result 5894 states and 12127 transitions. [2021-08-21 11:50:34,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:50:34,816 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:50:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:50:34,822 INFO L225 Difference]: With dead ends: 5894 [2021-08-21 11:50:34,822 INFO L226 Difference]: Without dead ends: 5894 [2021-08-21 11:50:34,822 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4519.8ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:50:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5894 states. [2021-08-21 11:50:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5894 to 3918. [2021-08-21 11:50:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3915 states have (on average 2.053639846743295) internal successors, (8040), 3917 states have internal predecessors, (8040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 8040 transitions. [2021-08-21 11:50:34,892 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 8040 transitions. Word has length 88 [2021-08-21 11:50:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:50:34,893 INFO L470 AbstractCegarLoop]: Abstraction has 3918 states and 8040 transitions. [2021-08-21 11:50:34,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 8040 transitions. [2021-08-21 11:50:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:50:34,896 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:50:34,896 INFO L512 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] [2021-08-21 11:50:34,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-21 11:50:34,896 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)] === [2021-08-21 11:50:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:50:34,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1628602923, now seen corresponding path program 16 times [2021-08-21 11:50:34,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:50:34,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583263112] [2021-08-21 11:50:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:50:34,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:50:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:50:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:50:35,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:50:35,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583263112] [2021-08-21 11:50:35,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583263112] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:50:35,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:50:35,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:50:35,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899295031] [2021-08-21 11:50:35,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:50:35,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:50:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:50:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:50:35,889 INFO L87 Difference]: Start difference. First operand 3918 states and 8040 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:50:42,081 INFO L93 Difference]: Finished difference Result 6373 states and 13110 transitions. [2021-08-21 11:50:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-21 11:50:42,082 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:50:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:50:42,088 INFO L225 Difference]: With dead ends: 6373 [2021-08-21 11:50:42,089 INFO L226 Difference]: Without dead ends: 6373 [2021-08-21 11:50:42,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 4913.9ms TimeCoverageRelationStatistics Valid=1221, Invalid=5585, Unknown=0, NotChecked=0, Total=6806 [2021-08-21 11:50:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2021-08-21 11:50:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 3945. [2021-08-21 11:50:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3945 states, 3942 states have (on average 2.054033485540335) internal successors, (8097), 3944 states have internal predecessors, (8097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3945 states to 3945 states and 8097 transitions. [2021-08-21 11:50:42,135 INFO L78 Accepts]: Start accepts. Automaton has 3945 states and 8097 transitions. Word has length 88 [2021-08-21 11:50:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:50:42,135 INFO L470 AbstractCegarLoop]: Abstraction has 3945 states and 8097 transitions. [2021-08-21 11:50:42,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3945 states and 8097 transitions. [2021-08-21 11:50:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:50:42,138 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:50:42,138 INFO L512 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] [2021-08-21 11:50:42,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-21 11:50:42,138 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)] === [2021-08-21 11:50:42,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:50:42,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2142116341, now seen corresponding path program 17 times [2021-08-21 11:50:42,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:50:42,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053855180] [2021-08-21 11:50:42,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:50:42,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:50:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:50:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:50:43,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:50:43,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053855180] [2021-08-21 11:50:43,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053855180] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:50:43,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:50:43,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:50:43,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631127353] [2021-08-21 11:50:43,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:50:43,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:50:43,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:50:43,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:50:43,161 INFO L87 Difference]: Start difference. First operand 3945 states and 8097 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:50:48,996 INFO L93 Difference]: Finished difference Result 5651 states and 11609 transitions. [2021-08-21 11:50:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:50:48,996 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:50:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:50:49,002 INFO L225 Difference]: With dead ends: 5651 [2021-08-21 11:50:49,002 INFO L226 Difference]: Without dead ends: 5651 [2021-08-21 11:50:49,003 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 4550.5ms TimeCoverageRelationStatistics Valid=1088, Invalid=5074, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:50:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2021-08-21 11:50:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 3943. [2021-08-21 11:50:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3940 states have (on average 2.054060913705584) internal successors, (8093), 3942 states have internal predecessors, (8093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 8093 transitions. [2021-08-21 11:50:49,042 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 8093 transitions. Word has length 88 [2021-08-21 11:50:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:50:49,042 INFO L470 AbstractCegarLoop]: Abstraction has 3943 states and 8093 transitions. [2021-08-21 11:50:49,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 8093 transitions. [2021-08-21 11:50:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:50:49,046 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:50:49,046 INFO L512 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] [2021-08-21 11:50:49,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-21 11:50:49,046 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)] === [2021-08-21 11:50:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:50:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1514648667, now seen corresponding path program 18 times [2021-08-21 11:50:49,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:50:49,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249824397] [2021-08-21 11:50:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:50:49,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:50:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:50:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:50:50,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:50:50,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249824397] [2021-08-21 11:50:50,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249824397] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:50:50,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:50:50,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:50:50,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208444925] [2021-08-21 11:50:50,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:50:50,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:50:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:50:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:50:50,043 INFO L87 Difference]: Start difference. First operand 3943 states and 8093 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:50:56,276 INFO L93 Difference]: Finished difference Result 5555 states and 11417 transitions. [2021-08-21 11:50:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:50:56,276 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:50:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:50:56,294 INFO L225 Difference]: With dead ends: 5555 [2021-08-21 11:50:56,295 INFO L226 Difference]: Without dead ends: 5555 [2021-08-21 11:50:56,295 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 4776.3ms TimeCoverageRelationStatistics Valid=1132, Invalid=5188, Unknown=0, NotChecked=0, Total=6320 [2021-08-21 11:50:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5555 states. [2021-08-21 11:50:56,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5555 to 3927. [2021-08-21 11:50:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3927 states, 3924 states have (on average 2.0537716615698267) internal successors, (8059), 3926 states have internal predecessors, (8059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 8059 transitions. [2021-08-21 11:50:56,333 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 8059 transitions. Word has length 88 [2021-08-21 11:50:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:50:56,333 INFO L470 AbstractCegarLoop]: Abstraction has 3927 states and 8059 transitions. [2021-08-21 11:50:56,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 8059 transitions. [2021-08-21 11:50:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:50:56,336 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:50:56,336 INFO L512 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] [2021-08-21 11:50:56,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-21 11:50:56,336 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)] === [2021-08-21 11:50:56,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:50:56,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1271874995, now seen corresponding path program 19 times [2021-08-21 11:50:56,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:50:56,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667931976] [2021-08-21 11:50:56,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:50:56,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:50:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:50:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:50:57,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:50:57,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667931976] [2021-08-21 11:50:57,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667931976] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:50:57,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:50:57,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:50:57,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935898215] [2021-08-21 11:50:57,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:50:57,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:50:57,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:50:57,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:50:57,346 INFO L87 Difference]: Start difference. First operand 3927 states and 8059 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:51:04,006 INFO L93 Difference]: Finished difference Result 6396 states and 13147 transitions. [2021-08-21 11:51:04,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-21 11:51:04,006 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:51:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:51:04,012 INFO L225 Difference]: With dead ends: 6396 [2021-08-21 11:51:04,012 INFO L226 Difference]: Without dead ends: 6396 [2021-08-21 11:51:04,013 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 5314.5ms TimeCoverageRelationStatistics Valid=1306, Invalid=5834, Unknown=0, NotChecked=0, Total=7140 [2021-08-21 11:51:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6396 states. [2021-08-21 11:51:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6396 to 3954. [2021-08-21 11:51:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-21 11:51:04,057 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-21 11:51:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:51:04,057 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-21 11:51:04,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-21 11:51:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:51:04,060 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:51:04,060 INFO L512 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] [2021-08-21 11:51:04,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-21 11:51:04,060 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)] === [2021-08-21 11:51:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:51:04,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1942604137, now seen corresponding path program 20 times [2021-08-21 11:51:04,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:51:04,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620521825] [2021-08-21 11:51:04,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:51:04,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:51:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:51:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:51:05,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:51:05,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620521825] [2021-08-21 11:51:05,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620521825] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:51:05,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:51:05,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:51:05,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468834748] [2021-08-21 11:51:05,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:51:05,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:51:05,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:51:05,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:51:05,091 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:51:11,078 INFO L93 Difference]: Finished difference Result 6314 states and 12976 transitions. [2021-08-21 11:51:11,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:51:11,078 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:51:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:51:11,084 INFO L225 Difference]: With dead ends: 6314 [2021-08-21 11:51:11,084 INFO L226 Difference]: Without dead ends: 6314 [2021-08-21 11:51:11,084 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 4781.1ms TimeCoverageRelationStatistics Valid=1178, Invalid=5464, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:51:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2021-08-21 11:51:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 3956. [2021-08-21 11:51:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3953 states have (on average 2.05363015431318) internal successors, (8118), 3955 states have internal predecessors, (8118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 8118 transitions. [2021-08-21 11:51:11,128 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 8118 transitions. Word has length 88 [2021-08-21 11:51:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:51:11,128 INFO L470 AbstractCegarLoop]: Abstraction has 3956 states and 8118 transitions. [2021-08-21 11:51:11,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 8118 transitions. [2021-08-21 11:51:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:51:11,131 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:51:11,131 INFO L512 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] [2021-08-21 11:51:11,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-21 11:51:11,131 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)] === [2021-08-21 11:51:11,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:51:11,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1116203095, now seen corresponding path program 21 times [2021-08-21 11:51:11,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:51:11,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907048597] [2021-08-21 11:51:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:51:11,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:51:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:51:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:51:12,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:51:12,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907048597] [2021-08-21 11:51:12,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907048597] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:51:12,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:51:12,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:51:12,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775297068] [2021-08-21 11:51:12,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:51:12,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:51:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:51:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:51:12,084 INFO L87 Difference]: Start difference. First operand 3956 states and 8118 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:51:17,648 INFO L93 Difference]: Finished difference Result 5481 states and 11253 transitions. [2021-08-21 11:51:17,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:51:17,649 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:51:17,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:51:17,655 INFO L225 Difference]: With dead ends: 5481 [2021-08-21 11:51:17,655 INFO L226 Difference]: Without dead ends: 5481 [2021-08-21 11:51:17,655 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 4286.0ms TimeCoverageRelationStatistics Valid=1047, Invalid=4959, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:51:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2021-08-21 11:51:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 3954. [2021-08-21 11:51:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-21 11:51:17,693 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-21 11:51:17,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:51:17,693 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-21 11:51:17,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-21 11:51:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:51:17,696 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:51:17,697 INFO L512 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] [2021-08-21 11:51:17,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-21 11:51:17,697 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)] === [2021-08-21 11:51:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:51:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1180072201, now seen corresponding path program 22 times [2021-08-21 11:51:17,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:51:17,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912470908] [2021-08-21 11:51:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:51:17,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:51:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:51:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:51:18,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:51:18,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912470908] [2021-08-21 11:51:18,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912470908] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:51:18,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:51:18,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:51:18,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580276405] [2021-08-21 11:51:18,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:51:18,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:51:18,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:51:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:51:18,708 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:51:24,983 INFO L93 Difference]: Finished difference Result 6552 states and 13486 transitions. [2021-08-21 11:51:24,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:51:24,983 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:51:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:51:24,990 INFO L225 Difference]: With dead ends: 6552 [2021-08-21 11:51:24,991 INFO L226 Difference]: Without dead ends: 6552 [2021-08-21 11:51:24,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4804.2ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:51:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2021-08-21 11:51:25,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 3974. [2021-08-21 11:51:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3974 states, 3971 states have (on average 2.0538907076303197) internal successors, (8156), 3973 states have internal predecessors, (8156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 8156 transitions. [2021-08-21 11:51:25,040 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 8156 transitions. Word has length 88 [2021-08-21 11:51:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:51:25,040 INFO L470 AbstractCegarLoop]: Abstraction has 3974 states and 8156 transitions. [2021-08-21 11:51:25,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 8156 transitions. [2021-08-21 11:51:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:51:25,043 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:51:25,043 INFO L512 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] [2021-08-21 11:51:25,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-21 11:51:25,043 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)] === [2021-08-21 11:51:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:51:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1693585619, now seen corresponding path program 23 times [2021-08-21 11:51:25,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:51:25,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334483493] [2021-08-21 11:51:25,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:51:25,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:51:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:51:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:51:26,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:51:26,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334483493] [2021-08-21 11:51:26,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334483493] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:51:26,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:51:26,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:51:26,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723190383] [2021-08-21 11:51:26,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:51:26,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:51:26,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:51:26,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:51:26,031 INFO L87 Difference]: Start difference. First operand 3974 states and 8156 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:51:31,671 INFO L93 Difference]: Finished difference Result 5830 states and 11985 transitions. [2021-08-21 11:51:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:51:31,671 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:51:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:51:31,679 INFO L225 Difference]: With dead ends: 5830 [2021-08-21 11:51:31,679 INFO L226 Difference]: Without dead ends: 5830 [2021-08-21 11:51:31,680 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 4420.7ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:51:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5830 states. [2021-08-21 11:51:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5830 to 3972. [2021-08-21 11:51:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3972 states, 3969 states have (on average 2.053917863441673) internal successors, (8152), 3971 states have internal predecessors, (8152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 8152 transitions. [2021-08-21 11:51:31,734 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 8152 transitions. Word has length 88 [2021-08-21 11:51:31,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:51:31,734 INFO L470 AbstractCegarLoop]: Abstraction has 3972 states and 8152 transitions. [2021-08-21 11:51:31,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 8152 transitions. [2021-08-21 11:51:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:51:31,738 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:51:31,738 INFO L512 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] [2021-08-21 11:51:31,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-21 11:51:31,738 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)] === [2021-08-21 11:51:31,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:51:31,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1963179389, now seen corresponding path program 24 times [2021-08-21 11:51:31,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:51:31,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841045329] [2021-08-21 11:51:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:51:31,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:51:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:51:32,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:51:32,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:51:32,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841045329] [2021-08-21 11:51:32,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841045329] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:51:32,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:51:32,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:51:32,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254267321] [2021-08-21 11:51:32,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:51:32,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:51:32,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:51:32,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:51:32,724 INFO L87 Difference]: Start difference. First operand 3972 states and 8152 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:51:38,924 INFO L93 Difference]: Finished difference Result 5869 states and 12078 transitions. [2021-08-21 11:51:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:51:38,925 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:51:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:51:38,931 INFO L225 Difference]: With dead ends: 5869 [2021-08-21 11:51:38,931 INFO L226 Difference]: Without dead ends: 5869 [2021-08-21 11:51:38,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4621.2ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:51:38,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5869 states. [2021-08-21 11:51:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5869 to 3956. [2021-08-21 11:51:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3953 states have (on average 2.05363015431318) internal successors, (8118), 3955 states have internal predecessors, (8118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 8118 transitions. [2021-08-21 11:51:38,976 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 8118 transitions. Word has length 88 [2021-08-21 11:51:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:51:38,976 INFO L470 AbstractCegarLoop]: Abstraction has 3956 states and 8118 transitions. [2021-08-21 11:51:38,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 8118 transitions. [2021-08-21 11:51:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:51:38,979 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:51:38,979 INFO L512 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] [2021-08-21 11:51:38,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-21 11:51:38,979 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)] === [2021-08-21 11:51:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:51:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash -544672603, now seen corresponding path program 25 times [2021-08-21 11:51:38,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:51:38,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577902207] [2021-08-21 11:51:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:51:38,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:51:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:51:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:51:40,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:51:40,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577902207] [2021-08-21 11:51:40,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577902207] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:51:40,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:51:40,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:51:40,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568583131] [2021-08-21 11:51:40,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:51:40,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:51:40,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:51:40,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:51:40,060 INFO L87 Difference]: Start difference. First operand 3956 states and 8118 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:51:45,772 INFO L93 Difference]: Finished difference Result 5701 states and 11725 transitions. [2021-08-21 11:51:45,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:51:45,772 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:51:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:51:45,778 INFO L225 Difference]: With dead ends: 5701 [2021-08-21 11:51:45,778 INFO L226 Difference]: Without dead ends: 5701 [2021-08-21 11:51:45,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4515.2ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:51:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2021-08-21 11:51:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 3954. [2021-08-21 11:51:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-21 11:51:45,818 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-21 11:51:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:51:45,818 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-21 11:51:45,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-21 11:51:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:51:45,820 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:51:45,820 INFO L512 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] [2021-08-21 11:51:45,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-21 11:51:45,821 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)] === [2021-08-21 11:51:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:51:45,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2098470203, now seen corresponding path program 26 times [2021-08-21 11:51:45,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:51:45,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517360699] [2021-08-21 11:51:45,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:51:45,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:51:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:51:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:51:46,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:51:46,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517360699] [2021-08-21 11:51:46,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517360699] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:51:46,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:51:46,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:51:46,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722917974] [2021-08-21 11:51:46,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:51:46,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:51:46,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:51:46,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:51:46,853 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:51:53,084 INFO L93 Difference]: Finished difference Result 6671 states and 13724 transitions. [2021-08-21 11:51:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:51:53,084 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:51:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:51:53,092 INFO L225 Difference]: With dead ends: 6671 [2021-08-21 11:51:53,092 INFO L226 Difference]: Without dead ends: 6671 [2021-08-21 11:51:53,092 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4735.4ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:51:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2021-08-21 11:51:53,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 3982. [2021-08-21 11:51:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3982 states, 3979 states have (on average 2.053782357376225) internal successors, (8172), 3981 states have internal predecessors, (8172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 8172 transitions. [2021-08-21 11:51:53,139 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 8172 transitions. Word has length 88 [2021-08-21 11:51:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:51:53,139 INFO L470 AbstractCegarLoop]: Abstraction has 3982 states and 8172 transitions. [2021-08-21 11:51:53,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 8172 transitions. [2021-08-21 11:51:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:51:53,142 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:51:53,142 INFO L512 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] [2021-08-21 11:51:53,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-21 11:51:53,143 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)] === [2021-08-21 11:51:53,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:51:53,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1682983675, now seen corresponding path program 27 times [2021-08-21 11:51:53,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:51:53,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348900027] [2021-08-21 11:51:53,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:51:53,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:51:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:51:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:51:54,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:51:54,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348900027] [2021-08-21 11:51:54,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348900027] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:51:54,144 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:51:54,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:51:54,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763296547] [2021-08-21 11:51:54,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:51:54,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:51:54,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:51:54,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:51:54,145 INFO L87 Difference]: Start difference. First operand 3982 states and 8172 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:00,011 INFO L93 Difference]: Finished difference Result 5949 states and 12223 transitions. [2021-08-21 11:52:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:52:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:52:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:00,018 INFO L225 Difference]: With dead ends: 5949 [2021-08-21 11:52:00,018 INFO L226 Difference]: Without dead ends: 5949 [2021-08-21 11:52:00,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4649.4ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:52:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2021-08-21 11:52:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3980. [2021-08-21 11:52:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3977 states have (on average 2.053809404073422) internal successors, (8168), 3979 states have internal predecessors, (8168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 8168 transitions. [2021-08-21 11:52:00,065 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 8168 transitions. Word has length 88 [2021-08-21 11:52:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:52:00,065 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 8168 transitions. [2021-08-21 11:52:00,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:00,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 8168 transitions. [2021-08-21 11:52:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:52:00,068 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:52:00,068 INFO L512 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] [2021-08-21 11:52:00,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-21 11:52:00,068 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)] === [2021-08-21 11:52:00,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:52:00,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1044781387, now seen corresponding path program 28 times [2021-08-21 11:52:00,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:52:00,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104716573] [2021-08-21 11:52:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:52:00,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:52:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:01,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:01,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104716573] [2021-08-21 11:52:01,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104716573] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:01,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:01,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:52:01,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717724700] [2021-08-21 11:52:01,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:52:01,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:01,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:52:01,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:52:01,088 INFO L87 Difference]: Start difference. First operand 3980 states and 8168 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:07,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:07,407 INFO L93 Difference]: Finished difference Result 5988 states and 12316 transitions. [2021-08-21 11:52:07,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:52:07,407 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:52:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:07,413 INFO L225 Difference]: With dead ends: 5988 [2021-08-21 11:52:07,413 INFO L226 Difference]: Without dead ends: 5988 [2021-08-21 11:52:07,414 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 4903.2ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:52:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2021-08-21 11:52:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3964. [2021-08-21 11:52:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3961 states have (on average 2.053521837919717) internal successors, (8134), 3963 states have internal predecessors, (8134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 8134 transitions. [2021-08-21 11:52:07,456 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 8134 transitions. Word has length 88 [2021-08-21 11:52:07,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:52:07,456 INFO L470 AbstractCegarLoop]: Abstraction has 3964 states and 8134 transitions. [2021-08-21 11:52:07,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 8134 transitions. [2021-08-21 11:52:07,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:52:07,459 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:52:07,459 INFO L512 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] [2021-08-21 11:52:07,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-21 11:52:07,460 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)] === [2021-08-21 11:52:07,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:52:07,460 INFO L82 PathProgramCache]: Analyzing trace with hash -710586795, now seen corresponding path program 29 times [2021-08-21 11:52:07,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:52:07,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033859850] [2021-08-21 11:52:07,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:52:07,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:52:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:08,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:08,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033859850] [2021-08-21 11:52:08,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033859850] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:08,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:08,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:52:08,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393736224] [2021-08-21 11:52:08,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:52:08,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:08,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:52:08,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:52:08,553 INFO L87 Difference]: Start difference. First operand 3964 states and 8134 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:14,435 INFO L93 Difference]: Finished difference Result 6123 states and 12601 transitions. [2021-08-21 11:52:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:52:14,435 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:52:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:14,442 INFO L225 Difference]: With dead ends: 6123 [2021-08-21 11:52:14,442 INFO L226 Difference]: Without dead ends: 6123 [2021-08-21 11:52:14,442 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4469.7ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:52:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2021-08-21 11:52:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 3962. [2021-08-21 11:52:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3959 states have (on average 2.0535488759787826) internal successors, (8130), 3961 states have internal predecessors, (8130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 8130 transitions. [2021-08-21 11:52:14,486 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 8130 transitions. Word has length 88 [2021-08-21 11:52:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:52:14,486 INFO L470 AbstractCegarLoop]: Abstraction has 3962 states and 8130 transitions. [2021-08-21 11:52:14,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:14,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 8130 transitions. [2021-08-21 11:52:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:52:14,489 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:52:14,489 INFO L512 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] [2021-08-21 11:52:14,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-21 11:52:14,489 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)] === [2021-08-21 11:52:14,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:52:14,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1104925599, now seen corresponding path program 30 times [2021-08-21 11:52:14,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:52:14,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129774419] [2021-08-21 11:52:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:52:14,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:52:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:15,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:15,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129774419] [2021-08-21 11:52:15,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129774419] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:15,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:15,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:52:15,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986666193] [2021-08-21 11:52:15,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:52:15,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:15,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:52:15,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:52:15,561 INFO L87 Difference]: Start difference. First operand 3962 states and 8130 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:21,348 INFO L93 Difference]: Finished difference Result 6168 states and 12691 transitions. [2021-08-21 11:52:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:52:21,348 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:52:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:21,354 INFO L225 Difference]: With dead ends: 6168 [2021-08-21 11:52:21,354 INFO L226 Difference]: Without dead ends: 6168 [2021-08-21 11:52:21,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4415.8ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:52:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6168 states. [2021-08-21 11:52:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6168 to 3958. [2021-08-21 11:52:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3955 states have (on average 2.0536030341340075) internal successors, (8122), 3957 states have internal predecessors, (8122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 8122 transitions. [2021-08-21 11:52:21,400 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 8122 transitions. Word has length 88 [2021-08-21 11:52:21,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:52:21,400 INFO L470 AbstractCegarLoop]: Abstraction has 3958 states and 8122 transitions. [2021-08-21 11:52:21,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 8122 transitions. [2021-08-21 11:52:21,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:52:21,403 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:52:21,403 INFO L512 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] [2021-08-21 11:52:21,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-21 11:52:21,403 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)] === [2021-08-21 11:52:21,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:52:21,403 INFO L82 PathProgramCache]: Analyzing trace with hash 614466817, now seen corresponding path program 31 times [2021-08-21 11:52:21,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:52:21,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704460123] [2021-08-21 11:52:21,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:52:21,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:52:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:22,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:22,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704460123] [2021-08-21 11:52:22,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704460123] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:22,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:22,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:52:22,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666850250] [2021-08-21 11:52:22,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:52:22,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:22,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:52:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:52:22,476 INFO L87 Difference]: Start difference. First operand 3958 states and 8122 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:28,131 INFO L93 Difference]: Finished difference Result 5814 states and 11951 transitions. [2021-08-21 11:52:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:52:28,131 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:52:28,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:28,137 INFO L225 Difference]: With dead ends: 5814 [2021-08-21 11:52:28,137 INFO L226 Difference]: Without dead ends: 5814 [2021-08-21 11:52:28,138 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4443.8ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:52:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5814 states. [2021-08-21 11:52:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5814 to 3954. [2021-08-21 11:52:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-21 11:52:28,179 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-21 11:52:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:52:28,179 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-21 11:52:28,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-21 11:52:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:52:28,182 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:52:28,182 INFO L512 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] [2021-08-21 11:52:28,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-21 11:52:28,182 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)] === [2021-08-21 11:52:28,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:52:28,182 INFO L82 PathProgramCache]: Analyzing trace with hash -727982283, now seen corresponding path program 32 times [2021-08-21 11:52:28,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:52:28,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616623610] [2021-08-21 11:52:28,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:52:28,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:52:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:29,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:29,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616623610] [2021-08-21 11:52:29,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616623610] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:29,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:29,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:52:29,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245079345] [2021-08-21 11:52:29,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:52:29,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:29,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:52:29,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:52:29,241 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:35,486 INFO L93 Difference]: Finished difference Result 6722 states and 13826 transitions. [2021-08-21 11:52:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:52:35,487 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:52:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:35,494 INFO L225 Difference]: With dead ends: 6722 [2021-08-21 11:52:35,494 INFO L226 Difference]: Without dead ends: 6722 [2021-08-21 11:52:35,494 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4823.6ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:52:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6722 states. [2021-08-21 11:52:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6722 to 3984. [2021-08-21 11:52:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3984 states, 3981 states have (on average 2.0537553378548106) internal successors, (8176), 3983 states have internal predecessors, (8176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 8176 transitions. [2021-08-21 11:52:35,541 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 8176 transitions. Word has length 88 [2021-08-21 11:52:35,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:52:35,541 INFO L470 AbstractCegarLoop]: Abstraction has 3984 states and 8176 transitions. [2021-08-21 11:52:35,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 8176 transitions. [2021-08-21 11:52:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:52:35,544 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:52:35,544 INFO L512 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] [2021-08-21 11:52:35,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-21 11:52:35,544 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)] === [2021-08-21 11:52:35,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:52:35,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1241495701, now seen corresponding path program 33 times [2021-08-21 11:52:35,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:52:35,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688453358] [2021-08-21 11:52:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:52:35,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:52:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:36,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:36,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688453358] [2021-08-21 11:52:36,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688453358] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:36,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:36,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:52:36,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128784388] [2021-08-21 11:52:36,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:52:36,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:36,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:52:36,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:52:36,577 INFO L87 Difference]: Start difference. First operand 3984 states and 8176 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:42,378 INFO L93 Difference]: Finished difference Result 6000 states and 12325 transitions. [2021-08-21 11:52:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:52:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:52:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:42,384 INFO L225 Difference]: With dead ends: 6000 [2021-08-21 11:52:42,384 INFO L226 Difference]: Without dead ends: 6000 [2021-08-21 11:52:42,385 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4668.5ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:52:42,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2021-08-21 11:52:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3982. [2021-08-21 11:52:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3982 states, 3979 states have (on average 2.053782357376225) internal successors, (8172), 3981 states have internal predecessors, (8172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 8172 transitions. [2021-08-21 11:52:42,428 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 8172 transitions. Word has length 88 [2021-08-21 11:52:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:52:42,428 INFO L470 AbstractCegarLoop]: Abstraction has 3982 states and 8172 transitions. [2021-08-21 11:52:42,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 8172 transitions. [2021-08-21 11:52:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:52:42,431 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:52:42,431 INFO L512 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] [2021-08-21 11:52:42,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-21 11:52:42,431 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)] === [2021-08-21 11:52:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:52:42,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1879697989, now seen corresponding path program 34 times [2021-08-21 11:52:42,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:52:42,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576933194] [2021-08-21 11:52:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:52:42,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:52:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:43,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:43,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576933194] [2021-08-21 11:52:43,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576933194] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:43,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:43,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:52:43,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006913898] [2021-08-21 11:52:43,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:52:43,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:43,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:52:43,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:52:43,457 INFO L87 Difference]: Start difference. First operand 3982 states and 8172 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:49,805 INFO L93 Difference]: Finished difference Result 6039 states and 12418 transitions. [2021-08-21 11:52:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:52:49,805 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:52:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:49,811 INFO L225 Difference]: With dead ends: 6039 [2021-08-21 11:52:49,811 INFO L226 Difference]: Without dead ends: 6039 [2021-08-21 11:52:49,811 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 4985.4ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:52:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2021-08-21 11:52:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 3966. [2021-08-21 11:52:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 2.053494827151148) internal successors, (8138), 3965 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 8138 transitions. [2021-08-21 11:52:49,852 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 8138 transitions. Word has length 88 [2021-08-21 11:52:49,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:52:49,852 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 8138 transitions. [2021-08-21 11:52:49,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:49,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 8138 transitions. [2021-08-21 11:52:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:52:49,855 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:52:49,855 INFO L512 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] [2021-08-21 11:52:49,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-21 11:52:49,855 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)] === [2021-08-21 11:52:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:52:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash 659901125, now seen corresponding path program 35 times [2021-08-21 11:52:49,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:52:49,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055651927] [2021-08-21 11:52:49,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:52:49,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:52:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:50,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:50,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055651927] [2021-08-21 11:52:50,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055651927] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:50,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:50,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:52:50,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195922150] [2021-08-21 11:52:50,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:52:50,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:50,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:52:50,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:52:50,921 INFO L87 Difference]: Start difference. First operand 3966 states and 8138 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:56,680 INFO L93 Difference]: Finished difference Result 6174 states and 12703 transitions. [2021-08-21 11:52:56,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:52:56,680 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:52:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:56,686 INFO L225 Difference]: With dead ends: 6174 [2021-08-21 11:52:56,686 INFO L226 Difference]: Without dead ends: 6174 [2021-08-21 11:52:56,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4463.0ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:52:56,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2021-08-21 11:52:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 3964. [2021-08-21 11:52:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3961 states have (on average 2.053521837919717) internal successors, (8134), 3963 states have internal predecessors, (8134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 8134 transitions. [2021-08-21 11:52:56,729 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 8134 transitions. Word has length 88 [2021-08-21 11:52:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:52:56,729 INFO L470 AbstractCegarLoop]: Abstraction has 3964 states and 8134 transitions. [2021-08-21 11:52:56,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 8134 transitions. [2021-08-21 11:52:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:52:56,733 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:52:56,733 INFO L512 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] [2021-08-21 11:52:56,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-21 11:52:56,733 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)] === [2021-08-21 11:52:56,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:52:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1819553777, now seen corresponding path program 36 times [2021-08-21 11:52:56,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:52:56,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839279861] [2021-08-21 11:52:56,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:52:56,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:52:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:57,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:57,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839279861] [2021-08-21 11:52:57,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839279861] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:57,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:57,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:52:57,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162823369] [2021-08-21 11:52:57,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:52:57,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:57,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:52:57,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:52:57,771 INFO L87 Difference]: Start difference. First operand 3964 states and 8134 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:03,650 INFO L93 Difference]: Finished difference Result 6219 states and 12793 transitions. [2021-08-21 11:53:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:53:03,651 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:53:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:03,657 INFO L225 Difference]: With dead ends: 6219 [2021-08-21 11:53:03,657 INFO L226 Difference]: Without dead ends: 6219 [2021-08-21 11:53:03,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4464.2ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:53:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2021-08-21 11:53:03,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 3960. [2021-08-21 11:53:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3957 states have (on average 2.0535759413697243) internal successors, (8126), 3959 states have internal predecessors, (8126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 8126 transitions. [2021-08-21 11:53:03,701 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 8126 transitions. Word has length 88 [2021-08-21 11:53:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:03,701 INFO L470 AbstractCegarLoop]: Abstraction has 3960 states and 8126 transitions. [2021-08-21 11:53:03,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 8126 transitions. [2021-08-21 11:53:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:53:03,704 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:03,704 INFO L512 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] [2021-08-21 11:53:03,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-21 11:53:03,705 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)] === [2021-08-21 11:53:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1984954737, now seen corresponding path program 37 times [2021-08-21 11:53:03,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:03,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47698809] [2021-08-21 11:53:03,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:03,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:53:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:53:04,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:53:04,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47698809] [2021-08-21 11:53:04,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47698809] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:53:04,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:53:04,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:53:04,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074000890] [2021-08-21 11:53:04,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:53:04,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:53:04,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:53:04,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:53:04,801 INFO L87 Difference]: Start difference. First operand 3960 states and 8126 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:10,697 INFO L93 Difference]: Finished difference Result 6279 states and 12913 transitions. [2021-08-21 11:53:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:53:10,697 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:53:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:10,705 INFO L225 Difference]: With dead ends: 6279 [2021-08-21 11:53:10,705 INFO L226 Difference]: Without dead ends: 6279 [2021-08-21 11:53:10,706 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4451.2ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:53:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2021-08-21 11:53:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 3956. [2021-08-21 11:53:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3953 states have (on average 2.05363015431318) internal successors, (8118), 3955 states have internal predecessors, (8118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 8118 transitions. [2021-08-21 11:53:10,760 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 8118 transitions. Word has length 88 [2021-08-21 11:53:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:10,760 INFO L470 AbstractCegarLoop]: Abstraction has 3956 states and 8118 transitions. [2021-08-21 11:53:10,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 8118 transitions. [2021-08-21 11:53:10,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:53:10,763 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:10,763 INFO L512 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] [2021-08-21 11:53:10,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-08-21 11:53:10,763 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)] === [2021-08-21 11:53:10,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:10,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1728908081, now seen corresponding path program 38 times [2021-08-21 11:53:10,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:10,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095682387] [2021-08-21 11:53:10,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:10,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:53:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:53:11,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:53:11,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095682387] [2021-08-21 11:53:11,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095682387] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:53:11,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:53:11,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:53:11,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574729857] [2021-08-21 11:53:11,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:53:11,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:53:11,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:53:11,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:53:11,905 INFO L87 Difference]: Start difference. First operand 3956 states and 8118 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:17,606 INFO L93 Difference]: Finished difference Result 5861 states and 12045 transitions. [2021-08-21 11:53:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:53:17,606 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:53:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:17,612 INFO L225 Difference]: With dead ends: 5861 [2021-08-21 11:53:17,613 INFO L226 Difference]: Without dead ends: 5861 [2021-08-21 11:53:17,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4508.5ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:53:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5861 states. [2021-08-21 11:53:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5861 to 3954. [2021-08-21 11:53:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-21 11:53:17,655 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-21 11:53:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:17,655 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-21 11:53:17,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-21 11:53:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:53:17,658 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:17,658 INFO L512 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] [2021-08-21 11:53:17,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-08-21 11:53:17,658 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)] === [2021-08-21 11:53:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1537473473, now seen corresponding path program 39 times [2021-08-21 11:53:17,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:17,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297939677] [2021-08-21 11:53:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:17,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:53:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:53:18,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:53:18,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297939677] [2021-08-21 11:53:18,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297939677] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:53:18,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:53:18,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:53:18,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564807117] [2021-08-21 11:53:18,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:53:18,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:53:18,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:53:18,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:53:18,677 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:24,905 INFO L93 Difference]: Finished difference Result 6756 states and 13894 transitions. [2021-08-21 11:53:24,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:53:24,906 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:53:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:24,913 INFO L225 Difference]: With dead ends: 6756 [2021-08-21 11:53:24,914 INFO L226 Difference]: Without dead ends: 6756 [2021-08-21 11:53:24,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4804.0ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:53:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2021-08-21 11:53:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 3986. [2021-08-21 11:53:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3986 states, 3983 states have (on average 2.0537283454682402) internal successors, (8180), 3985 states have internal predecessors, (8180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 8180 transitions. [2021-08-21 11:53:24,961 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 8180 transitions. Word has length 88 [2021-08-21 11:53:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:24,961 INFO L470 AbstractCegarLoop]: Abstraction has 3986 states and 8180 transitions. [2021-08-21 11:53:24,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 8180 transitions. [2021-08-21 11:53:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:53:24,964 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:24,964 INFO L512 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] [2021-08-21 11:53:24,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-08-21 11:53:24,964 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)] === [2021-08-21 11:53:24,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1023960055, now seen corresponding path program 40 times [2021-08-21 11:53:24,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:24,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998582626] [2021-08-21 11:53:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:24,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:53:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:53:26,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:53:26,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998582626] [2021-08-21 11:53:26,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998582626] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:53:26,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:53:26,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:53:26,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791362299] [2021-08-21 11:53:26,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:53:26,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:53:26,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:53:26,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:53:26,016 INFO L87 Difference]: Start difference. First operand 3986 states and 8180 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:32,113 INFO L93 Difference]: Finished difference Result 6034 states and 12393 transitions. [2021-08-21 11:53:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:53:32,113 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:53:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:32,119 INFO L225 Difference]: With dead ends: 6034 [2021-08-21 11:53:32,119 INFO L226 Difference]: Without dead ends: 6034 [2021-08-21 11:53:32,119 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4730.8ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:53:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2021-08-21 11:53:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3984. [2021-08-21 11:53:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3984 states, 3981 states have (on average 2.0537553378548106) internal successors, (8176), 3983 states have internal predecessors, (8176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 8176 transitions. [2021-08-21 11:53:32,165 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 8176 transitions. Word has length 88 [2021-08-21 11:53:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:32,165 INFO L470 AbstractCegarLoop]: Abstraction has 3984 states and 8176 transitions. [2021-08-21 11:53:32,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 8176 transitions. [2021-08-21 11:53:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:53:32,168 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:32,168 INFO L512 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] [2021-08-21 11:53:32,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-08-21 11:53:32,168 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)] === [2021-08-21 11:53:32,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:32,168 INFO L82 PathProgramCache]: Analyzing trace with hash 385757767, now seen corresponding path program 41 times [2021-08-21 11:53:32,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:32,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417758567] [2021-08-21 11:53:32,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:32,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:53:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:53:33,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:53:33,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417758567] [2021-08-21 11:53:33,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417758567] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:53:33,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:53:33,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:53:33,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108208024] [2021-08-21 11:53:33,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:53:33,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:53:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:53:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:53:33,209 INFO L87 Difference]: Start difference. First operand 3984 states and 8176 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:39,647 INFO L93 Difference]: Finished difference Result 6073 states and 12486 transitions. [2021-08-21 11:53:39,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:53:39,648 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:53:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:39,654 INFO L225 Difference]: With dead ends: 6073 [2021-08-21 11:53:39,654 INFO L226 Difference]: Without dead ends: 6073 [2021-08-21 11:53:39,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 4878.4ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:53:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2021-08-21 11:53:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3968. [2021-08-21 11:53:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3965 states have (on average 2.053467843631778) internal successors, (8142), 3967 states have internal predecessors, (8142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 8142 transitions. [2021-08-21 11:53:39,698 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 8142 transitions. Word has length 88 [2021-08-21 11:53:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:39,699 INFO L470 AbstractCegarLoop]: Abstraction has 3968 states and 8142 transitions. [2021-08-21 11:53:39,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 8142 transitions. [2021-08-21 11:53:39,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:53:39,701 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:39,701 INFO L512 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] [2021-08-21 11:53:39,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-08-21 11:53:39,702 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)] === [2021-08-21 11:53:39,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:39,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1369610415, now seen corresponding path program 42 times [2021-08-21 11:53:39,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:39,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135450577] [2021-08-21 11:53:39,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:39,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:53:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:53:40,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:53:40,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135450577] [2021-08-21 11:53:40,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135450577] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:53:40,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:53:40,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:53:40,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131844842] [2021-08-21 11:53:40,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:53:40,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:53:40,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:53:40,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:53:40,758 INFO L87 Difference]: Start difference. First operand 3968 states and 8142 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:46,316 INFO L93 Difference]: Finished difference Result 6208 states and 12771 transitions. [2021-08-21 11:53:46,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:53:46,316 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:53:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:46,322 INFO L225 Difference]: With dead ends: 6208 [2021-08-21 11:53:46,322 INFO L226 Difference]: Without dead ends: 6208 [2021-08-21 11:53:46,323 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4416.9ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:53:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6208 states. [2021-08-21 11:53:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6208 to 3966. [2021-08-21 11:53:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 2.053494827151148) internal successors, (8138), 3965 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 8138 transitions. [2021-08-21 11:53:46,367 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 8138 transitions. Word has length 88 [2021-08-21 11:53:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:46,367 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 8138 transitions. [2021-08-21 11:53:46,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 8138 transitions. [2021-08-21 11:53:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:53:46,370 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:46,370 INFO L512 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] [2021-08-21 11:53:46,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-21 11:53:46,370 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)] === [2021-08-21 11:53:46,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:46,370 INFO L82 PathProgramCache]: Analyzing trace with hash 445901979, now seen corresponding path program 43 times [2021-08-21 11:53:46,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:46,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657197181] [2021-08-21 11:53:46,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:46,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:53:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:53:47,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:53:47,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657197181] [2021-08-21 11:53:47,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657197181] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:53:47,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:53:47,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:53:47,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352602429] [2021-08-21 11:53:47,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:53:47,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:53:47,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:53:47,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:53:47,411 INFO L87 Difference]: Start difference. First operand 3966 states and 8138 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:52,979 INFO L93 Difference]: Finished difference Result 6253 states and 12861 transitions. [2021-08-21 11:53:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:53:52,979 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:53:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:52,985 INFO L225 Difference]: With dead ends: 6253 [2021-08-21 11:53:52,985 INFO L226 Difference]: Without dead ends: 6253 [2021-08-21 11:53:52,986 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4364.8ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:53:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6253 states. [2021-08-21 11:53:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6253 to 3962. [2021-08-21 11:53:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3959 states have (on average 2.0535488759787826) internal successors, (8130), 3961 states have internal predecessors, (8130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 8130 transitions. [2021-08-21 11:53:53,028 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 8130 transitions. Word has length 88 [2021-08-21 11:53:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:53,028 INFO L470 AbstractCegarLoop]: Abstraction has 3962 states and 8130 transitions. [2021-08-21 11:53:53,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 8130 transitions. [2021-08-21 11:53:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:53:53,031 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:53,031 INFO L512 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] [2021-08-21 11:53:53,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-08-21 11:53:53,031 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)] === [2021-08-21 11:53:53,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:53,031 INFO L82 PathProgramCache]: Analyzing trace with hash -44556803, now seen corresponding path program 44 times [2021-08-21 11:53:53,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:53,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506950675] [2021-08-21 11:53:53,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:53,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:53:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:53:54,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:53:54,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506950675] [2021-08-21 11:53:54,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506950675] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:53:54,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:53:54,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:53:54,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400588847] [2021-08-21 11:53:54,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:53:54,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:53:54,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:53:54,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:53:54,097 INFO L87 Difference]: Start difference. First operand 3962 states and 8130 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:59,833 INFO L93 Difference]: Finished difference Result 6313 states and 12981 transitions. [2021-08-21 11:53:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:53:59,833 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:53:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:59,839 INFO L225 Difference]: With dead ends: 6313 [2021-08-21 11:53:59,839 INFO L226 Difference]: Without dead ends: 6313 [2021-08-21 11:53:59,840 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4353.8ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:53:59,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6313 states. [2021-08-21 11:53:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6313 to 3958. [2021-08-21 11:53:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3955 states have (on average 2.0536030341340075) internal successors, (8122), 3957 states have internal predecessors, (8122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 8122 transitions. [2021-08-21 11:53:59,896 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 8122 transitions. Word has length 88 [2021-08-21 11:53:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:59,896 INFO L470 AbstractCegarLoop]: Abstraction has 3958 states and 8122 transitions. [2021-08-21 11:53:59,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 8122 transitions. [2021-08-21 11:53:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:53:59,899 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:59,899 INFO L512 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] [2021-08-21 11:53:59,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-08-21 11:53:59,899 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)] === [2021-08-21 11:53:59,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:59,899 INFO L82 PathProgramCache]: Analyzing trace with hash -300603459, now seen corresponding path program 45 times [2021-08-21 11:53:59,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:59,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631117281] [2021-08-21 11:53:59,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:59,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:00,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:00,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631117281] [2021-08-21 11:54:00,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631117281] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:00,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:00,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:54:00,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801481989] [2021-08-21 11:54:00,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:54:00,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:00,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:54:00,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:54:00,980 INFO L87 Difference]: Start difference. First operand 3958 states and 8122 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:54:06,661 INFO L93 Difference]: Finished difference Result 6358 states and 13071 transitions. [2021-08-21 11:54:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:54:06,661 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:54:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:54:06,668 INFO L225 Difference]: With dead ends: 6358 [2021-08-21 11:54:06,668 INFO L226 Difference]: Without dead ends: 6358 [2021-08-21 11:54:06,668 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4350.4ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:54:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6358 states. [2021-08-21 11:54:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6358 to 3956. [2021-08-21 11:54:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3953 states have (on average 2.05363015431318) internal successors, (8118), 3955 states have internal predecessors, (8118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 8118 transitions. [2021-08-21 11:54:06,714 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 8118 transitions. Word has length 88 [2021-08-21 11:54:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:54:06,714 INFO L470 AbstractCegarLoop]: Abstraction has 3956 states and 8118 transitions. [2021-08-21 11:54:06,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 8118 transitions. [2021-08-21 11:54:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:54:06,717 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:54:06,717 INFO L512 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] [2021-08-21 11:54:06,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-08-21 11:54:06,717 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)] === [2021-08-21 11:54:06,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:54:06,718 INFO L82 PathProgramCache]: Analyzing trace with hash 164374939, now seen corresponding path program 46 times [2021-08-21 11:54:06,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:54:06,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854730390] [2021-08-21 11:54:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:54:06,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:54:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:07,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:07,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854730390] [2021-08-21 11:54:07,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854730390] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:07,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:07,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:54:07,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846278203] [2021-08-21 11:54:07,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:54:07,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:07,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:54:07,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:54:07,780 INFO L87 Difference]: Start difference. First operand 3956 states and 8118 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:54:13,264 INFO L93 Difference]: Finished difference Result 5893 states and 12109 transitions. [2021-08-21 11:54:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:54:13,265 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:54:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:54:13,270 INFO L225 Difference]: With dead ends: 5893 [2021-08-21 11:54:13,271 INFO L226 Difference]: Without dead ends: 5893 [2021-08-21 11:54:13,271 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4349.6ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:54:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2021-08-21 11:54:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 3954. [2021-08-21 11:54:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-21 11:54:13,315 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-21 11:54:13,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:54:13,315 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-21 11:54:13,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-21 11:54:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:54:13,318 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:54:13,318 INFO L512 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] [2021-08-21 11:54:13,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-08-21 11:54:13,318 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)] === [2021-08-21 11:54:13,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:54:13,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1642866739, now seen corresponding path program 47 times [2021-08-21 11:54:13,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:54:13,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453690880] [2021-08-21 11:54:13,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:54:13,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:54:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:14,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:14,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453690880] [2021-08-21 11:54:14,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453690880] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:14,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:14,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:54:14,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156479749] [2021-08-21 11:54:14,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:54:14,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:14,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:54:14,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:54:14,355 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:54:20,339 INFO L93 Difference]: Finished difference Result 6501 states and 13367 transitions. [2021-08-21 11:54:20,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:54:20,340 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:54:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:54:20,346 INFO L225 Difference]: With dead ends: 6501 [2021-08-21 11:54:20,346 INFO L226 Difference]: Without dead ends: 6501 [2021-08-21 11:54:20,346 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4741.0ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:54:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6501 states. [2021-08-21 11:54:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6501 to 3992. [2021-08-21 11:54:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3992 states, 3989 states have (on average 2.053647530709451) internal successors, (8192), 3991 states have internal predecessors, (8192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 8192 transitions. [2021-08-21 11:54:20,384 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 8192 transitions. Word has length 88 [2021-08-21 11:54:20,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:54:20,384 INFO L470 AbstractCegarLoop]: Abstraction has 3992 states and 8192 transitions. [2021-08-21 11:54:20,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 8192 transitions. [2021-08-21 11:54:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:54:20,398 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:54:20,398 INFO L512 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] [2021-08-21 11:54:20,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-08-21 11:54:20,398 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)] === [2021-08-21 11:54:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:54:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2138587139, now seen corresponding path program 48 times [2021-08-21 11:54:20,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:54:20,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835298425] [2021-08-21 11:54:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:54:20,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:54:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:21,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:21,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835298425] [2021-08-21 11:54:21,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835298425] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:21,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:21,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:54:21,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697338910] [2021-08-21 11:54:21,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:54:21,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:21,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:54:21,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:54:21,385 INFO L87 Difference]: Start difference. First operand 3992 states and 8192 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:54:27,288 INFO L93 Difference]: Finished difference Result 5779 states and 11866 transitions. [2021-08-21 11:54:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:54:27,289 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:54:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:54:27,294 INFO L225 Difference]: With dead ends: 5779 [2021-08-21 11:54:27,295 INFO L226 Difference]: Without dead ends: 5779 [2021-08-21 11:54:27,295 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4722.1ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:54:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2021-08-21 11:54:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 3990. [2021-08-21 11:54:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3990 states, 3987 states have (on average 2.053674441936293) internal successors, (8188), 3989 states have internal predecessors, (8188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 8188 transitions. [2021-08-21 11:54:27,333 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 8188 transitions. Word has length 88 [2021-08-21 11:54:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:54:27,333 INFO L470 AbstractCegarLoop]: Abstraction has 3990 states and 8188 transitions. [2021-08-21 11:54:27,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 8188 transitions. [2021-08-21 11:54:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:54:27,336 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:54:27,336 INFO L512 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] [2021-08-21 11:54:27,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-08-21 11:54:27,336 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)] === [2021-08-21 11:54:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:54:27,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1500384851, now seen corresponding path program 49 times [2021-08-21 11:54:27,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:54:27,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052904268] [2021-08-21 11:54:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:54:27,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:54:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:28,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:28,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052904268] [2021-08-21 11:54:28,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052904268] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:28,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:28,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:54:28,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599950681] [2021-08-21 11:54:28,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:54:28,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:28,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:54:28,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:54:28,324 INFO L87 Difference]: Start difference. First operand 3990 states and 8188 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:54:34,667 INFO L93 Difference]: Finished difference Result 5818 states and 11959 transitions. [2021-08-21 11:54:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:54:34,668 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:54:34,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:54:34,674 INFO L225 Difference]: With dead ends: 5818 [2021-08-21 11:54:34,674 INFO L226 Difference]: Without dead ends: 5818 [2021-08-21 11:54:34,674 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 4923.6ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:54:34,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2021-08-21 11:54:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 3974. [2021-08-21 11:54:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3974 states, 3971 states have (on average 2.0533870561571392) internal successors, (8154), 3973 states have internal predecessors, (8154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 8154 transitions. [2021-08-21 11:54:34,722 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 8154 transitions. Word has length 88 [2021-08-21 11:54:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:54:34,722 INFO L470 AbstractCegarLoop]: Abstraction has 3974 states and 8154 transitions. [2021-08-21 11:54:34,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 8154 transitions. [2021-08-21 11:54:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:54:34,725 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:54:34,725 INFO L512 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] [2021-08-21 11:54:34,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-08-21 11:54:34,725 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)] === [2021-08-21 11:54:34,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:54:34,726 INFO L82 PathProgramCache]: Analyzing trace with hash -254983331, now seen corresponding path program 50 times [2021-08-21 11:54:34,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:54:34,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315559750] [2021-08-21 11:54:34,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:54:34,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:54:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:35,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:35,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315559750] [2021-08-21 11:54:35,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315559750] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:35,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:35,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:54:35,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107551017] [2021-08-21 11:54:35,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:54:35,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:35,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:54:35,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:54:35,809 INFO L87 Difference]: Start difference. First operand 3974 states and 8154 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:54:41,633 INFO L93 Difference]: Finished difference Result 5953 states and 12244 transitions. [2021-08-21 11:54:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:54:41,633 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:54:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:54:41,640 INFO L225 Difference]: With dead ends: 5953 [2021-08-21 11:54:41,640 INFO L226 Difference]: Without dead ends: 5953 [2021-08-21 11:54:41,640 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4389.6ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:54:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2021-08-21 11:54:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 3972. [2021-08-21 11:54:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3972 states, 3969 states have (on average 2.053413958175863) internal successors, (8150), 3971 states have internal predecessors, (8150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 8150 transitions. [2021-08-21 11:54:41,686 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 8150 transitions. Word has length 88 [2021-08-21 11:54:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:54:41,686 INFO L470 AbstractCegarLoop]: Abstraction has 3972 states and 8150 transitions. [2021-08-21 11:54:41,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 8150 transitions. [2021-08-21 11:54:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:54:41,689 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:54:41,689 INFO L512 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] [2021-08-21 11:54:41,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-08-21 11:54:41,690 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)] === [2021-08-21 11:54:41,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:54:41,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1560529063, now seen corresponding path program 51 times [2021-08-21 11:54:41,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:54:41,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567901482] [2021-08-21 11:54:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:54:41,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:54:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:42,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:42,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567901482] [2021-08-21 11:54:42,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567901482] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:42,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:42,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:54:42,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154794976] [2021-08-21 11:54:42,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:54:42,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:54:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:54:42,805 INFO L87 Difference]: Start difference. First operand 3972 states and 8150 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:54:48,674 INFO L93 Difference]: Finished difference Result 5998 states and 12334 transitions. [2021-08-21 11:54:48,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:54:48,674 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:54:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:54:48,680 INFO L225 Difference]: With dead ends: 5998 [2021-08-21 11:54:48,680 INFO L226 Difference]: Without dead ends: 5998 [2021-08-21 11:54:48,681 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4490.7ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:54:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2021-08-21 11:54:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3968. [2021-08-21 11:54:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3965 states have (on average 2.053467843631778) internal successors, (8142), 3967 states have internal predecessors, (8142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 8142 transitions. [2021-08-21 11:54:48,729 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 8142 transitions. Word has length 88 [2021-08-21 11:54:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:54:48,729 INFO L470 AbstractCegarLoop]: Abstraction has 3968 states and 8142 transitions. [2021-08-21 11:54:48,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 8142 transitions. [2021-08-21 11:54:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:54:48,732 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:54:48,732 INFO L512 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] [2021-08-21 11:54:48,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-08-21 11:54:48,732 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)] === [2021-08-21 11:54:48,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:54:48,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1070070281, now seen corresponding path program 52 times [2021-08-21 11:54:48,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:54:48,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267723557] [2021-08-21 11:54:48,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:54:48,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:54:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:49,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:49,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267723557] [2021-08-21 11:54:49,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267723557] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:49,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:49,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:54:49,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948432318] [2021-08-21 11:54:49,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:54:49,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:49,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:54:49,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:54:49,825 INFO L87 Difference]: Start difference. First operand 3968 states and 8142 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:54:55,807 INFO L93 Difference]: Finished difference Result 6058 states and 12454 transitions. [2021-08-21 11:54:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:54:55,808 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:54:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:54:55,814 INFO L225 Difference]: With dead ends: 6058 [2021-08-21 11:54:55,815 INFO L226 Difference]: Without dead ends: 6058 [2021-08-21 11:54:55,815 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4359.4ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:54:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2021-08-21 11:54:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3964. [2021-08-21 11:54:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3961 states have (on average 2.053521837919717) internal successors, (8134), 3963 states have internal predecessors, (8134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 8134 transitions. [2021-08-21 11:54:55,864 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 8134 transitions. Word has length 88 [2021-08-21 11:54:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:54:55,864 INFO L470 AbstractCegarLoop]: Abstraction has 3964 states and 8134 transitions. [2021-08-21 11:54:55,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 8134 transitions. [2021-08-21 11:54:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:54:55,867 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:54:55,867 INFO L512 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] [2021-08-21 11:54:55,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-08-21 11:54:55,867 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)] === [2021-08-21 11:54:55,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:54:55,868 INFO L82 PathProgramCache]: Analyzing trace with hash 814023625, now seen corresponding path program 53 times [2021-08-21 11:54:55,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:54:55,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884656957] [2021-08-21 11:54:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:54:55,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:54:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:56,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:56,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884656957] [2021-08-21 11:54:56,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884656957] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:56,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:56,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:54:56,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169657948] [2021-08-21 11:54:56,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:54:56,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:56,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:54:56,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:54:56,931 INFO L87 Difference]: Start difference. First operand 3964 states and 8134 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:55:02,539 INFO L93 Difference]: Finished difference Result 6103 states and 12544 transitions. [2021-08-21 11:55:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:55:02,540 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:55:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:02,546 INFO L225 Difference]: With dead ends: 6103 [2021-08-21 11:55:02,546 INFO L226 Difference]: Without dead ends: 6103 [2021-08-21 11:55:02,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4336.1ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:55:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6103 states. [2021-08-21 11:55:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6103 to 3962. [2021-08-21 11:55:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3959 states have (on average 2.0535488759787826) internal successors, (8130), 3961 states have internal predecessors, (8130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 8130 transitions. [2021-08-21 11:55:02,590 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 8130 transitions. Word has length 88 [2021-08-21 11:55:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:02,590 INFO L470 AbstractCegarLoop]: Abstraction has 3962 states and 8130 transitions. [2021-08-21 11:55:02,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 8130 transitions. [2021-08-21 11:55:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:55:02,593 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:02,593 INFO L512 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] [2021-08-21 11:55:02,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-08-21 11:55:02,593 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)] === [2021-08-21 11:55:02,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:02,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1279002023, now seen corresponding path program 54 times [2021-08-21 11:55:02,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:02,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464280072] [2021-08-21 11:55:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:02,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:55:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:55:03,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:55:03,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464280072] [2021-08-21 11:55:03,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464280072] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:55:03,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:55:03,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:55:03,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554628518] [2021-08-21 11:55:03,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:55:03,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:55:03,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:55:03,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:55:03,671 INFO L87 Difference]: Start difference. First operand 3962 states and 8130 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:09,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:55:09,219 INFO L93 Difference]: Finished difference Result 6133 states and 12604 transitions. [2021-08-21 11:55:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:55:09,220 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:55:09,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:09,226 INFO L225 Difference]: With dead ends: 6133 [2021-08-21 11:55:09,226 INFO L226 Difference]: Without dead ends: 6133 [2021-08-21 11:55:09,227 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4379.3ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:55:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2021-08-21 11:55:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 3960. [2021-08-21 11:55:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3957 states have (on average 2.0535759413697243) internal successors, (8126), 3959 states have internal predecessors, (8126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 8126 transitions. [2021-08-21 11:55:09,273 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 8126 transitions. Word has length 88 [2021-08-21 11:55:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:09,273 INFO L470 AbstractCegarLoop]: Abstraction has 3960 states and 8126 transitions. [2021-08-21 11:55:09,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 8126 transitions. [2021-08-21 11:55:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:55:09,276 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:09,276 INFO L512 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] [2021-08-21 11:55:09,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-08-21 11:55:09,276 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)] === [2021-08-21 11:55:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1446059383, now seen corresponding path program 55 times [2021-08-21 11:55:09,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:09,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377761344] [2021-08-21 11:55:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:09,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:55:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:55:10,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:55:10,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377761344] [2021-08-21 11:55:10,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377761344] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:55:10,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:55:10,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:55:10,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991069501] [2021-08-21 11:55:10,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:55:10,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:55:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:55:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:55:10,340 INFO L87 Difference]: Start difference. First operand 3960 states and 8126 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:55:16,235 INFO L93 Difference]: Finished difference Result 5636 states and 11578 transitions. [2021-08-21 11:55:16,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:55:16,235 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:55:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:16,241 INFO L225 Difference]: With dead ends: 5636 [2021-08-21 11:55:16,241 INFO L226 Difference]: Without dead ends: 5636 [2021-08-21 11:55:16,241 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4409.6ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:55:16,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2021-08-21 11:55:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 3954. [2021-08-21 11:55:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-21 11:55:16,290 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-21 11:55:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:16,290 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-21 11:55:16,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-21 11:55:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:55:16,293 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:16,293 INFO L512 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] [2021-08-21 11:55:16,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-08-21 11:55:16,293 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)] === [2021-08-21 11:55:16,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:16,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1008395733, now seen corresponding path program 56 times [2021-08-21 11:55:16,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:16,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752316670] [2021-08-21 11:55:16,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:16,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:55:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:55:17,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:55:17,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752316670] [2021-08-21 11:55:17,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752316670] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:55:17,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:55:17,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:55:17,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409513188] [2021-08-21 11:55:17,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:55:17,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:55:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:55:17,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:55:17,375 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:55:23,590 INFO L93 Difference]: Finished difference Result 6292 states and 12950 transitions. [2021-08-21 11:55:23,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:55:23,590 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:55:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:23,596 INFO L225 Difference]: With dead ends: 6292 [2021-08-21 11:55:23,596 INFO L226 Difference]: Without dead ends: 6292 [2021-08-21 11:55:23,597 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 4782.0ms TimeCoverageRelationStatistics Valid=1183, Invalid=5459, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:55:23,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6292 states. [2021-08-21 11:55:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6292 to 3980. [2021-08-21 11:55:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3977 states have (on average 2.053809404073422) internal successors, (8168), 3979 states have internal predecessors, (8168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 8168 transitions. [2021-08-21 11:55:23,640 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 8168 transitions. Word has length 88 [2021-08-21 11:55:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:23,640 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 8168 transitions. [2021-08-21 11:55:23,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 8168 transitions. [2021-08-21 11:55:23,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:55:23,643 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:23,643 INFO L512 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] [2021-08-21 11:55:23,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-08-21 11:55:23,643 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)] === [2021-08-21 11:55:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash 494882315, now seen corresponding path program 57 times [2021-08-21 11:55:23,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:23,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869540430] [2021-08-21 11:55:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:23,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:55:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:55:24,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:55:24,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869540430] [2021-08-21 11:55:24,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869540430] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:55:24,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:55:24,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:55:24,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714187237] [2021-08-21 11:55:24,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:55:24,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:55:24,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:55:24,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:55:24,698 INFO L87 Difference]: Start difference. First operand 3980 states and 8168 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:55:30,893 INFO L93 Difference]: Finished difference Result 5570 states and 11449 transitions. [2021-08-21 11:55:30,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:55:30,894 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:55:30,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:30,899 INFO L225 Difference]: With dead ends: 5570 [2021-08-21 11:55:30,899 INFO L226 Difference]: Without dead ends: 5570 [2021-08-21 11:55:30,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 4808.0ms TimeCoverageRelationStatistics Valid=1050, Invalid=4956, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:55:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2021-08-21 11:55:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 3978. [2021-08-21 11:55:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3975 states have (on average 2.053836477987421) internal successors, (8164), 3977 states have internal predecessors, (8164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 8164 transitions. [2021-08-21 11:55:30,941 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 8164 transitions. Word has length 88 [2021-08-21 11:55:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:30,941 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 8164 transitions. [2021-08-21 11:55:30,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 8164 transitions. [2021-08-21 11:55:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:55:30,944 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:30,944 INFO L512 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] [2021-08-21 11:55:30,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-08-21 11:55:30,944 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)] === [2021-08-21 11:55:30,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:30,944 INFO L82 PathProgramCache]: Analyzing trace with hash -143319973, now seen corresponding path program 58 times [2021-08-21 11:55:30,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:30,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551342630] [2021-08-21 11:55:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:30,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:55:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:55:31,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:55:31,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551342630] [2021-08-21 11:55:31,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551342630] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:55:31,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:55:31,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:55:31,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678818742] [2021-08-21 11:55:31,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:55:31,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:55:31,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:55:31,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:55:31,972 INFO L87 Difference]: Start difference. First operand 3978 states and 8164 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:55:38,149 INFO L93 Difference]: Finished difference Result 5609 states and 11542 transitions. [2021-08-21 11:55:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:55:38,149 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:55:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:38,155 INFO L225 Difference]: With dead ends: 5609 [2021-08-21 11:55:38,155 INFO L226 Difference]: Without dead ends: 5609 [2021-08-21 11:55:38,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 5036.7ms TimeCoverageRelationStatistics Valid=1093, Invalid=5069, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:55:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5609 states. [2021-08-21 11:55:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5609 to 3962. [2021-08-21 11:55:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3959 states have (on average 2.0535488759787826) internal successors, (8130), 3961 states have internal predecessors, (8130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 8130 transitions. [2021-08-21 11:55:38,198 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 8130 transitions. Word has length 88 [2021-08-21 11:55:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:38,198 INFO L470 AbstractCegarLoop]: Abstraction has 3962 states and 8130 transitions. [2021-08-21 11:55:38,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 8130 transitions. [2021-08-21 11:55:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:55:38,201 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:38,201 INFO L512 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] [2021-08-21 11:55:38,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-08-21 11:55:38,201 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)] === [2021-08-21 11:55:38,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:38,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1898688155, now seen corresponding path program 59 times [2021-08-21 11:55:38,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:38,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568967795] [2021-08-21 11:55:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:38,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:55:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:55:39,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:55:39,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568967795] [2021-08-21 11:55:39,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568967795] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:55:39,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:55:39,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:55:39,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316640492] [2021-08-21 11:55:39,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:55:39,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:55:39,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:55:39,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:55:39,315 INFO L87 Difference]: Start difference. First operand 3962 states and 8130 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:55:45,018 INFO L93 Difference]: Finished difference Result 5744 states and 11827 transitions. [2021-08-21 11:55:45,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:55:45,019 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:55:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:45,025 INFO L225 Difference]: With dead ends: 5744 [2021-08-21 11:55:45,025 INFO L226 Difference]: Without dead ends: 5744 [2021-08-21 11:55:45,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 4488.7ms TimeCoverageRelationStatistics Valid=1069, Invalid=5093, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:55:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2021-08-21 11:55:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 3960. [2021-08-21 11:55:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3957 states have (on average 2.0535759413697243) internal successors, (8126), 3959 states have internal predecessors, (8126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 8126 transitions. [2021-08-21 11:55:45,070 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 8126 transitions. Word has length 88 [2021-08-21 11:55:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:45,070 INFO L470 AbstractCegarLoop]: Abstraction has 3960 states and 8126 transitions. [2021-08-21 11:55:45,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 8126 transitions. [2021-08-21 11:55:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:55:45,073 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:45,073 INFO L512 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] [2021-08-21 11:55:45,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-08-21 11:55:45,073 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)] === [2021-08-21 11:55:45,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:45,073 INFO L82 PathProgramCache]: Analyzing trace with hash -83175761, now seen corresponding path program 60 times [2021-08-21 11:55:45,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:45,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698169571] [2021-08-21 11:55:45,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:45,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:55:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:55:46,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:55:46,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698169571] [2021-08-21 11:55:46,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698169571] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:55:46,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:55:46,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:55:46,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825867248] [2021-08-21 11:55:46,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:55:46,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:55:46,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:55:46,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:55:46,174 INFO L87 Difference]: Start difference. First operand 3960 states and 8126 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:55:51,958 INFO L93 Difference]: Finished difference Result 5609 states and 11542 transitions. [2021-08-21 11:55:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:55:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:55:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:51,964 INFO L225 Difference]: With dead ends: 5609 [2021-08-21 11:55:51,964 INFO L226 Difference]: Without dead ends: 5609 [2021-08-21 11:55:51,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 4489.6ms TimeCoverageRelationStatistics Valid=1069, Invalid=5093, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:55:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5609 states. [2021-08-21 11:55:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5609 to 3956. [2021-08-21 11:55:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3953 states have (on average 2.05363015431318) internal successors, (8118), 3955 states have internal predecessors, (8118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 8118 transitions. [2021-08-21 11:55:52,008 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 8118 transitions. Word has length 88 [2021-08-21 11:55:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:52,008 INFO L470 AbstractCegarLoop]: Abstraction has 3956 states and 8118 transitions. [2021-08-21 11:55:52,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 8118 transitions. [2021-08-21 11:55:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:55:52,011 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:52,011 INFO L512 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] [2021-08-21 11:55:52,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-08-21 11:55:52,011 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)] === [2021-08-21 11:55:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:52,012 INFO L82 PathProgramCache]: Analyzing trace with hash 88061973, now seen corresponding path program 61 times [2021-08-21 11:55:52,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:52,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49535882] [2021-08-21 11:55:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:52,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:55:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:55:52,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:55:52,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49535882] [2021-08-21 11:55:52,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49535882] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:55:52,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:55:52,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:55:52,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442055456] [2021-08-21 11:55:52,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:55:52,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:55:52,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:55:52,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:55:52,991 INFO L87 Difference]: Start difference. First operand 3956 states and 8118 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:59,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:55:59,637 INFO L93 Difference]: Finished difference Result 6642 states and 13685 transitions. [2021-08-21 11:55:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-21 11:55:59,637 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:55:59,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:59,645 INFO L225 Difference]: With dead ends: 6642 [2021-08-21 11:55:59,645 INFO L226 Difference]: Without dead ends: 6642 [2021-08-21 11:55:59,646 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 5032.5ms TimeCoverageRelationStatistics Valid=1220, Invalid=5586, Unknown=0, NotChecked=0, Total=6806 [2021-08-21 11:55:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6642 states. [2021-08-21 11:55:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6642 to 3983. [2021-08-21 11:55:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 3980 states have (on average 2.0540201005025125) internal successors, (8175), 3982 states have internal predecessors, (8175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 8175 transitions. [2021-08-21 11:55:59,697 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 8175 transitions. Word has length 88 [2021-08-21 11:55:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:59,697 INFO L470 AbstractCegarLoop]: Abstraction has 3983 states and 8175 transitions. [2021-08-21 11:55:59,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 8175 transitions. [2021-08-21 11:55:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:55:59,700 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:59,701 INFO L512 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] [2021-08-21 11:55:59,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-08-21 11:55:59,701 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)] === [2021-08-21 11:55:59,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:59,701 INFO L82 PathProgramCache]: Analyzing trace with hash -425451445, now seen corresponding path program 62 times [2021-08-21 11:55:59,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:59,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445841717] [2021-08-21 11:55:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:59,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:00,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:00,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445841717] [2021-08-21 11:56:00,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445841717] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:00,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:00,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:56:00,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620974505] [2021-08-21 11:56:00,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:56:00,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:00,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:56:00,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:56:00,779 INFO L87 Difference]: Start difference. First operand 3983 states and 8175 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:56:06,696 INFO L93 Difference]: Finished difference Result 5920 states and 12184 transitions. [2021-08-21 11:56:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:56:06,696 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:56:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:56:06,703 INFO L225 Difference]: With dead ends: 5920 [2021-08-21 11:56:06,703 INFO L226 Difference]: Without dead ends: 5920 [2021-08-21 11:56:06,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 4653.8ms TimeCoverageRelationStatistics Valid=1087, Invalid=5075, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:56:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5920 states. [2021-08-21 11:56:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5920 to 3981. [2021-08-21 11:56:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3978 states have (on average 2.0540472599296127) internal successors, (8171), 3980 states have internal predecessors, (8171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 8171 transitions. [2021-08-21 11:56:06,750 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 8171 transitions. Word has length 88 [2021-08-21 11:56:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:56:06,750 INFO L470 AbstractCegarLoop]: Abstraction has 3981 states and 8171 transitions. [2021-08-21 11:56:06,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 8171 transitions. [2021-08-21 11:56:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:56:06,753 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:56:06,753 INFO L512 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] [2021-08-21 11:56:06,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-08-21 11:56:06,753 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)] === [2021-08-21 11:56:06,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:56:06,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1063653733, now seen corresponding path program 63 times [2021-08-21 11:56:06,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:56:06,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607751215] [2021-08-21 11:56:06,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:56:06,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:56:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:07,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:07,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607751215] [2021-08-21 11:56:07,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607751215] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:07,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:07,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:56:07,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223213893] [2021-08-21 11:56:07,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:56:07,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:07,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:56:07,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:56:07,762 INFO L87 Difference]: Start difference. First operand 3981 states and 8171 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:56:14,033 INFO L93 Difference]: Finished difference Result 5824 states and 11992 transitions. [2021-08-21 11:56:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:56:14,034 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:56:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:56:14,040 INFO L225 Difference]: With dead ends: 5824 [2021-08-21 11:56:14,040 INFO L226 Difference]: Without dead ends: 5824 [2021-08-21 11:56:14,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 4759.5ms TimeCoverageRelationStatistics Valid=1131, Invalid=5189, Unknown=0, NotChecked=0, Total=6320 [2021-08-21 11:56:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2021-08-21 11:56:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 3965. [2021-08-21 11:56:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3962 states have (on average 2.0537607269056033) internal successors, (8137), 3964 states have internal predecessors, (8137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 8137 transitions. [2021-08-21 11:56:14,089 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 8137 transitions. Word has length 88 [2021-08-21 11:56:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:56:14,089 INFO L470 AbstractCegarLoop]: Abstraction has 3965 states and 8137 transitions. [2021-08-21 11:56:14,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 8137 transitions. [2021-08-21 11:56:14,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:56:14,092 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:56:14,092 INFO L512 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] [2021-08-21 11:56:14,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-08-21 11:56:14,093 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)] === [2021-08-21 11:56:14,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:56:14,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1306427405, now seen corresponding path program 64 times [2021-08-21 11:56:14,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:56:14,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369824343] [2021-08-21 11:56:14,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:56:14,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:56:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:15,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:15,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369824343] [2021-08-21 11:56:15,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369824343] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:15,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:15,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:56:15,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520124657] [2021-08-21 11:56:15,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:56:15,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:15,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:56:15,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:56:15,113 INFO L87 Difference]: Start difference. First operand 3965 states and 8137 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:56:21,757 INFO L93 Difference]: Finished difference Result 7383 states and 15210 transitions. [2021-08-21 11:56:21,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-21 11:56:21,758 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:56:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:56:21,765 INFO L225 Difference]: With dead ends: 7383 [2021-08-21 11:56:21,765 INFO L226 Difference]: Without dead ends: 7383 [2021-08-21 11:56:21,766 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 5316.9ms TimeCoverageRelationStatistics Valid=1305, Invalid=5835, Unknown=0, NotChecked=0, Total=7140 [2021-08-21 11:56:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2021-08-21 11:56:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 3966. [2021-08-21 11:56:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 2.0537471612414837) internal successors, (8139), 3965 states have internal predecessors, (8139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 8139 transitions. [2021-08-21 11:56:21,812 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 8139 transitions. Word has length 88 [2021-08-21 11:56:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:56:21,813 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 8139 transitions. [2021-08-21 11:56:21,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 8139 transitions. [2021-08-21 11:56:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:56:21,815 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:56:21,815 INFO L512 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] [2021-08-21 11:56:21,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-08-21 11:56:21,815 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)] === [2021-08-21 11:56:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:56:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash -635698263, now seen corresponding path program 65 times [2021-08-21 11:56:21,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:56:21,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291993247] [2021-08-21 11:56:21,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:56:21,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:56:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:22,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:22,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291993247] [2021-08-21 11:56:22,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291993247] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:22,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:22,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:56:22,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741595074] [2021-08-21 11:56:22,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:56:22,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:22,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:56:22,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:56:22,905 INFO L87 Difference]: Start difference. First operand 3966 states and 8139 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:56:29,168 INFO L93 Difference]: Finished difference Result 6611 states and 13606 transitions. [2021-08-21 11:56:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:56:29,169 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:56:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:56:29,176 INFO L225 Difference]: With dead ends: 6611 [2021-08-21 11:56:29,177 INFO L226 Difference]: Without dead ends: 6611 [2021-08-21 11:56:29,177 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 4892.6ms TimeCoverageRelationStatistics Valid=1177, Invalid=5465, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:56:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6611 states. [2021-08-21 11:56:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6611 to 3968. [2021-08-21 11:56:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3965 states have (on average 2.053720050441362) internal successors, (8143), 3967 states have internal predecessors, (8143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 8143 transitions. [2021-08-21 11:56:29,225 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 8143 transitions. Word has length 88 [2021-08-21 11:56:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:56:29,225 INFO L470 AbstractCegarLoop]: Abstraction has 3968 states and 8143 transitions. [2021-08-21 11:56:29,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 8143 transitions. [2021-08-21 11:56:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:56:29,228 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:56:29,228 INFO L512 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] [2021-08-21 11:56:29,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-08-21 11:56:29,228 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)] === [2021-08-21 11:56:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:56:29,229 INFO L82 PathProgramCache]: Analyzing trace with hash 600461801, now seen corresponding path program 66 times [2021-08-21 11:56:29,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:56:29,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123229117] [2021-08-21 11:56:29,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:56:29,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:56:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:30,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:30,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123229117] [2021-08-21 11:56:30,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123229117] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:30,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:30,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:56:30,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821887413] [2021-08-21 11:56:30,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:56:30,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:56:30,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:56:30,224 INFO L87 Difference]: Start difference. First operand 3968 states and 8143 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:56:35,947 INFO L93 Difference]: Finished difference Result 5778 states and 11883 transitions. [2021-08-21 11:56:35,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:56:35,947 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:56:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:56:35,953 INFO L225 Difference]: With dead ends: 5778 [2021-08-21 11:56:35,953 INFO L226 Difference]: Without dead ends: 5778 [2021-08-21 11:56:35,954 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 4383.7ms TimeCoverageRelationStatistics Valid=1046, Invalid=4960, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:56:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2021-08-21 11:56:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 3957. [2021-08-21 11:56:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3957 states, 3954 states have (on average 2.0536165907941326) internal successors, (8120), 3956 states have internal predecessors, (8120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3957 states to 3957 states and 8120 transitions. [2021-08-21 11:56:36,007 INFO L78 Accepts]: Start accepts. Automaton has 3957 states and 8120 transitions. Word has length 88 [2021-08-21 11:56:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:56:36,007 INFO L470 AbstractCegarLoop]: Abstraction has 3957 states and 8120 transitions. [2021-08-21 11:56:36,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3957 states and 8120 transitions. [2021-08-21 11:56:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:56:36,010 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:56:36,010 INFO L512 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] [2021-08-21 11:56:36,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-08-21 11:56:36,010 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)] === [2021-08-21 11:56:36,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:56:36,010 INFO L82 PathProgramCache]: Analyzing trace with hash 536592695, now seen corresponding path program 67 times [2021-08-21 11:56:36,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:56:36,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875717090] [2021-08-21 11:56:36,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:56:36,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:56:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:37,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:37,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875717090] [2021-08-21 11:56:37,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875717090] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:37,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:37,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:56:37,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076092240] [2021-08-21 11:56:37,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:56:37,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:37,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:56:37,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:56:37,059 INFO L87 Difference]: Start difference. First operand 3957 states and 8120 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:56:43,513 INFO L93 Difference]: Finished difference Result 6625 states and 13651 transitions. [2021-08-21 11:56:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:56:43,513 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:56:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:56:43,521 INFO L225 Difference]: With dead ends: 6625 [2021-08-21 11:56:43,521 INFO L226 Difference]: Without dead ends: 6625 [2021-08-21 11:56:43,521 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 4816.8ms TimeCoverageRelationStatistics Valid=1183, Invalid=5459, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:56:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2021-08-21 11:56:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 3977. [2021-08-21 11:56:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3977 states, 3974 states have (on average 2.053850025163563) internal successors, (8162), 3976 states have internal predecessors, (8162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 8162 transitions. [2021-08-21 11:56:43,569 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 8162 transitions. Word has length 88 [2021-08-21 11:56:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:56:43,569 INFO L470 AbstractCegarLoop]: Abstraction has 3977 states and 8162 transitions. [2021-08-21 11:56:43,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 8162 transitions. [2021-08-21 11:56:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:56:43,572 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:56:43,572 INFO L512 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] [2021-08-21 11:56:43,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-08-21 11:56:43,572 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)] === [2021-08-21 11:56:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:56:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash 23079277, now seen corresponding path program 68 times [2021-08-21 11:56:43,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:56:43,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193243679] [2021-08-21 11:56:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:56:43,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:56:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:44,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:44,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193243679] [2021-08-21 11:56:44,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193243679] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:44,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:44,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:56:44,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244098498] [2021-08-21 11:56:44,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:56:44,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:44,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:56:44,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:56:44,553 INFO L87 Difference]: Start difference. First operand 3977 states and 8162 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:56:50,236 INFO L93 Difference]: Finished difference Result 5903 states and 12150 transitions. [2021-08-21 11:56:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:56:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:56:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:56:50,243 INFO L225 Difference]: With dead ends: 5903 [2021-08-21 11:56:50,243 INFO L226 Difference]: Without dead ends: 5903 [2021-08-21 11:56:50,244 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 4453.6ms TimeCoverageRelationStatistics Valid=1050, Invalid=4956, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:56:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2021-08-21 11:56:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 3975. [2021-08-21 11:56:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3972 states have (on average 2.053877139979859) internal successors, (8158), 3974 states have internal predecessors, (8158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 8158 transitions. [2021-08-21 11:56:50,297 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 8158 transitions. Word has length 88 [2021-08-21 11:56:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:56:50,297 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 8158 transitions. [2021-08-21 11:56:50,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 8158 transitions. [2021-08-21 11:56:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:56:50,300 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:56:50,301 INFO L512 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] [2021-08-21 11:56:50,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-08-21 11:56:50,301 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)] === [2021-08-21 11:56:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:56:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash -615123011, now seen corresponding path program 69 times [2021-08-21 11:56:50,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:56:50,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983133732] [2021-08-21 11:56:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:56:50,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:56:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:51,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:51,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983133732] [2021-08-21 11:56:51,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983133732] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:51,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:51,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:56:51,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874394843] [2021-08-21 11:56:51,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:56:51,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:51,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:56:51,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:56:51,270 INFO L87 Difference]: Start difference. First operand 3975 states and 8158 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:56:57,251 INFO L93 Difference]: Finished difference Result 5942 states and 12243 transitions. [2021-08-21 11:56:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:56:57,251 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:56:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:56:57,258 INFO L225 Difference]: With dead ends: 5942 [2021-08-21 11:56:57,258 INFO L226 Difference]: Without dead ends: 5942 [2021-08-21 11:56:57,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 4609.0ms TimeCoverageRelationStatistics Valid=1093, Invalid=5069, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:56:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2021-08-21 11:56:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 3959. [2021-08-21 11:56:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3956 states have (on average 2.0535894843276035) internal successors, (8124), 3958 states have internal predecessors, (8124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 8124 transitions. [2021-08-21 11:56:57,310 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 8124 transitions. Word has length 88 [2021-08-21 11:56:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:56:57,310 INFO L470 AbstractCegarLoop]: Abstraction has 3959 states and 8124 transitions. [2021-08-21 11:56:57,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 8124 transitions. [2021-08-21 11:56:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:56:57,313 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:56:57,313 INFO L512 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] [2021-08-21 11:56:57,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-08-21 11:56:57,313 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)] === [2021-08-21 11:56:57,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:56:57,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1171992293, now seen corresponding path program 70 times [2021-08-21 11:56:57,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:56:57,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483599099] [2021-08-21 11:56:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:56:57,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:56:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:58,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:58,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483599099] [2021-08-21 11:56:58,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483599099] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:58,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:58,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:56:58,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526399649] [2021-08-21 11:56:58,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:56:58,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:58,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:56:58,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:56:58,408 INFO L87 Difference]: Start difference. First operand 3959 states and 8124 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:57:04,173 INFO L93 Difference]: Finished difference Result 5774 states and 11890 transitions. [2021-08-21 11:57:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:57:04,173 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:57:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:57:04,179 INFO L225 Difference]: With dead ends: 5774 [2021-08-21 11:57:04,179 INFO L226 Difference]: Without dead ends: 5774 [2021-08-21 11:57:04,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 4496.8ms TimeCoverageRelationStatistics Valid=1069, Invalid=5093, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:57:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2021-08-21 11:57:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 3954. [2021-08-21 11:57:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-21 11:57:04,223 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-21 11:57:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:57:04,223 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-21 11:57:04,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-21 11:57:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:57:04,226 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:57:04,226 INFO L512 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] [2021-08-21 11:57:04,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-08-21 11:57:04,226 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)] === [2021-08-21 11:57:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:57:04,227 INFO L82 PathProgramCache]: Analyzing trace with hash 738930753, now seen corresponding path program 71 times [2021-08-21 11:57:04,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:57:04,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437277261] [2021-08-21 11:57:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:57:04,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:57:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:57:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:57:05,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:57:05,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437277261] [2021-08-21 11:57:05,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437277261] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:57:05,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:57:05,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:57:05,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91179420] [2021-08-21 11:57:05,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:57:05,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:57:05,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:57:05,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:57:05,293 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:57:11,864 INFO L93 Difference]: Finished difference Result 6085 states and 12519 transitions. [2021-08-21 11:57:11,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-08-21 11:57:11,865 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:57:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:57:11,872 INFO L225 Difference]: With dead ends: 6085 [2021-08-21 11:57:11,872 INFO L226 Difference]: Without dead ends: 6085 [2021-08-21 11:57:11,872 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 5206.0ms TimeCoverageRelationStatistics Valid=1256, Invalid=5716, Unknown=0, NotChecked=0, Total=6972 [2021-08-21 11:57:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6085 states. [2021-08-21 11:57:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6085 to 3980. [2021-08-21 11:57:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3977 states have (on average 2.0540608498868496) internal successors, (8169), 3979 states have internal predecessors, (8169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 8169 transitions. [2021-08-21 11:57:11,923 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 8169 transitions. Word has length 88 [2021-08-21 11:57:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:57:11,923 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 8169 transitions. [2021-08-21 11:57:11,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 8169 transitions. [2021-08-21 11:57:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:57:11,926 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:57:11,927 INFO L512 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] [2021-08-21 11:57:11,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-08-21 11:57:11,927 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)] === [2021-08-21 11:57:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:57:11,927 INFO L82 PathProgramCache]: Analyzing trace with hash 225417335, now seen corresponding path program 72 times [2021-08-21 11:57:11,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:57:11,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117268036] [2021-08-21 11:57:11,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:57:11,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:57:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:57:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:57:12,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:57:12,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117268036] [2021-08-21 11:57:12,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117268036] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:57:12,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:57:12,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:57:12,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564416783] [2021-08-21 11:57:12,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:57:12,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:57:12,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:57:12,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:57:12,923 INFO L87 Difference]: Start difference. First operand 3980 states and 8169 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:57:19,254 INFO L93 Difference]: Finished difference Result 5363 states and 11018 transitions. [2021-08-21 11:57:19,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:57:19,254 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:57:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:57:19,260 INFO L225 Difference]: With dead ends: 5363 [2021-08-21 11:57:19,260 INFO L226 Difference]: Without dead ends: 5363 [2021-08-21 11:57:19,260 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4793.9ms TimeCoverageRelationStatistics Valid=1123, Invalid=5197, Unknown=0, NotChecked=0, Total=6320 [2021-08-21 11:57:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2021-08-21 11:57:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 3978. [2021-08-21 11:57:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3975 states have (on average 2.0540880503144656) internal successors, (8165), 3977 states have internal predecessors, (8165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 8165 transitions. [2021-08-21 11:57:19,305 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 8165 transitions. Word has length 88 [2021-08-21 11:57:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:57:19,305 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 8165 transitions. [2021-08-21 11:57:19,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 8165 transitions. [2021-08-21 11:57:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:57:19,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:57:19,309 INFO L512 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] [2021-08-21 11:57:19,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-08-21 11:57:19,309 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)] === [2021-08-21 11:57:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:57:19,309 INFO L82 PathProgramCache]: Analyzing trace with hash -412784953, now seen corresponding path program 73 times [2021-08-21 11:57:19,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:57:19,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224278405] [2021-08-21 11:57:19,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:57:19,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:57:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:57:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:57:20,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:57:20,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224278405] [2021-08-21 11:57:20,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224278405] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:57:20,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:57:20,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:57:20,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477340485] [2021-08-21 11:57:20,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:57:20,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:57:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:57:20,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:57:20,291 INFO L87 Difference]: Start difference. First operand 3978 states and 8165 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:57:26,613 INFO L93 Difference]: Finished difference Result 5267 states and 10826 transitions. [2021-08-21 11:57:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:57:26,614 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:57:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:57:26,619 INFO L225 Difference]: With dead ends: 5267 [2021-08-21 11:57:26,619 INFO L226 Difference]: Without dead ends: 5267 [2021-08-21 11:57:26,620 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 4988.8ms TimeCoverageRelationStatistics Valid=1168, Invalid=5312, Unknown=0, NotChecked=0, Total=6480 [2021-08-21 11:57:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2021-08-21 11:57:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 3962. [2021-08-21 11:57:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3959 states have (on average 2.0538014650164182) internal successors, (8131), 3961 states have internal predecessors, (8131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 8131 transitions. [2021-08-21 11:57:26,663 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 8131 transitions. Word has length 88 [2021-08-21 11:57:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:57:26,663 INFO L470 AbstractCegarLoop]: Abstraction has 3962 states and 8131 transitions. [2021-08-21 11:57:26,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 8131 transitions. [2021-08-21 11:57:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:57:26,666 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:57:26,666 INFO L512 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] [2021-08-21 11:57:26,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-08-21 11:57:26,667 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)] === [2021-08-21 11:57:26,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:57:26,667 INFO L82 PathProgramCache]: Analyzing trace with hash -655558625, now seen corresponding path program 74 times [2021-08-21 11:57:26,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:57:26,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281241261] [2021-08-21 11:57:26,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:57:26,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:57:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:57:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:57:27,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:57:27,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281241261] [2021-08-21 11:57:27,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281241261] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:57:27,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:57:27,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:57:27,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223766771] [2021-08-21 11:57:27,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:57:27,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:57:27,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:57:27,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:57:27,618 INFO L87 Difference]: Start difference. First operand 3962 states and 8131 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:57:34,624 INFO L93 Difference]: Finished difference Result 7014 states and 14437 transitions. [2021-08-21 11:57:34,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-08-21 11:57:34,625 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:57:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:57:34,632 INFO L225 Difference]: With dead ends: 7014 [2021-08-21 11:57:34,632 INFO L226 Difference]: Without dead ends: 7014 [2021-08-21 11:57:34,632 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 5509.1ms TimeCoverageRelationStatistics Valid=1340, Invalid=5970, Unknown=0, NotChecked=0, Total=7310 [2021-08-21 11:57:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2021-08-21 11:57:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 3963. [2021-08-21 11:57:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3960 states have (on average 2.0537878787878787) internal successors, (8133), 3962 states have internal predecessors, (8133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 8133 transitions. [2021-08-21 11:57:34,678 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 8133 transitions. Word has length 88 [2021-08-21 11:57:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:57:34,678 INFO L470 AbstractCegarLoop]: Abstraction has 3963 states and 8133 transitions. [2021-08-21 11:57:34,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 8133 transitions. [2021-08-21 11:57:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:57:34,681 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:57:34,681 INFO L512 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] [2021-08-21 11:57:34,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-08-21 11:57:34,681 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)] === [2021-08-21 11:57:34,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:57:34,681 INFO L82 PathProgramCache]: Analyzing trace with hash 15170517, now seen corresponding path program 75 times [2021-08-21 11:57:34,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:57:34,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953200707] [2021-08-21 11:57:34,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:57:34,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:57:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:57:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:57:35,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:57:35,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953200707] [2021-08-21 11:57:35,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953200707] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:57:35,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:57:35,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:57:35,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98385842] [2021-08-21 11:57:35,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:57:35,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:57:35,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:57:35,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:57:35,734 INFO L87 Difference]: Start difference. First operand 3963 states and 8133 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:57:42,087 INFO L93 Difference]: Finished difference Result 6174 states and 12697 transitions. [2021-08-21 11:57:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-21 11:57:42,087 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:57:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:57:42,093 INFO L225 Difference]: With dead ends: 6174 [2021-08-21 11:57:42,093 INFO L226 Difference]: Without dead ends: 6174 [2021-08-21 11:57:42,093 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 4968.3ms TimeCoverageRelationStatistics Valid=1212, Invalid=5594, Unknown=0, NotChecked=0, Total=6806 [2021-08-21 11:57:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2021-08-21 11:57:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 3965. [2021-08-21 11:57:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3962 states have (on average 2.0537607269056033) internal successors, (8137), 3964 states have internal predecessors, (8137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 8137 transitions. [2021-08-21 11:57:42,134 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 8137 transitions. Word has length 88 [2021-08-21 11:57:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:57:42,134 INFO L470 AbstractCegarLoop]: Abstraction has 3965 states and 8137 transitions. [2021-08-21 11:57:42,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 8137 transitions. [2021-08-21 11:57:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:57:42,137 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:57:42,137 INFO L512 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] [2021-08-21 11:57:42,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-08-21 11:57:42,137 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)] === [2021-08-21 11:57:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:57:42,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1251330581, now seen corresponding path program 76 times [2021-08-21 11:57:42,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:57:42,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482455894] [2021-08-21 11:57:42,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:57:42,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:57:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:57:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:57:43,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:57:43,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482455894] [2021-08-21 11:57:43,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482455894] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:57:43,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:57:43,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:57:43,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984513290] [2021-08-21 11:57:43,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:57:43,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:57:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:57:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:57:43,120 INFO L87 Difference]: Start difference. First operand 3965 states and 8137 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:57:49,028 INFO L93 Difference]: Finished difference Result 5341 states and 10974 transitions. [2021-08-21 11:57:49,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:57:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:57:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:57:49,034 INFO L225 Difference]: With dead ends: 5341 [2021-08-21 11:57:49,034 INFO L226 Difference]: Without dead ends: 5341 [2021-08-21 11:57:49,035 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 4597.2ms TimeCoverageRelationStatistics Valid=1081, Invalid=5081, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:57:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5341 states. [2021-08-21 11:57:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5341 to 3954. [2021-08-21 11:57:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-21 11:57:49,088 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-21 11:57:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:57:49,089 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-21 11:57:49,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-21 11:57:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:57:49,091 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:57:49,091 INFO L512 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] [2021-08-21 11:57:49,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-08-21 11:57:49,092 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)] === [2021-08-21 11:57:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:57:49,092 INFO L82 PathProgramCache]: Analyzing trace with hash -911385165, now seen corresponding path program 77 times [2021-08-21 11:57:49,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:57:49,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721024221] [2021-08-21 11:57:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:57:49,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:57:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:57:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:57:50,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:57:50,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721024221] [2021-08-21 11:57:50,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721024221] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:57:50,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:57:50,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:57:50,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492749879] [2021-08-21 11:57:50,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:57:50,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:57:50,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:57:50,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:57:50,042 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:57:57,076 INFO L93 Difference]: Finished difference Result 5643 states and 11575 transitions. [2021-08-21 11:57:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-08-21 11:57:57,077 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:57:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:57:57,083 INFO L225 Difference]: With dead ends: 5643 [2021-08-21 11:57:57,083 INFO L226 Difference]: Without dead ends: 5643 [2021-08-21 11:57:57,083 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 5693.3ms TimeCoverageRelationStatistics Valid=1381, Invalid=6101, Unknown=0, NotChecked=0, Total=7482 [2021-08-21 11:57:57,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2021-08-21 11:57:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 3966. [2021-08-21 11:57:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 2.053494827151148) internal successors, (8138), 3965 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 8138 transitions. [2021-08-21 11:57:57,127 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 8138 transitions. Word has length 88 [2021-08-21 11:57:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:57:57,127 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 8138 transitions. [2021-08-21 11:57:57,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 8138 transitions. [2021-08-21 11:57:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:57:57,130 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:57:57,130 INFO L512 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] [2021-08-21 11:57:57,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-08-21 11:57:57,130 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)] === [2021-08-21 11:57:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:57:57,131 INFO L82 PathProgramCache]: Analyzing trace with hash 86336509, now seen corresponding path program 78 times [2021-08-21 11:57:57,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:57:57,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353371965] [2021-08-21 11:57:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:57:57,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:57:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:57:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:57:58,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:57:58,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353371965] [2021-08-21 11:57:58,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353371965] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:57:58,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:57:58,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:57:58,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992152647] [2021-08-21 11:57:58,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:57:58,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:57:58,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:57:58,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:57:58,097 INFO L87 Difference]: Start difference. First operand 3966 states and 8138 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:58:04,887 INFO L93 Difference]: Finished difference Result 6032 states and 12398 transitions. [2021-08-21 11:58:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-21 11:58:04,887 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:58:04,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:58:04,894 INFO L225 Difference]: With dead ends: 6032 [2021-08-21 11:58:04,894 INFO L226 Difference]: Without dead ends: 6032 [2021-08-21 11:58:04,895 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 5250.6ms TimeCoverageRelationStatistics Valid=1297, Invalid=5843, Unknown=0, NotChecked=0, Total=7140 [2021-08-21 11:58:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2021-08-21 11:58:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3967. [2021-08-21 11:58:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3967 states, 3964 states have (on average 2.053481331987891) internal successors, (8140), 3966 states have internal predecessors, (8140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3967 states and 8140 transitions. [2021-08-21 11:58:04,946 INFO L78 Accepts]: Start accepts. Automaton has 3967 states and 8140 transitions. Word has length 88 [2021-08-21 11:58:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:58:04,946 INFO L470 AbstractCegarLoop]: Abstraction has 3967 states and 8140 transitions. [2021-08-21 11:58:04,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3967 states and 8140 transitions. [2021-08-21 11:58:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:58:04,949 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:58:04,949 INFO L512 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] [2021-08-21 11:58:04,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-08-21 11:58:04,949 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)] === [2021-08-21 11:58:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:58:04,949 INFO L82 PathProgramCache]: Analyzing trace with hash 757065651, now seen corresponding path program 79 times [2021-08-21 11:58:04,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:58:04,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244849723] [2021-08-21 11:58:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:58:04,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:58:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:58:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:58:06,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:58:06,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244849723] [2021-08-21 11:58:06,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244849723] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:58:06,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:58:06,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:58:06,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820594572] [2021-08-21 11:58:06,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:58:06,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:58:06,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:58:06,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:58:06,050 INFO L87 Difference]: Start difference. First operand 3967 states and 8140 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:58:12,164 INFO L93 Difference]: Finished difference Result 5954 states and 12239 transitions. [2021-08-21 11:58:12,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:58:12,164 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:58:12,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:58:12,171 INFO L225 Difference]: With dead ends: 5954 [2021-08-21 11:58:12,171 INFO L226 Difference]: Without dead ends: 5954 [2021-08-21 11:58:12,171 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 4792.2ms TimeCoverageRelationStatistics Valid=1171, Invalid=5471, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:58:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2021-08-21 11:58:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3969. [2021-08-21 11:58:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3969 states, 3966 states have (on average 2.05345436207766) internal successors, (8144), 3968 states have internal predecessors, (8144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 8144 transitions. [2021-08-21 11:58:12,219 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 8144 transitions. Word has length 88 [2021-08-21 11:58:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:58:12,219 INFO L470 AbstractCegarLoop]: Abstraction has 3969 states and 8144 transitions. [2021-08-21 11:58:12,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 8144 transitions. [2021-08-21 11:58:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:58:12,222 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:58:12,222 INFO L512 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] [2021-08-21 11:58:12,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-08-21 11:58:12,223 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)] === [2021-08-21 11:58:12,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:58:12,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1993225715, now seen corresponding path program 80 times [2021-08-21 11:58:12,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:58:12,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871407996] [2021-08-21 11:58:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:58:12,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:58:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:58:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:58:13,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:58:13,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871407996] [2021-08-21 11:58:13,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871407996] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:58:13,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:58:13,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:58:13,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620295863] [2021-08-21 11:58:13,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:58:13,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:58:13,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:58:13,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:58:13,230 INFO L87 Difference]: Start difference. First operand 3969 states and 8144 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:58:19,207 INFO L93 Difference]: Finished difference Result 5121 states and 10516 transitions. [2021-08-21 11:58:19,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 11:58:19,207 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:58:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:58:19,212 INFO L225 Difference]: With dead ends: 5121 [2021-08-21 11:58:19,212 INFO L226 Difference]: Without dead ends: 5121 [2021-08-21 11:58:19,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 4500.6ms TimeCoverageRelationStatistics Valid=1042, Invalid=4964, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:58:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5121 states. [2021-08-21 11:58:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5121 to 3966. [2021-08-21 11:58:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 2.053494827151148) internal successors, (8138), 3965 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 8138 transitions. [2021-08-21 11:58:19,251 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 8138 transitions. Word has length 88 [2021-08-21 11:58:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:58:19,251 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 8138 transitions. [2021-08-21 11:58:19,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 8138 transitions. [2021-08-21 11:58:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:58:19,254 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:58:19,254 INFO L512 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] [2021-08-21 11:58:19,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-08-21 11:58:19,254 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)] === [2021-08-21 11:58:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:58:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash 65500127, now seen corresponding path program 81 times [2021-08-21 11:58:19,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:58:19,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337388435] [2021-08-21 11:58:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:58:19,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:58:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:58:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:58:20,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:58:20,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337388435] [2021-08-21 11:58:20,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337388435] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:58:20,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:58:20,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:58:20,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634890072] [2021-08-21 11:58:20,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:58:20,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:58:20,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:58:20,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:58:20,249 INFO L87 Difference]: Start difference. First operand 3966 states and 8138 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:58:26,680 INFO L93 Difference]: Finished difference Result 6430 states and 13244 transitions. [2021-08-21 11:58:26,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-21 11:58:26,680 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:58:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:58:26,687 INFO L225 Difference]: With dead ends: 6430 [2021-08-21 11:58:26,687 INFO L226 Difference]: Without dead ends: 6430 [2021-08-21 11:58:26,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 5003.2ms TimeCoverageRelationStatistics Valid=1220, Invalid=5586, Unknown=0, NotChecked=0, Total=6806 [2021-08-21 11:58:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6430 states. [2021-08-21 11:58:26,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6430 to 3993. [2021-08-21 11:58:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 3990 states have (on average 2.0538847117794488) internal successors, (8195), 3992 states have internal predecessors, (8195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 8195 transitions. [2021-08-21 11:58:26,731 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 8195 transitions. Word has length 88 [2021-08-21 11:58:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:58:26,732 INFO L470 AbstractCegarLoop]: Abstraction has 3993 states and 8195 transitions. [2021-08-21 11:58:26,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 8195 transitions. [2021-08-21 11:58:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:58:26,734 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:58:26,734 INFO L512 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] [2021-08-21 11:58:26,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-08-21 11:58:26,734 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)] === [2021-08-21 11:58:26,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:58:26,735 INFO L82 PathProgramCache]: Analyzing trace with hash -448013291, now seen corresponding path program 82 times [2021-08-21 11:58:26,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:58:26,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958940770] [2021-08-21 11:58:26,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:58:26,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:58:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:58:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:58:27,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:58:27,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958940770] [2021-08-21 11:58:27,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958940770] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:58:27,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:58:27,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:58:27,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316178190] [2021-08-21 11:58:27,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:58:27,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:58:27,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:58:27,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:58:27,721 INFO L87 Difference]: Start difference. First operand 3993 states and 8195 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:58:33,727 INFO L93 Difference]: Finished difference Result 5708 states and 11743 transitions. [2021-08-21 11:58:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 11:58:33,728 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:58:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:58:33,733 INFO L225 Difference]: With dead ends: 5708 [2021-08-21 11:58:33,734 INFO L226 Difference]: Without dead ends: 5708 [2021-08-21 11:58:33,734 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 4602.5ms TimeCoverageRelationStatistics Valid=1087, Invalid=5075, Unknown=0, NotChecked=0, Total=6162 [2021-08-21 11:58:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5708 states. [2021-08-21 11:58:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5708 to 3991. [2021-08-21 11:58:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3991 states, 3988 states have (on average 2.0539117352056167) internal successors, (8191), 3990 states have internal predecessors, (8191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3991 states and 8191 transitions. [2021-08-21 11:58:33,777 INFO L78 Accepts]: Start accepts. Automaton has 3991 states and 8191 transitions. Word has length 88 [2021-08-21 11:58:33,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:58:33,777 INFO L470 AbstractCegarLoop]: Abstraction has 3991 states and 8191 transitions. [2021-08-21 11:58:33,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3991 states and 8191 transitions. [2021-08-21 11:58:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:58:33,779 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:58:33,780 INFO L512 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] [2021-08-21 11:58:33,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-08-21 11:58:33,780 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)] === [2021-08-21 11:58:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:58:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1086215579, now seen corresponding path program 83 times [2021-08-21 11:58:33,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:58:33,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896981268] [2021-08-21 11:58:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:58:33,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:58:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:58:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:58:34,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:58:34,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896981268] [2021-08-21 11:58:34,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896981268] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:58:34,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:58:34,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 11:58:34,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946905448] [2021-08-21 11:58:34,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 11:58:34,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:58:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 11:58:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 11:58:34,767 INFO L87 Difference]: Start difference. First operand 3991 states and 8191 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:58:40,841 INFO L93 Difference]: Finished difference Result 5612 states and 11551 transitions. [2021-08-21 11:58:40,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:58:40,842 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-21 11:58:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:58:40,847 INFO L225 Difference]: With dead ends: 5612 [2021-08-21 11:58:40,847 INFO L226 Difference]: Without dead ends: 5612 [2021-08-21 11:58:40,848 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 4748.3ms TimeCoverageRelationStatistics Valid=1131, Invalid=5189, Unknown=0, NotChecked=0, Total=6320 [2021-08-21 11:58:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2021-08-21 11:58:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 3975. [2021-08-21 11:58:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3972 states have (on average 2.0536253776435047) internal successors, (8157), 3974 states have internal predecessors, (8157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 8157 transitions. [2021-08-21 11:58:40,892 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 8157 transitions. Word has length 88 [2021-08-21 11:58:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:58:40,893 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 8157 transitions. [2021-08-21 11:58:40,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:58:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 8157 transitions. [2021-08-21 11:58:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-21 11:58:40,896 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:58:40,896 INFO L512 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] [2021-08-21 11:58:40,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-08-21 11:58:40,896 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)] === [2021-08-21 11:58:40,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:58:40,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1328989251, now seen corresponding path program 84 times [2021-08-21 11:58:40,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:58:40,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679445479] [2021-08-21 11:58:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:58:40,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:58:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:58:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:58:41,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:58:41,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679445479] [2021-08-21 11:58:41,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679445479] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:58:41,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:58:41,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 11:58:41,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190876855] [2021-08-21 11:58:41,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 11:58:41,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:58:41,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 11:58:41,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 11:58:41,896 INFO L87 Difference]: Start difference. First operand 3975 states and 8157 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2021-08-21 11:58:42,346 WARN L223 SmtUtils]: Removed 11 from assertion stack [2021-08-21 11:58:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 11:58:42,347 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:58:42,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-08-21 11:58:42,347 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (3975states) and FLOYD_HOARE automaton (currently 10 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 50 for 13ms.. [2021-08-21 11:58:42,348 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:58:42,349 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:58:42,349 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:58:42,349 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 11:58:42,349 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:58:42,349 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:58:42,353 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 11:58:42,353 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 11:58:42,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 11:58:42 BasicIcfg [2021-08-21 11:58:42,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 11:58:42,355 INFO L168 Benchmark]: Toolchain (without parser) took 728442.14 ms. Allocated memory was 194.0 MB in the beginning and 729.8 MB in the end (delta: 535.8 MB). Free memory was 157.4 MB in the beginning and 541.7 MB in the end (delta: -384.2 MB). Peak memory consumption was 153.2 MB. Max. memory is 8.0 GB. [2021-08-21 11:58:42,355 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 194.0 MB. Free memory is still 175.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 11:58:42,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.28 ms. Allocated memory is still 194.0 MB. Free memory was 157.2 MB in the beginning and 162.5 MB in the end (delta: -5.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-08-21 11:58:42,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.20 ms. Allocated memory is still 194.0 MB. Free memory was 162.5 MB in the beginning and 159.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:58:42,356 INFO L168 Benchmark]: Boogie Preprocessor took 32.99 ms. Allocated memory is still 194.0 MB. Free memory was 159.9 MB in the beginning and 158.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:58:42,356 INFO L168 Benchmark]: RCFGBuilder took 422.77 ms. Allocated memory is still 194.0 MB. Free memory was 158.3 MB in the beginning and 126.3 MB in the end (delta: 32.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. [2021-08-21 11:58:42,356 INFO L168 Benchmark]: TraceAbstraction took 727483.28 ms. Allocated memory was 194.0 MB in the beginning and 729.8 MB in the end (delta: 535.8 MB). Free memory was 125.8 MB in the beginning and 541.7 MB in the end (delta: -415.9 MB). Peak memory consumption was 121.0 MB. Max. memory is 8.0 GB. [2021-08-21 11:58:42,357 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.12 ms. Allocated memory is still 194.0 MB. Free memory is still 175.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 439.28 ms. Allocated memory is still 194.0 MB. Free memory was 157.2 MB in the beginning and 162.5 MB in the end (delta: -5.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 58.20 ms. Allocated memory is still 194.0 MB. Free memory was 162.5 MB in the beginning and 159.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.99 ms. Allocated memory is still 194.0 MB. Free memory was 159.9 MB in the beginning and 158.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 422.77 ms. Allocated memory is still 194.0 MB. Free memory was 158.3 MB in the beginning and 126.3 MB in the end (delta: 32.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 727483.28 ms. Allocated memory was 194.0 MB in the beginning and 729.8 MB in the end (delta: 535.8 MB). Free memory was 125.8 MB in the beginning and 541.7 MB in the end (delta: -415.9 MB). Peak memory consumption was 121.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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 (3975states) and FLOYD_HOARE automaton (currently 10 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 50 for 13ms.. - TimeoutResultAtElement [Line: 836]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (3975states) and FLOYD_HOARE automaton (currently 10 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 50 for 13ms.. - TimeoutResultAtElement [Line: 837]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (3975states) and FLOYD_HOARE automaton (currently 10 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 50 for 13ms.. - 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 (3975states) and FLOYD_HOARE automaton (currently 10 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 50 for 13ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 198 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 727341.9ms, OverallIterations: 97, TraceHistogramMax: 1, EmptinessCheckTime: 298.9ms, AutomataDifference: 627945.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 80.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 45379 SDtfs, 153547 SDslu, 760037 SDs, 0 SdLazy, 348447 SolverSat, 4121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 135645.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8139 GetRequests, 389 SyntacticMatches, 165 SemanticMatches, 7584 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108461 ImplicationChecksByTransitivity, 502909.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3993occurred in iteration=94, InterpolantAutomatonStates: 4857, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 4516.6ms AutomataMinimizationTime, 96 MinimizatonAttempts, 177525 StatesRemovedByMinimization, 95 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 136.8ms SsaConstructionTime, 901.1ms SatisfiabilityAnalysisTime, 92764.0ms InterpolantComputationTime, 8378 NumberOfCodeBlocks, 8378 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 8281 ConstructedInterpolants, 0 QuantifiedInterpolants, 148576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 97 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