/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_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 16:28:52,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 16:28:52,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 16:28:52,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 16:28:52,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 16:28:52,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 16:28:52,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 16:28:52,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 16:28:52,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 16:28:52,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 16:28:52,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 16:28:52,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 16:28:52,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 16:28:52,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 16:28:52,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 16:28:52,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 16:28:52,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 16:28:52,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 16:28:52,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 16:28:52,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 16:28:52,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 16:28:52,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 16:28:52,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 16:28:52,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 16:28:52,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 16:28:52,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 16:28:52,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 16:28:52,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 16:28:52,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 16:28:52,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 16:28:52,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 16:28:52,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 16:28:52,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 16:28:52,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 16:28:52,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 16:28:52,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 16:28:52,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 16:28:52,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 16:28:52,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 16:28:52,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 16:28:52,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 16:28:52,636 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-03 16:28:52,665 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 16:28:52,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 16:28:52,666 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 16:28:52,666 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 16:28:52,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 16:28:52,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 16:28:52,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 16:28:52,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 16:28:52,667 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 16:28:52,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 16:28:52,668 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 16:28:52,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 16:28:52,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 16:28:52,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 16:28:52,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 16:28:52,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 16:28:52,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 16:28:52,668 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 16:28:52,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 16:28:52,669 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 16:28:52,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 16:28:52,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 16:28:52,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 16:28:52,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 16:28:52,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 16:28:52,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 16:28:52,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 16:28:52,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 16:28:52,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 16:28:52,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 16:28:52,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 16:28:52,670 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 16:28:52,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 16:28:52,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-03 16:28:52,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 16:28:52,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 16:28:52,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 16:28:52,868 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 16:28:52,869 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 16:28:52,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-03-03 16:28:52,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b9b30fd/24cd7c06c0364f1896f8cc344c553958/FLAGfd592a503 [2022-03-03 16:28:53,388 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 16:28:53,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-03-03 16:28:53,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b9b30fd/24cd7c06c0364f1896f8cc344c553958/FLAGfd592a503 [2022-03-03 16:28:53,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b9b30fd/24cd7c06c0364f1896f8cc344c553958 [2022-03-03 16:28:53,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 16:28:53,418 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 16:28:53,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 16:28:53,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 16:28:53,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 16:28:53,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:53,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5db2642c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53, skipping insertion in model container [2022-03-03 16:28:53,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:53,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 16:28:53,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 16:28:53,620 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-03 16:28:53,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-03-03 16:28:53,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-03-03 16:28:53,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-03-03 16:28:53,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-03-03 16:28:53,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-03-03 16:28:53,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-03-03 16:28:53,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-03-03 16:28:53,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 16:28:53,868 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 16:28:53,884 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-03 16:28:53,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-03-03 16:28:53,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-03-03 16:28:53,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-03-03 16:28:53,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-03-03 16:28:53,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-03-03 16:28:53,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-03-03 16:28:53,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-03-03 16:28:53,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 16:28:53,966 INFO L208 MainTranslator]: Completed translation [2022-03-03 16:28:53,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53 WrapperNode [2022-03-03 16:28:53,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 16:28:53,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 16:28:53,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 16:28:53,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 16:28:53,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:53,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:54,025 INFO L137 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2022-03-03 16:28:54,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 16:28:54,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 16:28:54,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 16:28:54,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 16:28:54,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:54,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:54,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:54,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:54,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:54,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:54,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:54,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 16:28:54,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 16:28:54,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 16:28:54,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 16:28:54,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53" (1/1) ... [2022-03-03 16:28:54,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 16:28:54,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:28:54,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-03 16:28:54,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-03 16:28:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-03-03 16:28:54,179 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-03-03 16:28:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-03-03 16:28:54,179 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-03-03 16:28:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 16:28:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 16:28:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 16:28:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 16:28:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-03 16:28:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 16:28:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 16:28:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 16:28:54,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 16:28:54,181 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 16:28:54,330 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 16:28:54,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 16:28:54,567 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 16:28:54,573 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 16:28:54,574 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-03 16:28:54,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 04:28:54 BoogieIcfgContainer [2022-03-03 16:28:54,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 16:28:54,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 16:28:54,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 16:28:54,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 16:28:54,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:28:53" (1/3) ... [2022-03-03 16:28:54,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d37a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:28:54, skipping insertion in model container [2022-03-03 16:28:54,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:53" (2/3) ... [2022-03-03 16:28:54,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d37a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:28:54, skipping insertion in model container [2022-03-03 16:28:54,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 04:28:54" (3/3) ... [2022-03-03 16:28:54,584 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-03-03 16:28:54,587 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 16:28:54,587 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 16:28:54,588 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-03-03 16:28:54,588 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 16:28:54,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,663 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,664 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,666 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,671 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,671 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,671 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,671 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,671 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,671 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,674 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,674 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,674 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,674 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,674 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,674 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,674 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,675 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,675 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,675 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,675 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,675 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,675 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,676 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,677 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,678 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,678 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,681 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,681 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,689 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,689 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,689 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,690 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,690 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,690 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,690 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,690 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,691 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,691 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,691 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,691 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,691 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,691 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,691 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,691 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,692 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,692 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,694 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,695 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,697 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,697 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,697 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,698 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,698 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,698 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,698 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,699 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,699 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,699 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,699 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,699 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,700 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,700 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,704 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,704 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,704 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,704 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,706 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,706 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,706 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,706 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,706 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,706 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,706 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,706 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,706 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,706 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,707 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,707 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,707 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,707 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,707 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,707 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,707 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,708 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,708 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,708 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,708 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,708 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,708 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,708 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,708 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,708 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,709 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,709 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,709 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,709 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,709 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,709 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,709 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,709 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,710 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,710 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,710 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,710 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,710 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,710 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,710 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,710 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,710 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,710 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,710 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,711 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,711 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,711 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,711 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,711 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,712 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,714 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,714 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,714 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,714 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,714 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,714 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,714 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,720 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,721 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,721 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,721 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,721 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,721 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,721 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,721 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,721 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,721 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,721 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,721 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,722 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,722 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,722 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,722 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,722 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,722 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,722 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,722 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,722 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,722 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,723 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,724 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,725 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,725 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,725 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,725 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,725 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,725 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,725 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,725 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,725 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,725 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,726 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,726 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,726 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,726 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,726 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,726 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,726 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,726 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,727 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,727 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,727 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,727 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,728 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,728 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,728 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,728 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,728 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,728 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,728 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,728 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,728 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,728 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,728 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,729 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,729 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,730 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,730 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,730 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,730 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,730 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,730 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,730 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,731 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,732 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,732 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,732 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,732 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,732 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,732 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,733 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,733 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,733 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,733 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,733 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,733 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,733 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,733 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,733 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,733 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,734 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,734 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,736 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,736 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,738 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,739 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,739 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,739 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,739 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,739 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,739 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,739 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,739 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,740 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,740 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,740 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,740 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,740 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,740 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,740 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,740 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:54,749 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-03 16:28:54,783 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 16:28:54,788 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 16:28:54,788 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-03-03 16:28:54,799 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 223 places, 233 transitions, 482 flow [2022-03-03 16:28:57,237 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-03 16:28:57,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:28:57,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:28:57,746 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:28:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:28:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash 508547485, now seen corresponding path program 1 times [2022-03-03 16:28:57,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:28:57,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196775783] [2022-03-03 16:28:57,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:28:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:28:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:28:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:28:58,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:28:58,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196775783] [2022-03-03 16:28:58,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196775783] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:28:58,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:28:58,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-03 16:28:58,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122851224] [2022-03-03 16:28:58,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:28:58,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-03 16:28:58,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:28:58,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-03 16:28:58,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-03-03 16:28:58,600 INFO L87 Difference]: Start difference. First operand has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 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 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:01,554 INFO L93 Difference]: Finished difference Result 119975 states and 368792 transitions. [2022-03-03 16:29:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-03 16:29:01,556 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-03-03 16:29:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:02,334 INFO L225 Difference]: With dead ends: 119975 [2022-03-03 16:29:02,334 INFO L226 Difference]: Without dead ends: 119915 [2022-03-03 16:29:02,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=436, Invalid=1204, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 16:29:02,337 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 1275 mSDsluCounter, 3807 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:02,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1275 Valid, 4245 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 16:29:02,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119915 states. [2022-03-03 16:29:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119915 to 113165. [2022-03-03 16:29:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113165 states, 113161 states have (on average 3.076077447177031) internal successors, (348092), 113164 states have internal predecessors, (348092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113165 states to 113165 states and 348092 transitions. [2022-03-03 16:29:06,360 INFO L78 Accepts]: Start accepts. Automaton has 113165 states and 348092 transitions. Word has length 90 [2022-03-03 16:29:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:06,364 INFO L470 AbstractCegarLoop]: Abstraction has 113165 states and 348092 transitions. [2022-03-03 16:29:06,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 113165 states and 348092 transitions. [2022-03-03 16:29:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-03-03 16:29:06,469 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:06,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:29:06,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 16:29:06,470 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:29:06,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:06,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1144672626, now seen corresponding path program 1 times [2022-03-03 16:29:06,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:06,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481033819] [2022-03-03 16:29:06,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:06,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:06,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:06,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481033819] [2022-03-03 16:29:06,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481033819] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:06,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:06,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-03 16:29:06,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340852063] [2022-03-03 16:29:06,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:06,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-03 16:29:06,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:06,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-03 16:29:06,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-03-03 16:29:06,873 INFO L87 Difference]: Start difference. First operand 113165 states and 348092 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:10,011 INFO L93 Difference]: Finished difference Result 155725 states and 478789 transitions. [2022-03-03 16:29:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-03 16:29:10,012 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-03-03 16:29:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:10,685 INFO L225 Difference]: With dead ends: 155725 [2022-03-03 16:29:10,686 INFO L226 Difference]: Without dead ends: 154885 [2022-03-03 16:29:10,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=389, Invalid=1093, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 16:29:10,688 INFO L933 BasicCegarLoop]: 638 mSDtfsCounter, 2395 mSDsluCounter, 4890 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 5528 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:10,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2395 Valid, 5528 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 16:29:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154885 states. [2022-03-03 16:29:14,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154885 to 132244. [2022-03-03 16:29:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132244 states, 132240 states have (on average 3.0773744706594073) internal successors, (406952), 132243 states have internal predecessors, (406952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132244 states to 132244 states and 406952 transitions. [2022-03-03 16:29:15,383 INFO L78 Accepts]: Start accepts. Automaton has 132244 states and 406952 transitions. Word has length 95 [2022-03-03 16:29:15,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:15,384 INFO L470 AbstractCegarLoop]: Abstraction has 132244 states and 406952 transitions. [2022-03-03 16:29:15,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 132244 states and 406952 transitions. [2022-03-03 16:29:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:29:15,505 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:15,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:29:15,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 16:29:15,506 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:29:15,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:15,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1175061358, now seen corresponding path program 1 times [2022-03-03 16:29:15,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:15,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701293071] [2022-03-03 16:29:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:16,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:16,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701293071] [2022-03-03 16:29:16,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701293071] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:16,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:16,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:29:16,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640971587] [2022-03-03 16:29:16,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:16,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:29:16,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:16,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:29:16,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:29:16,256 INFO L87 Difference]: Start difference. First operand 132244 states and 406952 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:23,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:23,180 INFO L93 Difference]: Finished difference Result 156625 states and 481546 transitions. [2022-03-03 16:29:23,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 16:29:23,180 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:29:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:23,979 INFO L225 Difference]: With dead ends: 156625 [2022-03-03 16:29:23,980 INFO L226 Difference]: Without dead ends: 156625 [2022-03-03 16:29:23,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1568, Invalid=4284, Unknown=0, NotChecked=0, Total=5852 [2022-03-03 16:29:23,983 INFO L933 BasicCegarLoop]: 1139 mSDtfsCounter, 3939 mSDsluCounter, 7701 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3939 SdHoareTripleChecker+Valid, 8840 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:23,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3939 Valid, 8840 Invalid, 2619 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [83 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:29:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156625 states. [2022-03-03 16:29:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156625 to 133003. [2022-03-03 16:29:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133003 states, 132999 states have (on average 3.0775494552590623) internal successors, (409311), 133002 states have internal predecessors, (409311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133003 states to 133003 states and 409311 transitions. [2022-03-03 16:29:28,526 INFO L78 Accepts]: Start accepts. Automaton has 133003 states and 409311 transitions. Word has length 114 [2022-03-03 16:29:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:28,527 INFO L470 AbstractCegarLoop]: Abstraction has 133003 states and 409311 transitions. [2022-03-03 16:29:28,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 133003 states and 409311 transitions. [2022-03-03 16:29:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:29:28,694 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:28,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:29:28,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 16:29:28,694 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:29:28,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash 788572584, now seen corresponding path program 2 times [2022-03-03 16:29:28,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:28,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506139545] [2022-03-03 16:29:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:29,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:29,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506139545] [2022-03-03 16:29:29,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506139545] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:29,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:29,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:29:29,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577670451] [2022-03-03 16:29:29,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:29,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:29:29,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:29,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:29:29,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:29:29,327 INFO L87 Difference]: Start difference. First operand 133003 states and 409311 transitions. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:35,512 INFO L93 Difference]: Finished difference Result 166429 states and 511686 transitions. [2022-03-03 16:29:35,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-03 16:29:35,513 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:29:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:36,380 INFO L225 Difference]: With dead ends: 166429 [2022-03-03 16:29:36,380 INFO L226 Difference]: Without dead ends: 166429 [2022-03-03 16:29:36,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1293, Invalid=3129, Unknown=0, NotChecked=0, Total=4422 [2022-03-03 16:29:36,382 INFO L933 BasicCegarLoop]: 1055 mSDtfsCounter, 3226 mSDsluCounter, 7751 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3226 SdHoareTripleChecker+Valid, 8806 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:36,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3226 Valid, 8806 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 16:29:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166429 states. [2022-03-03 16:29:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166429 to 135742. [2022-03-03 16:29:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135742 states, 135738 states have (on average 3.077465411307077) internal successors, (417729), 135741 states have internal predecessors, (417729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135742 states to 135742 states and 417729 transitions. [2022-03-03 16:29:40,462 INFO L78 Accepts]: Start accepts. Automaton has 135742 states and 417729 transitions. Word has length 114 [2022-03-03 16:29:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:40,475 INFO L470 AbstractCegarLoop]: Abstraction has 135742 states and 417729 transitions. [2022-03-03 16:29:40,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 135742 states and 417729 transitions. [2022-03-03 16:29:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:29:40,594 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:40,594 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:29:40,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 16:29:40,595 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:29:40,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:40,595 INFO L85 PathProgramCache]: Analyzing trace with hash 124783814, now seen corresponding path program 3 times [2022-03-03 16:29:40,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:40,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933017267] [2022-03-03 16:29:40,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:40,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:41,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:41,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933017267] [2022-03-03 16:29:41,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933017267] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:41,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:41,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:29:41,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043224815] [2022-03-03 16:29:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:41,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:29:41,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:41,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:29:41,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:29:41,359 INFO L87 Difference]: Start difference. First operand 135742 states and 417729 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:50,505 INFO L93 Difference]: Finished difference Result 178621 states and 549053 transitions. [2022-03-03 16:29:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-03 16:29:50,511 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:29:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:51,257 INFO L225 Difference]: With dead ends: 178621 [2022-03-03 16:29:51,258 INFO L226 Difference]: Without dead ends: 178621 [2022-03-03 16:29:51,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1794, Invalid=5012, Unknown=0, NotChecked=0, Total=6806 [2022-03-03 16:29:51,259 INFO L933 BasicCegarLoop]: 1205 mSDtfsCounter, 4231 mSDsluCounter, 9352 mSDsCounter, 0 mSdLazyCounter, 3232 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4231 SdHoareTripleChecker+Valid, 10557 SdHoareTripleChecker+Invalid, 3330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:51,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4231 Valid, 10557 Invalid, 3330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3232 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-03 16:29:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178621 states. [2022-03-03 16:29:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178621 to 136501. [2022-03-03 16:29:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136501 states, 136497 states have (on average 3.077635405906357) internal successors, (420088), 136500 states have internal predecessors, (420088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136501 states to 136501 states and 420088 transitions. [2022-03-03 16:29:56,232 INFO L78 Accepts]: Start accepts. Automaton has 136501 states and 420088 transitions. Word has length 114 [2022-03-03 16:29:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:56,233 INFO L470 AbstractCegarLoop]: Abstraction has 136501 states and 420088 transitions. [2022-03-03 16:29:56,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 136501 states and 420088 transitions. [2022-03-03 16:29:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:29:56,366 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:56,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:29:56,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 16:29:56,366 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:29:56,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:56,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2145687926, now seen corresponding path program 4 times [2022-03-03 16:29:56,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:56,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088112025] [2022-03-03 16:29:56,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:56,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:57,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:57,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088112025] [2022-03-03 16:29:57,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088112025] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:57,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:57,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:29:57,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709743587] [2022-03-03 16:29:57,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:57,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:29:57,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:57,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:29:57,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:29:57,310 INFO L87 Difference]: Start difference. First operand 136501 states and 420088 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:05,942 INFO L93 Difference]: Finished difference Result 178486 states and 548701 transitions. [2022-03-03 16:30:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-03 16:30:05,943 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:30:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:06,515 INFO L225 Difference]: With dead ends: 178486 [2022-03-03 16:30:06,516 INFO L226 Difference]: Without dead ends: 178486 [2022-03-03 16:30:06,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1921, Invalid=5389, Unknown=0, NotChecked=0, Total=7310 [2022-03-03 16:30:06,518 INFO L933 BasicCegarLoop]: 1266 mSDtfsCounter, 3659 mSDsluCounter, 11889 mSDsCounter, 0 mSdLazyCounter, 4124 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3659 SdHoareTripleChecker+Valid, 13155 SdHoareTripleChecker+Invalid, 4208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 4124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:06,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3659 Valid, 13155 Invalid, 4208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 4124 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-03 16:30:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178486 states. [2022-03-03 16:30:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178486 to 136699. [2022-03-03 16:30:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136699 states, 136695 states have (on average 3.0777570503676066) internal successors, (420714), 136698 states have internal predecessors, (420714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136699 states to 136699 states and 420714 transitions. [2022-03-03 16:30:10,727 INFO L78 Accepts]: Start accepts. Automaton has 136699 states and 420714 transitions. Word has length 114 [2022-03-03 16:30:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:30:10,727 INFO L470 AbstractCegarLoop]: Abstraction has 136699 states and 420714 transitions. [2022-03-03 16:30:10,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 136699 states and 420714 transitions. [2022-03-03 16:30:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:30:10,861 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:30:10,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:30:10,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-03 16:30:10,861 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:30:10,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:30:10,862 INFO L85 PathProgramCache]: Analyzing trace with hash 793775866, now seen corresponding path program 5 times [2022-03-03 16:30:10,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:30:10,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441609614] [2022-03-03 16:30:10,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:30:10,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:30:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:30:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:30:11,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:30:11,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441609614] [2022-03-03 16:30:11,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441609614] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:30:11,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:30:11,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:30:11,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410697257] [2022-03-03 16:30:11,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:30:11,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:30:11,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:30:11,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:30:11,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:30:11,857 INFO L87 Difference]: Start difference. First operand 136699 states and 420714 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:21,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:21,382 INFO L93 Difference]: Finished difference Result 177595 states and 545975 transitions. [2022-03-03 16:30:21,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-03 16:30:21,382 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:30:21,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:22,069 INFO L225 Difference]: With dead ends: 177595 [2022-03-03 16:30:22,069 INFO L226 Difference]: Without dead ends: 177595 [2022-03-03 16:30:22,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2184, Invalid=6188, Unknown=0, NotChecked=0, Total=8372 [2022-03-03 16:30:22,073 INFO L933 BasicCegarLoop]: 1390 mSDtfsCounter, 3404 mSDsluCounter, 13145 mSDsCounter, 0 mSdLazyCounter, 4634 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3404 SdHoareTripleChecker+Valid, 14535 SdHoareTripleChecker+Invalid, 4714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:22,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3404 Valid, 14535 Invalid, 4714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4634 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-03 16:30:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177595 states. [2022-03-03 16:30:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177595 to 137062. [2022-03-03 16:30:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137062 states, 137058 states have (on average 3.077872141721023) internal successors, (421847), 137061 states have internal predecessors, (421847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137062 states to 137062 states and 421847 transitions. [2022-03-03 16:30:26,515 INFO L78 Accepts]: Start accepts. Automaton has 137062 states and 421847 transitions. Word has length 114 [2022-03-03 16:30:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:30:26,515 INFO L470 AbstractCegarLoop]: Abstraction has 137062 states and 421847 transitions. [2022-03-03 16:30:26,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 137062 states and 421847 transitions. [2022-03-03 16:30:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:30:26,660 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:30:26,660 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:30:26,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-03 16:30:26,661 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:30:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:30:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash -767686718, now seen corresponding path program 6 times [2022-03-03 16:30:26,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:30:26,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389100198] [2022-03-03 16:30:26,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:30:26,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:30:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:30:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:30:27,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:30:27,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389100198] [2022-03-03 16:30:27,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389100198] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:30:27,323 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:30:27,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:30:27,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775296785] [2022-03-03 16:30:27,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:30:27,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:30:27,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:30:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:30:27,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:30:27,325 INFO L87 Difference]: Start difference. First operand 137062 states and 421847 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:37,426 INFO L93 Difference]: Finished difference Result 176737 states and 543243 transitions. [2022-03-03 16:30:37,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-03-03 16:30:37,427 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:30:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:37,920 INFO L225 Difference]: With dead ends: 176737 [2022-03-03 16:30:37,920 INFO L226 Difference]: Without dead ends: 176737 [2022-03-03 16:30:37,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2492, Invalid=7014, Unknown=0, NotChecked=0, Total=9506 [2022-03-03 16:30:37,923 INFO L933 BasicCegarLoop]: 1496 mSDtfsCounter, 3351 mSDsluCounter, 14035 mSDsCounter, 0 mSdLazyCounter, 4966 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3351 SdHoareTripleChecker+Valid, 15531 SdHoareTripleChecker+Invalid, 5053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 4966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:37,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3351 Valid, 15531 Invalid, 5053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 4966 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-03 16:30:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176737 states. [2022-03-03 16:30:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176737 to 137095. [2022-03-03 16:30:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137095 states, 137091 states have (on average 3.077860691073812) internal successors, (421947), 137094 states have internal predecessors, (421947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137095 states to 137095 states and 421947 transitions. [2022-03-03 16:30:42,954 INFO L78 Accepts]: Start accepts. Automaton has 137095 states and 421947 transitions. Word has length 114 [2022-03-03 16:30:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:30:42,956 INFO L470 AbstractCegarLoop]: Abstraction has 137095 states and 421947 transitions. [2022-03-03 16:30:42,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 137095 states and 421947 transitions. [2022-03-03 16:30:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:30:43,096 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:30:43,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:30:43,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-03 16:30:43,097 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:30:43,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:30:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1979149546, now seen corresponding path program 7 times [2022-03-03 16:30:43,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:30:43,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062583076] [2022-03-03 16:30:43,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:30:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:30:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:30:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:30:45,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:30:45,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062583076] [2022-03-03 16:30:45,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062583076] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:30:45,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:30:45,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:30:45,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742402446] [2022-03-03 16:30:45,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:30:45,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:30:45,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:30:45,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:30:45,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:30:45,025 INFO L87 Difference]: Start difference. First operand 137095 states and 421947 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:55,952 INFO L93 Difference]: Finished difference Result 168406 states and 517694 transitions. [2022-03-03 16:30:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-03 16:30:55,953 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:30:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:56,648 INFO L225 Difference]: With dead ends: 168406 [2022-03-03 16:30:56,648 INFO L226 Difference]: Without dead ends: 168406 [2022-03-03 16:30:56,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2323, Invalid=5687, Unknown=0, NotChecked=0, Total=8010 [2022-03-03 16:30:56,651 INFO L933 BasicCegarLoop]: 1500 mSDtfsCounter, 3033 mSDsluCounter, 11199 mSDsCounter, 0 mSdLazyCounter, 3883 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 12699 SdHoareTripleChecker+Invalid, 3977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:56,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3033 Valid, 12699 Invalid, 3977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3883 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-03 16:30:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168406 states. [2022-03-03 16:31:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168406 to 142999. [2022-03-03 16:31:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142999 states, 142995 states have (on average 3.0793943844190355) internal successors, (440338), 142998 states have internal predecessors, (440338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142999 states to 142999 states and 440338 transitions. [2022-03-03 16:31:00,882 INFO L78 Accepts]: Start accepts. Automaton has 142999 states and 440338 transitions. Word has length 114 [2022-03-03 16:31:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:00,882 INFO L470 AbstractCegarLoop]: Abstraction has 142999 states and 440338 transitions. [2022-03-03 16:31:00,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:00,883 INFO L276 IsEmpty]: Start isEmpty. Operand 142999 states and 440338 transitions. [2022-03-03 16:31:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:31:01,483 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:01,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:31:01,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-03 16:31:01,484 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:31:01,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:01,484 INFO L85 PathProgramCache]: Analyzing trace with hash -386091310, now seen corresponding path program 8 times [2022-03-03 16:31:01,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:01,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036691836] [2022-03-03 16:31:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:01,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:31:02,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:02,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036691836] [2022-03-03 16:31:02,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036691836] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:02,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:02,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:31:02,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763904840] [2022-03-03 16:31:02,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:02,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:31:02,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:31:02,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:31:02,240 INFO L87 Difference]: Start difference. First operand 142999 states and 440338 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:09,188 INFO L93 Difference]: Finished difference Result 187159 states and 575304 transitions. [2022-03-03 16:31:09,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-03 16:31:09,189 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:31:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:09,866 INFO L225 Difference]: With dead ends: 187159 [2022-03-03 16:31:09,867 INFO L226 Difference]: Without dead ends: 187159 [2022-03-03 16:31:09,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:31:09,868 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 3419 mSDsluCounter, 9889 mSDsCounter, 0 mSdLazyCounter, 3421 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3419 SdHoareTripleChecker+Valid, 11024 SdHoareTripleChecker+Invalid, 3490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:09,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3419 Valid, 11024 Invalid, 3490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3421 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:31:10,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187159 states. [2022-03-03 16:31:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187159 to 144220. [2022-03-03 16:31:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144220 states, 144216 states have (on average 3.079387862650469) internal successors, (444097), 144219 states have internal predecessors, (444097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144220 states to 144220 states and 444097 transitions. [2022-03-03 16:31:14,372 INFO L78 Accepts]: Start accepts. Automaton has 144220 states and 444097 transitions. Word has length 114 [2022-03-03 16:31:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:14,373 INFO L470 AbstractCegarLoop]: Abstraction has 144220 states and 444097 transitions. [2022-03-03 16:31:14,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 144220 states and 444097 transitions. [2022-03-03 16:31:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:31:14,521 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:14,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:31:14,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-03 16:31:14,521 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:31:14,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1049880080, now seen corresponding path program 9 times [2022-03-03 16:31:14,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:14,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568212494] [2022-03-03 16:31:14,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:14,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:31:15,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:15,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568212494] [2022-03-03 16:31:15,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568212494] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:15,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:15,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:31:15,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76383262] [2022-03-03 16:31:15,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:15,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:31:15,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:31:15,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:31:15,216 INFO L87 Difference]: Start difference. First operand 144220 states and 444097 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:23,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:23,229 INFO L93 Difference]: Finished difference Result 197656 states and 607643 transitions. [2022-03-03 16:31:23,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-03 16:31:23,230 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:31:23,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:23,797 INFO L225 Difference]: With dead ends: 197656 [2022-03-03 16:31:23,797 INFO L226 Difference]: Without dead ends: 197656 [2022-03-03 16:31:23,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1587, Invalid=4419, Unknown=0, NotChecked=0, Total=6006 [2022-03-03 16:31:23,799 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 3309 mSDsluCounter, 12865 mSDsCounter, 0 mSdLazyCounter, 4582 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3309 SdHoareTripleChecker+Valid, 14061 SdHoareTripleChecker+Invalid, 4655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:23,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3309 Valid, 14061 Invalid, 4655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4582 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-03 16:31:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197656 states. [2022-03-03 16:31:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197656 to 144253. [2022-03-03 16:31:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144253 states, 144249 states have (on average 3.079376633460197) internal successors, (444197), 144252 states have internal predecessors, (444197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144253 states to 144253 states and 444197 transitions. [2022-03-03 16:31:28,786 INFO L78 Accepts]: Start accepts. Automaton has 144253 states and 444197 transitions. Word has length 114 [2022-03-03 16:31:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:28,786 INFO L470 AbstractCegarLoop]: Abstraction has 144253 states and 444197 transitions. [2022-03-03 16:31:28,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 144253 states and 444197 transitions. [2022-03-03 16:31:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:31:28,930 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:28,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:31:28,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-03 16:31:28,937 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:31:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash 974615476, now seen corresponding path program 10 times [2022-03-03 16:31:28,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:28,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210501249] [2022-03-03 16:31:28,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:28,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:31:29,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:29,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210501249] [2022-03-03 16:31:29,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210501249] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:29,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:29,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:31:29,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879983155] [2022-03-03 16:31:29,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:29,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:31:29,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:31:29,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:31:29,777 INFO L87 Difference]: Start difference. First operand 144253 states and 444197 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:38,213 INFO L93 Difference]: Finished difference Result 196795 states and 605032 transitions. [2022-03-03 16:31:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-03 16:31:38,213 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:31:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:38,768 INFO L225 Difference]: With dead ends: 196795 [2022-03-03 16:31:38,768 INFO L226 Difference]: Without dead ends: 196795 [2022-03-03 16:31:38,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1708, Invalid=4772, Unknown=0, NotChecked=0, Total=6480 [2022-03-03 16:31:38,770 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 3302 mSDsluCounter, 13275 mSDsCounter, 0 mSdLazyCounter, 4753 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3302 SdHoareTripleChecker+Valid, 14532 SdHoareTripleChecker+Invalid, 4823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:38,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3302 Valid, 14532 Invalid, 4823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4753 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-03 16:31:39,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196795 states. [2022-03-03 16:31:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196795 to 144451. [2022-03-03 16:31:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144451 states, 144447 states have (on average 3.0794893628805027) internal successors, (444823), 144450 states have internal predecessors, (444823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144451 states to 144451 states and 444823 transitions. [2022-03-03 16:31:43,393 INFO L78 Accepts]: Start accepts. Automaton has 144451 states and 444823 transitions. Word has length 114 [2022-03-03 16:31:43,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:43,393 INFO L470 AbstractCegarLoop]: Abstraction has 144451 states and 444823 transitions. [2022-03-03 16:31:43,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 144451 states and 444823 transitions. [2022-03-03 16:31:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:31:43,554 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:43,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:31:43,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-03 16:31:43,554 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:31:43,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash -380888028, now seen corresponding path program 11 times [2022-03-03 16:31:43,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:43,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649496429] [2022-03-03 16:31:43,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:31:44,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:44,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649496429] [2022-03-03 16:31:44,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649496429] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:44,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:44,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:31:44,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411954552] [2022-03-03 16:31:44,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:44,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:31:44,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:44,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:31:44,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:31:44,211 INFO L87 Difference]: Start difference. First operand 144451 states and 444823 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:53,375 INFO L93 Difference]: Finished difference Result 195904 states and 602306 transitions. [2022-03-03 16:31:53,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-03 16:31:53,375 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:31:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:54,344 INFO L225 Difference]: With dead ends: 195904 [2022-03-03 16:31:54,344 INFO L226 Difference]: Without dead ends: 195904 [2022-03-03 16:31:54,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1965, Invalid=5517, Unknown=0, NotChecked=0, Total=7482 [2022-03-03 16:31:54,346 INFO L933 BasicCegarLoop]: 1381 mSDtfsCounter, 3295 mSDsluCounter, 14691 mSDsCounter, 0 mSdLazyCounter, 5180 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3295 SdHoareTripleChecker+Valid, 16072 SdHoareTripleChecker+Invalid, 5257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 5180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:54,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3295 Valid, 16072 Invalid, 5257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 5180 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-03 16:31:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195904 states. [2022-03-03 16:31:57,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195904 to 144814. [2022-03-03 16:31:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144814 states, 144810 states have (on average 3.079593950694013) internal successors, (445956), 144813 states have internal predecessors, (445956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:58,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144814 states to 144814 states and 445956 transitions. [2022-03-03 16:31:58,906 INFO L78 Accepts]: Start accepts. Automaton has 144814 states and 445956 transitions. Word has length 114 [2022-03-03 16:31:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:58,907 INFO L470 AbstractCegarLoop]: Abstraction has 144814 states and 445956 transitions. [2022-03-03 16:31:58,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 144814 states and 445956 transitions. [2022-03-03 16:31:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:31:59,032 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:59,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:31:59,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-03 16:31:59,032 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:31:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1942350612, now seen corresponding path program 12 times [2022-03-03 16:31:59,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:59,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808309886] [2022-03-03 16:31:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:59,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:31:59,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:59,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808309886] [2022-03-03 16:31:59,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808309886] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:59,680 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:59,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:31:59,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088595865] [2022-03-03 16:31:59,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:59,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:31:59,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:31:59,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:31:59,682 INFO L87 Difference]: Start difference. First operand 144814 states and 445956 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:09,237 INFO L93 Difference]: Finished difference Result 195046 states and 599574 transitions. [2022-03-03 16:32:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-03 16:32:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:32:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:10,104 INFO L225 Difference]: With dead ends: 195046 [2022-03-03 16:32:10,104 INFO L226 Difference]: Without dead ends: 195046 [2022-03-03 16:32:10,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2261, Invalid=6295, Unknown=0, NotChecked=0, Total=8556 [2022-03-03 16:32:10,105 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 3048 mSDsluCounter, 17165 mSDsCounter, 0 mSdLazyCounter, 6128 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 18652 SdHoareTripleChecker+Invalid, 6207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 6128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:10,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3048 Valid, 18652 Invalid, 6207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 6128 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-03 16:32:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195046 states. [2022-03-03 16:32:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195046 to 144847. [2022-03-03 16:32:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144847 states, 144843 states have (on average 3.0795827206009263) internal successors, (446056), 144846 states have internal predecessors, (446056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144847 states to 144847 states and 446056 transitions. [2022-03-03 16:32:14,590 INFO L78 Accepts]: Start accepts. Automaton has 144847 states and 446056 transitions. Word has length 114 [2022-03-03 16:32:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:14,590 INFO L470 AbstractCegarLoop]: Abstraction has 144847 states and 446056 transitions. [2022-03-03 16:32:14,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 144847 states and 446056 transitions. [2022-03-03 16:32:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:32:14,742 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:14,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:32:14,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-03 16:32:14,743 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:32:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:14,744 INFO L85 PathProgramCache]: Analyzing trace with hash 804485652, now seen corresponding path program 13 times [2022-03-03 16:32:14,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:14,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494740505] [2022-03-03 16:32:14,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:14,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:15,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:15,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494740505] [2022-03-03 16:32:15,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494740505] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:15,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:15,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-03 16:32:15,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158753811] [2022-03-03 16:32:15,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:15,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-03 16:32:15,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:15,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-03 16:32:15,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-03-03 16:32:15,651 INFO L87 Difference]: Start difference. First operand 144847 states and 446056 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:25,823 INFO L93 Difference]: Finished difference Result 196747 states and 605065 transitions. [2022-03-03 16:32:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-03 16:32:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:32:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:26,808 INFO L225 Difference]: With dead ends: 196747 [2022-03-03 16:32:26,808 INFO L226 Difference]: Without dead ends: 196747 [2022-03-03 16:32:26,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2358, Invalid=5652, Unknown=0, NotChecked=0, Total=8010 [2022-03-03 16:32:26,816 INFO L933 BasicCegarLoop]: 1492 mSDtfsCounter, 3385 mSDsluCounter, 11055 mSDsCounter, 0 mSdLazyCounter, 3901 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3385 SdHoareTripleChecker+Valid, 12547 SdHoareTripleChecker+Invalid, 3999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:26,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3385 Valid, 12547 Invalid, 3999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3901 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-03 16:32:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196747 states. [2022-03-03 16:32:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196747 to 155155. [2022-03-03 16:32:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155155 states, 155151 states have (on average 3.0811531991414816) internal successors, (478044), 155154 states have internal predecessors, (478044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155155 states to 155155 states and 478044 transitions. [2022-03-03 16:32:31,758 INFO L78 Accepts]: Start accepts. Automaton has 155155 states and 478044 transitions. Word has length 114 [2022-03-03 16:32:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:31,758 INFO L470 AbstractCegarLoop]: Abstraction has 155155 states and 478044 transitions. [2022-03-03 16:32:31,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 155155 states and 478044 transitions. [2022-03-03 16:32:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:32:31,964 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:31,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:32:31,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-03 16:32:31,964 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:32:31,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:31,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1129835852, now seen corresponding path program 14 times [2022-03-03 16:32:31,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:31,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098122898] [2022-03-03 16:32:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:31,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:32,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:32,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098122898] [2022-03-03 16:32:32,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098122898] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:32,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:32,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:32:32,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982850938] [2022-03-03 16:32:32,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:32,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:32:32,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:32,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:32:32,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:32:32,962 INFO L87 Difference]: Start difference. First operand 155155 states and 478044 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:38,736 INFO L93 Difference]: Finished difference Result 198292 states and 609910 transitions. [2022-03-03 16:32:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-03 16:32:38,736 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:32:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:39,661 INFO L225 Difference]: With dead ends: 198292 [2022-03-03 16:32:39,661 INFO L226 Difference]: Without dead ends: 198292 [2022-03-03 16:32:39,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1377, Invalid=3879, Unknown=0, NotChecked=0, Total=5256 [2022-03-03 16:32:39,662 INFO L933 BasicCegarLoop]: 1086 mSDtfsCounter, 3488 mSDsluCounter, 9696 mSDsCounter, 0 mSdLazyCounter, 3355 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3488 SdHoareTripleChecker+Valid, 10782 SdHoareTripleChecker+Invalid, 3428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 3355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:39,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3488 Valid, 10782 Invalid, 3428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 3355 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 16:32:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198292 states. [2022-03-03 16:32:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198292 to 156343. [2022-03-03 16:32:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156343 states, 156339 states have (on average 3.0811441802749155) internal successors, (481703), 156342 states have internal predecessors, (481703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156343 states to 156343 states and 481703 transitions. [2022-03-03 16:32:44,390 INFO L78 Accepts]: Start accepts. Automaton has 156343 states and 481703 transitions. Word has length 114 [2022-03-03 16:32:44,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:44,390 INFO L470 AbstractCegarLoop]: Abstraction has 156343 states and 481703 transitions. [2022-03-03 16:32:44,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 156343 states and 481703 transitions. [2022-03-03 16:32:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:32:44,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:44,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:32:44,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-03 16:32:44,547 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:32:44,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash 894659704, now seen corresponding path program 15 times [2022-03-03 16:32:44,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:44,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338158044] [2022-03-03 16:32:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:44,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:45,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:45,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338158044] [2022-03-03 16:32:45,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338158044] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:45,155 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:45,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:32:45,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986514703] [2022-03-03 16:32:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:45,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:32:45,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:45,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:32:45,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:32:45,156 INFO L87 Difference]: Start difference. First operand 156343 states and 481703 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:53,445 INFO L93 Difference]: Finished difference Result 207565 states and 638538 transitions. [2022-03-03 16:32:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-03 16:32:53,446 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:32:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:54,471 INFO L225 Difference]: With dead ends: 207565 [2022-03-03 16:32:54,471 INFO L226 Difference]: Without dead ends: 207565 [2022-03-03 16:32:54,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1495, Invalid=4205, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:32:54,472 INFO L933 BasicCegarLoop]: 1147 mSDtfsCounter, 3195 mSDsluCounter, 12351 mSDsCounter, 0 mSdLazyCounter, 4475 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3195 SdHoareTripleChecker+Valid, 13498 SdHoareTripleChecker+Invalid, 4541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 4475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:54,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3195 Valid, 13498 Invalid, 4541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 4475 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-03 16:32:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207565 states. [2022-03-03 16:32:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207565 to 156541. [2022-03-03 16:32:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156541 states, 156537 states have (on average 3.081245967407067) internal successors, (482329), 156540 states have internal predecessors, (482329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156541 states to 156541 states and 482329 transitions. [2022-03-03 16:32:59,842 INFO L78 Accepts]: Start accepts. Automaton has 156541 states and 482329 transitions. Word has length 114 [2022-03-03 16:32:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:59,842 INFO L470 AbstractCegarLoop]: Abstraction has 156541 states and 482329 transitions. [2022-03-03 16:32:59,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 156541 states and 482329 transitions. [2022-03-03 16:33:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:33:00,393 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:00,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:33:00,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-03 16:33:00,393 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:33:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:00,402 INFO L85 PathProgramCache]: Analyzing trace with hash -460843800, now seen corresponding path program 16 times [2022-03-03 16:33:00,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:00,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953362271] [2022-03-03 16:33:00,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:01,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:01,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953362271] [2022-03-03 16:33:01,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953362271] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:01,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:01,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-03 16:33:01,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214741743] [2022-03-03 16:33:01,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:01,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-03 16:33:01,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-03 16:33:01,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2022-03-03 16:33:01,260 INFO L87 Difference]: Start difference. First operand 156541 states and 482329 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:09,706 INFO L93 Difference]: Finished difference Result 206416 states and 634995 transitions. [2022-03-03 16:33:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:33:09,706 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:33:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:10,441 INFO L225 Difference]: With dead ends: 206416 [2022-03-03 16:33:10,441 INFO L226 Difference]: Without dead ends: 206416 [2022-03-03 16:33:10,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1541, Invalid=3715, Unknown=0, NotChecked=0, Total=5256 [2022-03-03 16:33:10,442 INFO L933 BasicCegarLoop]: 1252 mSDtfsCounter, 3201 mSDsluCounter, 11630 mSDsCounter, 0 mSdLazyCounter, 4227 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3201 SdHoareTripleChecker+Valid, 12882 SdHoareTripleChecker+Invalid, 4316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 4227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:10,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3201 Valid, 12882 Invalid, 4316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 4227 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-03 16:33:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206416 states. [2022-03-03 16:33:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206416 to 158389. [2022-03-03 16:33:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158389 states, 158385 states have (on average 3.0818133030274333) internal successors, (488113), 158388 states have internal predecessors, (488113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158389 states to 158389 states and 488113 transitions. [2022-03-03 16:33:15,425 INFO L78 Accepts]: Start accepts. Automaton has 158389 states and 488113 transitions. Word has length 114 [2022-03-03 16:33:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:15,425 INFO L470 AbstractCegarLoop]: Abstraction has 158389 states and 488113 transitions. [2022-03-03 16:33:15,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 158389 states and 488113 transitions. [2022-03-03 16:33:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:33:15,584 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:15,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:33:15,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-03 16:33:15,584 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:33:15,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:15,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2022306384, now seen corresponding path program 17 times [2022-03-03 16:33:15,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:15,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325277743] [2022-03-03 16:33:15,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:15,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:16,350 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:16,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325277743] [2022-03-03 16:33:16,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325277743] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:16,351 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:16,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:33:16,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957909224] [2022-03-03 16:33:16,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:16,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:33:16,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:16,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:33:16,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:33:16,352 INFO L87 Difference]: Start difference. First operand 158389 states and 488113 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:25,664 INFO L93 Difference]: Finished difference Result 209887 states and 645493 transitions. [2022-03-03 16:33:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-03 16:33:25,664 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:33:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:26,312 INFO L225 Difference]: With dead ends: 209887 [2022-03-03 16:33:26,312 INFO L226 Difference]: Without dead ends: 209887 [2022-03-03 16:33:26,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2030, Invalid=5626, Unknown=0, NotChecked=0, Total=7656 [2022-03-03 16:33:26,317 INFO L933 BasicCegarLoop]: 1377 mSDtfsCounter, 3008 mSDsluCounter, 13420 mSDsCounter, 0 mSdLazyCounter, 4812 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3008 SdHoareTripleChecker+Valid, 14797 SdHoareTripleChecker+Invalid, 4890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 4812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:26,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3008 Valid, 14797 Invalid, 4890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 4812 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-03 16:33:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209887 states. [2022-03-03 16:33:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209887 to 158158. [2022-03-03 16:33:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158158 states, 158154 states have (on average 3.0816798816343565) internal successors, (487380), 158157 states have internal predecessors, (487380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158158 states to 158158 states and 487380 transitions. [2022-03-03 16:33:31,253 INFO L78 Accepts]: Start accepts. Automaton has 158158 states and 487380 transitions. Word has length 114 [2022-03-03 16:33:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:31,254 INFO L470 AbstractCegarLoop]: Abstraction has 158158 states and 487380 transitions. [2022-03-03 16:33:31,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 158158 states and 487380 transitions. [2022-03-03 16:33:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:33:31,410 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:31,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:33:31,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-03 16:33:31,411 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:33:31,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash 724529880, now seen corresponding path program 18 times [2022-03-03 16:33:31,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:31,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008201498] [2022-03-03 16:33:31,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:31,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:32,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:32,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008201498] [2022-03-03 16:33:32,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008201498] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:32,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:32,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-03 16:33:32,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750532560] [2022-03-03 16:33:32,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:32,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-03 16:33:32,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:32,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-03 16:33:32,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-03-03 16:33:32,236 INFO L87 Difference]: Start difference. First operand 158158 states and 487380 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:42,170 INFO L93 Difference]: Finished difference Result 209068 states and 643271 transitions. [2022-03-03 16:33:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-03 16:33:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:33:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:43,322 INFO L225 Difference]: With dead ends: 209068 [2022-03-03 16:33:43,322 INFO L226 Difference]: Without dead ends: 209068 [2022-03-03 16:33:43,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2414, Invalid=5776, Unknown=0, NotChecked=0, Total=8190 [2022-03-03 16:33:43,324 INFO L933 BasicCegarLoop]: 1521 mSDtfsCounter, 3679 mSDsluCounter, 12331 mSDsCounter, 0 mSdLazyCounter, 4522 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3679 SdHoareTripleChecker+Valid, 13852 SdHoareTripleChecker+Invalid, 4630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 4522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:43,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3679 Valid, 13852 Invalid, 4630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 4522 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-03 16:33:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209068 states. [2022-03-03 16:33:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209068 to 155254. [2022-03-03 16:33:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155254 states, 155250 states have (on average 3.0811207729468597) internal successors, (478344), 155253 states have internal predecessors, (478344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155254 states to 155254 states and 478344 transitions. [2022-03-03 16:33:48,804 INFO L78 Accepts]: Start accepts. Automaton has 155254 states and 478344 transitions. Word has length 114 [2022-03-03 16:33:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:48,805 INFO L470 AbstractCegarLoop]: Abstraction has 155254 states and 478344 transitions. [2022-03-03 16:33:48,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 155254 states and 478344 transitions. [2022-03-03 16:33:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:33:48,974 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:48,974 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:33:48,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-03 16:33:48,974 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:33:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1771845934, now seen corresponding path program 19 times [2022-03-03 16:33:48,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:48,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253873830] [2022-03-03 16:33:48,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:48,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:50,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:50,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253873830] [2022-03-03 16:33:50,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253873830] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:50,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:50,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-03 16:33:50,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973198588] [2022-03-03 16:33:50,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:50,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-03 16:33:50,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-03 16:33:50,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-03-03 16:33:50,540 INFO L87 Difference]: Start difference. First operand 155254 states and 478344 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:57,090 INFO L93 Difference]: Finished difference Result 195424 states and 601182 transitions. [2022-03-03 16:33:57,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-03 16:33:57,090 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:33:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:57,989 INFO L225 Difference]: With dead ends: 195424 [2022-03-03 16:33:57,989 INFO L226 Difference]: Without dead ends: 195424 [2022-03-03 16:33:57,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1074, Invalid=2708, Unknown=0, NotChecked=0, Total=3782 [2022-03-03 16:33:57,990 INFO L933 BasicCegarLoop]: 1018 mSDtfsCounter, 2437 mSDsluCounter, 9591 mSDsCounter, 0 mSdLazyCounter, 3482 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2437 SdHoareTripleChecker+Valid, 10609 SdHoareTripleChecker+Invalid, 3550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:57,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2437 Valid, 10609 Invalid, 3550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3482 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:33:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195424 states. [2022-03-03 16:34:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195424 to 159412. [2022-03-03 16:34:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159412 states, 159408 states have (on average 3.082862842517314) internal successors, (491433), 159411 states have internal predecessors, (491433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159412 states to 159412 states and 491433 transitions. [2022-03-03 16:34:03,061 INFO L78 Accepts]: Start accepts. Automaton has 159412 states and 491433 transitions. Word has length 114 [2022-03-03 16:34:03,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:03,061 INFO L470 AbstractCegarLoop]: Abstraction has 159412 states and 491433 transitions. [2022-03-03 16:34:03,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 159412 states and 491433 transitions. [2022-03-03 16:34:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:34:03,255 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:03,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:34:03,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-03 16:34:03,255 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:34:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:03,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1167617858, now seen corresponding path program 20 times [2022-03-03 16:34:03,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:03,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013834372] [2022-03-03 16:34:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:03,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:04,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:04,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013834372] [2022-03-03 16:34:04,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013834372] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:04,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:04,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:34:04,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703727466] [2022-03-03 16:34:04,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:04,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:34:04,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:04,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:34:04,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:34:04,247 INFO L87 Difference]: Start difference. First operand 159412 states and 491433 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:11,890 INFO L93 Difference]: Finished difference Result 206287 states and 634740 transitions. [2022-03-03 16:34:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 16:34:11,891 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:34:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:12,669 INFO L225 Difference]: With dead ends: 206287 [2022-03-03 16:34:12,670 INFO L226 Difference]: Without dead ends: 206287 [2022-03-03 16:34:12,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1527, Invalid=4325, Unknown=0, NotChecked=0, Total=5852 [2022-03-03 16:34:12,672 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 3098 mSDsluCounter, 11991 mSDsCounter, 0 mSdLazyCounter, 4314 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3098 SdHoareTripleChecker+Valid, 13152 SdHoareTripleChecker+Invalid, 4382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 4314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:12,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3098 Valid, 13152 Invalid, 4382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 4314 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:34:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206287 states. [2022-03-03 16:34:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206287 to 160270. [2022-03-03 16:34:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160270 states, 160266 states have (on average 3.082993273682503) internal successors, (494099), 160269 states have internal predecessors, (494099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160270 states to 160270 states and 494099 transitions. [2022-03-03 16:34:17,722 INFO L78 Accepts]: Start accepts. Automaton has 160270 states and 494099 transitions. Word has length 114 [2022-03-03 16:34:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:17,722 INFO L470 AbstractCegarLoop]: Abstraction has 160270 states and 494099 transitions. [2022-03-03 16:34:17,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 160270 states and 494099 transitions. [2022-03-03 16:34:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:34:17,878 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:17,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:34:17,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-03 16:34:17,878 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:34:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -393844726, now seen corresponding path program 21 times [2022-03-03 16:34:17,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:17,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022991352] [2022-03-03 16:34:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:18,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:18,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022991352] [2022-03-03 16:34:18,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022991352] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:18,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:18,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:34:18,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675973128] [2022-03-03 16:34:18,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:18,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:34:18,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:18,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:34:18,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:34:18,506 INFO L87 Difference]: Start difference. First operand 160270 states and 494099 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:26,466 INFO L93 Difference]: Finished difference Result 204988 states and 630661 transitions. [2022-03-03 16:34:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-03 16:34:26,466 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:34:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:27,550 INFO L225 Difference]: With dead ends: 204988 [2022-03-03 16:34:27,550 INFO L226 Difference]: Without dead ends: 204988 [2022-03-03 16:34:27,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1799, Invalid=5007, Unknown=0, NotChecked=0, Total=6806 [2022-03-03 16:34:27,561 INFO L933 BasicCegarLoop]: 1267 mSDtfsCounter, 3650 mSDsluCounter, 11000 mSDsCounter, 0 mSdLazyCounter, 3919 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3650 SdHoareTripleChecker+Valid, 12267 SdHoareTripleChecker+Invalid, 4014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:27,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3650 Valid, 12267 Invalid, 4014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3919 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:34:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204988 states. [2022-03-03 16:34:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204988 to 160303. [2022-03-03 16:34:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160303 states, 160299 states have (on average 3.082982426590309) internal successors, (494199), 160302 states have internal predecessors, (494199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160303 states to 160303 states and 494199 transitions. [2022-03-03 16:34:33,063 INFO L78 Accepts]: Start accepts. Automaton has 160303 states and 494199 transitions. Word has length 114 [2022-03-03 16:34:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:33,063 INFO L470 AbstractCegarLoop]: Abstraction has 160303 states and 494199 transitions. [2022-03-03 16:34:33,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 160303 states and 494199 transitions. [2022-03-03 16:34:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:34:33,613 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:33,613 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:34:33,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-03 16:34:33,613 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:34:33,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1941975758, now seen corresponding path program 22 times [2022-03-03 16:34:33,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:33,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865855210] [2022-03-03 16:34:33,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:33,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:34,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:34,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865855210] [2022-03-03 16:34:34,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865855210] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:34,445 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:34,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:34:34,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293304558] [2022-03-03 16:34:34,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:34,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:34:34,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:34,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:34:34,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:34:34,446 INFO L87 Difference]: Start difference. First operand 160303 states and 494199 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:44,762 INFO L93 Difference]: Finished difference Result 205831 states and 633552 transitions. [2022-03-03 16:34:44,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-03 16:34:44,779 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:34:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:45,464 INFO L225 Difference]: With dead ends: 205831 [2022-03-03 16:34:45,464 INFO L226 Difference]: Without dead ends: 205831 [2022-03-03 16:34:45,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2489, Invalid=6067, Unknown=0, NotChecked=0, Total=8556 [2022-03-03 16:34:45,465 INFO L933 BasicCegarLoop]: 1550 mSDtfsCounter, 3311 mSDsluCounter, 12501 mSDsCounter, 0 mSdLazyCounter, 4433 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3311 SdHoareTripleChecker+Valid, 14051 SdHoareTripleChecker+Invalid, 4531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:45,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3311 Valid, 14051 Invalid, 4531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4433 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-03 16:34:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205831 states. [2022-03-03 16:34:49,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205831 to 155848. [2022-03-03 16:34:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155848 states, 155844 states have (on average 3.0814275814275813) internal successors, (480222), 155847 states have internal predecessors, (480222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155848 states to 155848 states and 480222 transitions. [2022-03-03 16:34:50,684 INFO L78 Accepts]: Start accepts. Automaton has 155848 states and 480222 transitions. Word has length 114 [2022-03-03 16:34:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:50,684 INFO L470 AbstractCegarLoop]: Abstraction has 155848 states and 480222 transitions. [2022-03-03 16:34:50,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 155848 states and 480222 transitions. [2022-03-03 16:34:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:34:51,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:51,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:34:51,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-03 16:34:51,462 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:34:51,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1860149644, now seen corresponding path program 23 times [2022-03-03 16:34:51,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:51,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390845595] [2022-03-03 16:34:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:52,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:52,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390845595] [2022-03-03 16:34:52,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390845595] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:52,496 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:52,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:34:52,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013692552] [2022-03-03 16:34:52,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:52,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:34:52,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:52,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:34:52,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:34:52,497 INFO L87 Difference]: Start difference. First operand 155848 states and 480222 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:58,212 INFO L93 Difference]: Finished difference Result 195547 states and 601977 transitions. [2022-03-03 16:34:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-03 16:34:58,213 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:34:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:58,797 INFO L225 Difference]: With dead ends: 195547 [2022-03-03 16:34:58,797 INFO L226 Difference]: Without dead ends: 195547 [2022-03-03 16:34:58,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1089, Invalid=3333, Unknown=0, NotChecked=0, Total=4422 [2022-03-03 16:34:58,798 INFO L933 BasicCegarLoop]: 927 mSDtfsCounter, 3195 mSDsluCounter, 10478 mSDsCounter, 0 mSdLazyCounter, 3708 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3195 SdHoareTripleChecker+Valid, 11405 SdHoareTripleChecker+Invalid, 3783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:58,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3195 Valid, 11405 Invalid, 3783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 3708 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:34:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195547 states. [2022-03-03 16:35:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195547 to 162019. [2022-03-03 16:35:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162019 states, 162015 states have (on average 3.082942937382341) internal successors, (499483), 162018 states have internal predecessors, (499483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162019 states to 162019 states and 499483 transitions. [2022-03-03 16:35:04,048 INFO L78 Accepts]: Start accepts. Automaton has 162019 states and 499483 transitions. Word has length 114 [2022-03-03 16:35:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:04,049 INFO L470 AbstractCegarLoop]: Abstraction has 162019 states and 499483 transitions. [2022-03-03 16:35:04,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 162019 states and 499483 transitions. [2022-03-03 16:35:04,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:35:04,205 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:04,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:35:04,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-03 16:35:04,206 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:35:04,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:04,206 INFO L85 PathProgramCache]: Analyzing trace with hash 873355068, now seen corresponding path program 24 times [2022-03-03 16:35:04,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:04,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847402230] [2022-03-03 16:35:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:04,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:04,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:04,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847402230] [2022-03-03 16:35:04,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847402230] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:04,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:04,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:35:04,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809532603] [2022-03-03 16:35:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:04,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:35:04,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:04,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:35:04,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:35:04,807 INFO L87 Difference]: Start difference. First operand 162019 states and 499483 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:11,920 INFO L93 Difference]: Finished difference Result 197494 states and 608240 transitions. [2022-03-03 16:35:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-03 16:35:11,934 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:35:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:12,821 INFO L225 Difference]: With dead ends: 197494 [2022-03-03 16:35:12,821 INFO L226 Difference]: Without dead ends: 197494 [2022-03-03 16:35:12,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1334, Invalid=3922, Unknown=0, NotChecked=0, Total=5256 [2022-03-03 16:35:12,823 INFO L933 BasicCegarLoop]: 1033 mSDtfsCounter, 2742 mSDsluCounter, 12683 mSDsCounter, 0 mSdLazyCounter, 4637 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2742 SdHoareTripleChecker+Valid, 13716 SdHoareTripleChecker+Invalid, 4712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 4637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:12,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2742 Valid, 13716 Invalid, 4712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4637 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 16:35:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197494 states. [2022-03-03 16:35:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197494 to 162052. [2022-03-03 16:35:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162052 states, 162048 states have (on average 3.082932217614534) internal successors, (499583), 162051 states have internal predecessors, (499583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162052 states to 162052 states and 499583 transitions. [2022-03-03 16:35:18,269 INFO L78 Accepts]: Start accepts. Automaton has 162052 states and 499583 transitions. Word has length 114 [2022-03-03 16:35:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:18,269 INFO L470 AbstractCegarLoop]: Abstraction has 162052 states and 499583 transitions. [2022-03-03 16:35:18,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 162052 states and 499583 transitions. [2022-03-03 16:35:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:35:18,832 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:18,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:35:18,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-03 16:35:18,833 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:35:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -674775964, now seen corresponding path program 25 times [2022-03-03 16:35:18,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:18,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808232724] [2022-03-03 16:35:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:19,531 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:19,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808232724] [2022-03-03 16:35:19,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808232724] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:19,531 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:19,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-03 16:35:19,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608810901] [2022-03-03 16:35:19,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:19,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-03 16:35:19,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:19,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-03 16:35:19,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-03-03 16:35:19,532 INFO L87 Difference]: Start difference. First operand 162052 states and 499583 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:29,539 INFO L93 Difference]: Finished difference Result 196723 states and 605555 transitions. [2022-03-03 16:35:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-03 16:35:29,540 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:35:29,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:30,482 INFO L225 Difference]: With dead ends: 196723 [2022-03-03 16:35:30,482 INFO L226 Difference]: Without dead ends: 196723 [2022-03-03 16:35:30,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2558, Invalid=6184, Unknown=0, NotChecked=0, Total=8742 [2022-03-03 16:35:30,483 INFO L933 BasicCegarLoop]: 1609 mSDtfsCounter, 3048 mSDsluCounter, 14074 mSDsCounter, 0 mSdLazyCounter, 5002 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 15683 SdHoareTripleChecker+Invalid, 5094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 5002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:30,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3048 Valid, 15683 Invalid, 5094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 5002 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-03 16:35:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196723 states. [2022-03-03 16:35:34,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196723 to 157432. [2022-03-03 16:35:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157432 states, 157428 states have (on average 3.0819612775363976) internal successors, (485187), 157431 states have internal predecessors, (485187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157432 states to 157432 states and 485187 transitions. [2022-03-03 16:35:35,308 INFO L78 Accepts]: Start accepts. Automaton has 157432 states and 485187 transitions. Word has length 114 [2022-03-03 16:35:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:35,309 INFO L470 AbstractCegarLoop]: Abstraction has 157432 states and 485187 transitions. [2022-03-03 16:35:35,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 157432 states and 485187 transitions. [2022-03-03 16:35:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:35:35,484 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:35,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:35:35,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-03 16:35:35,484 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:35:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash -939404236, now seen corresponding path program 26 times [2022-03-03 16:35:35,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:35,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158803143] [2022-03-03 16:35:35,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:35,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:36,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:36,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158803143] [2022-03-03 16:35:36,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158803143] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:36,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:36,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:35:36,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486851758] [2022-03-03 16:35:36,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:36,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:35:36,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:36,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:35:36,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:35:36,512 INFO L87 Difference]: Start difference. First operand 157432 states and 485187 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:41,003 INFO L93 Difference]: Finished difference Result 186637 states and 574086 transitions. [2022-03-03 16:35:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-03 16:35:41,004 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:35:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:41,840 INFO L225 Difference]: With dead ends: 186637 [2022-03-03 16:35:41,840 INFO L226 Difference]: Without dead ends: 186637 [2022-03-03 16:35:41,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=874, Invalid=3032, Unknown=0, NotChecked=0, Total=3906 [2022-03-03 16:35:41,841 INFO L933 BasicCegarLoop]: 818 mSDtfsCounter, 2715 mSDsluCounter, 10812 mSDsCounter, 0 mSdLazyCounter, 3769 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2715 SdHoareTripleChecker+Valid, 11630 SdHoareTripleChecker+Invalid, 3840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:41,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2715 Valid, 11630 Invalid, 3840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3769 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:35:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186637 states. [2022-03-03 16:35:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186637 to 158026. [2022-03-03 16:35:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158026 states, 158022 states have (on average 3.081767095720849) internal successors, (486987), 158025 states have internal predecessors, (486987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158026 states to 158026 states and 486987 transitions. [2022-03-03 16:35:46,637 INFO L78 Accepts]: Start accepts. Automaton has 158026 states and 486987 transitions. Word has length 114 [2022-03-03 16:35:46,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:46,637 INFO L470 AbstractCegarLoop]: Abstraction has 158026 states and 486987 transitions. [2022-03-03 16:35:46,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 158026 states and 486987 transitions. [2022-03-03 16:35:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:35:46,847 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:46,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:35:46,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-03 16:35:46,847 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:35:46,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1807432028, now seen corresponding path program 27 times [2022-03-03 16:35:46,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:46,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090294456] [2022-03-03 16:35:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:46,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:48,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:48,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090294456] [2022-03-03 16:35:48,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090294456] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:48,048 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:48,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:35:48,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617601500] [2022-03-03 16:35:48,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:48,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:35:48,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:48,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:35:48,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:35:48,049 INFO L87 Difference]: Start difference. First operand 158026 states and 486987 transitions. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:57,417 INFO L93 Difference]: Finished difference Result 188077 states and 578431 transitions. [2022-03-03 16:35:57,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-03 16:35:57,418 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:35:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:58,416 INFO L225 Difference]: With dead ends: 188077 [2022-03-03 16:35:58,416 INFO L226 Difference]: Without dead ends: 188077 [2022-03-03 16:35:58,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2244, Invalid=5412, Unknown=0, NotChecked=0, Total=7656 [2022-03-03 16:35:58,417 INFO L933 BasicCegarLoop]: 1502 mSDtfsCounter, 3040 mSDsluCounter, 13790 mSDsCounter, 0 mSdLazyCounter, 4957 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3040 SdHoareTripleChecker+Valid, 15292 SdHoareTripleChecker+Invalid, 5048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 4957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:58,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3040 Valid, 15292 Invalid, 5048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 4957 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-03 16:35:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188077 states. [2022-03-03 16:36:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188077 to 156211. [2022-03-03 16:36:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156211 states, 156207 states have (on average 3.081609658978151) internal successors, (481369), 156210 states have internal predecessors, (481369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156211 states to 156211 states and 481369 transitions. [2022-03-03 16:36:03,747 INFO L78 Accepts]: Start accepts. Automaton has 156211 states and 481369 transitions. Word has length 114 [2022-03-03 16:36:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:03,747 INFO L470 AbstractCegarLoop]: Abstraction has 156211 states and 481369 transitions. [2022-03-03 16:36:03,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 156211 states and 481369 transitions. [2022-03-03 16:36:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:36:03,893 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:03,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:36:03,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-03 16:36:03,894 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:36:03,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:03,895 INFO L85 PathProgramCache]: Analyzing trace with hash -825115224, now seen corresponding path program 28 times [2022-03-03 16:36:03,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:03,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696032783] [2022-03-03 16:36:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:04,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:04,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696032783] [2022-03-03 16:36:04,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696032783] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:04,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:04,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:36:04,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164347706] [2022-03-03 16:36:04,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:04,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:36:04,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:04,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:36:04,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:36:04,539 INFO L87 Difference]: Start difference. First operand 156211 states and 481369 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:12,083 INFO L93 Difference]: Finished difference Result 228202 states and 702439 transitions. [2022-03-03 16:36:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-03 16:36:12,083 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:36:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:13,163 INFO L225 Difference]: With dead ends: 228202 [2022-03-03 16:36:13,163 INFO L226 Difference]: Without dead ends: 228202 [2022-03-03 16:36:13,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:36:13,164 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 3412 mSDsluCounter, 9505 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3412 SdHoareTripleChecker+Valid, 10640 SdHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:13,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3412 Valid, 10640 Invalid, 3392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3327 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 16:36:13,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228202 states. [2022-03-03 16:36:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228202 to 157828. [2022-03-03 16:36:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157828 states, 157824 states have (on average 3.0814578264395784) internal successors, (486328), 157827 states have internal predecessors, (486328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157828 states to 157828 states and 486328 transitions. [2022-03-03 16:36:18,339 INFO L78 Accepts]: Start accepts. Automaton has 157828 states and 486328 transitions. Word has length 114 [2022-03-03 16:36:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:18,340 INFO L470 AbstractCegarLoop]: Abstraction has 157828 states and 486328 transitions. [2022-03-03 16:36:18,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 157828 states and 486328 transitions. [2022-03-03 16:36:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:36:18,505 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:18,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:36:18,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-03 16:36:18,505 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:36:18,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:18,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1488903994, now seen corresponding path program 29 times [2022-03-03 16:36:18,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:18,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715232284] [2022-03-03 16:36:18,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:18,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:19,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:19,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715232284] [2022-03-03 16:36:19,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715232284] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:19,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:19,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:36:19,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607034137] [2022-03-03 16:36:19,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:19,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:36:19,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:36:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:36:19,522 INFO L87 Difference]: Start difference. First operand 157828 states and 486328 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:26,807 INFO L93 Difference]: Finished difference Result 247378 states and 761904 transitions. [2022-03-03 16:36:26,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-03 16:36:26,807 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:36:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:28,061 INFO L225 Difference]: With dead ends: 247378 [2022-03-03 16:36:28,062 INFO L226 Difference]: Without dead ends: 247378 [2022-03-03 16:36:28,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1587, Invalid=4419, Unknown=0, NotChecked=0, Total=6006 [2022-03-03 16:36:28,062 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 3199 mSDsluCounter, 13013 mSDsCounter, 0 mSdLazyCounter, 4805 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3199 SdHoareTripleChecker+Valid, 14209 SdHoareTripleChecker+Invalid, 4870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:28,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3199 Valid, 14209 Invalid, 4870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4805 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-03 16:36:28,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247378 states. [2022-03-03 16:36:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247378 to 157861. [2022-03-03 16:36:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157861 states, 157857 states have (on average 3.0814471325313417) internal successors, (486428), 157860 states have internal predecessors, (486428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157861 states to 157861 states and 486428 transitions. [2022-03-03 16:36:33,378 INFO L78 Accepts]: Start accepts. Automaton has 157861 states and 486428 transitions. Word has length 114 [2022-03-03 16:36:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:33,378 INFO L470 AbstractCegarLoop]: Abstraction has 157861 states and 486428 transitions. [2022-03-03 16:36:33,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 157861 states and 486428 transitions. [2022-03-03 16:36:33,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:36:33,931 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:33,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:36:33,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-03 16:36:33,932 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:36:33,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:33,932 INFO L85 PathProgramCache]: Analyzing trace with hash 535591562, now seen corresponding path program 30 times [2022-03-03 16:36:33,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:33,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826406744] [2022-03-03 16:36:33,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:33,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:34,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:34,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826406744] [2022-03-03 16:36:34,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826406744] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:34,515 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:34,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:36:34,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055580285] [2022-03-03 16:36:34,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:34,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:36:34,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:34,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:36:34,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:36:34,517 INFO L87 Difference]: Start difference. First operand 157861 states and 486428 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:43,279 INFO L93 Difference]: Finished difference Result 245923 states and 757415 transitions. [2022-03-03 16:36:43,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-03 16:36:43,279 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:36:43,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:44,514 INFO L225 Difference]: With dead ends: 245923 [2022-03-03 16:36:44,514 INFO L226 Difference]: Without dead ends: 245923 [2022-03-03 16:36:44,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1708, Invalid=4772, Unknown=0, NotChecked=0, Total=6480 [2022-03-03 16:36:44,516 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 3141 mSDsluCounter, 12656 mSDsCounter, 0 mSdLazyCounter, 4536 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3141 SdHoareTripleChecker+Valid, 13913 SdHoareTripleChecker+Invalid, 4606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:44,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3141 Valid, 13913 Invalid, 4606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4536 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-03 16:36:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245923 states. [2022-03-03 16:36:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245923 to 158059. [2022-03-03 16:36:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158059 states, 158055 states have (on average 3.0815475625573376) internal successors, (487054), 158058 states have internal predecessors, (487054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158059 states to 158059 states and 487054 transitions. [2022-03-03 16:36:49,909 INFO L78 Accepts]: Start accepts. Automaton has 158059 states and 487054 transitions. Word has length 114 [2022-03-03 16:36:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:49,910 INFO L470 AbstractCegarLoop]: Abstraction has 158059 states and 487054 transitions. [2022-03-03 16:36:49,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 158059 states and 487054 transitions. [2022-03-03 16:36:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:36:50,064 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:50,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:36:50,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-03 16:36:50,064 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:36:50,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash -819911942, now seen corresponding path program 31 times [2022-03-03 16:36:50,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:50,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907892562] [2022-03-03 16:36:50,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:50,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:50,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:50,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907892562] [2022-03-03 16:36:50,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907892562] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:50,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:50,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:36:50,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346948742] [2022-03-03 16:36:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:50,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:36:50,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:50,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:36:50,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:36:50,708 INFO L87 Difference]: Start difference. First operand 158059 states and 487054 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:00,827 INFO L93 Difference]: Finished difference Result 244339 states and 752589 transitions. [2022-03-03 16:37:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-03 16:37:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:37:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:02,227 INFO L225 Difference]: With dead ends: 244339 [2022-03-03 16:37:02,227 INFO L226 Difference]: Without dead ends: 244339 [2022-03-03 16:37:02,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1965, Invalid=5517, Unknown=0, NotChecked=0, Total=7482 [2022-03-03 16:37:02,229 INFO L933 BasicCegarLoop]: 1381 mSDtfsCounter, 3121 mSDsluCounter, 13184 mSDsCounter, 0 mSdLazyCounter, 4731 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3121 SdHoareTripleChecker+Valid, 14565 SdHoareTripleChecker+Invalid, 4801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:02,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3121 Valid, 14565 Invalid, 4801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4731 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-03 16:37:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244339 states. [2022-03-03 16:37:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244339 to 158422. [2022-03-03 16:37:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158422 states, 158418 states have (on average 3.0816384501761163) internal successors, (488187), 158421 states have internal predecessors, (488187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158422 states to 158422 states and 488187 transitions. [2022-03-03 16:37:07,629 INFO L78 Accepts]: Start accepts. Automaton has 158422 states and 488187 transitions. Word has length 114 [2022-03-03 16:37:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:07,630 INFO L470 AbstractCegarLoop]: Abstraction has 158422 states and 488187 transitions. [2022-03-03 16:37:07,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 158422 states and 488187 transitions. [2022-03-03 16:37:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:37:07,810 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:07,810 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:37:07,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-03 16:37:07,811 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:37:07,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1913592770, now seen corresponding path program 32 times [2022-03-03 16:37:07,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:07,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808741932] [2022-03-03 16:37:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:08,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:08,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808741932] [2022-03-03 16:37:08,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808741932] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:08,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:08,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:37:08,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330660292] [2022-03-03 16:37:08,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:08,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:37:08,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:08,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:37:08,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:37:08,903 INFO L87 Difference]: Start difference. First operand 158422 states and 488187 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:20,843 INFO L93 Difference]: Finished difference Result 242986 states and 748258 transitions. [2022-03-03 16:37:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-03 16:37:20,844 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:37:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:21,992 INFO L225 Difference]: With dead ends: 242986 [2022-03-03 16:37:21,993 INFO L226 Difference]: Without dead ends: 242986 [2022-03-03 16:37:21,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2261, Invalid=6295, Unknown=0, NotChecked=0, Total=8556 [2022-03-03 16:37:21,993 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 3304 mSDsluCounter, 16636 mSDsCounter, 0 mSdLazyCounter, 6077 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3304 SdHoareTripleChecker+Valid, 18123 SdHoareTripleChecker+Invalid, 6161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 6077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:21,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3304 Valid, 18123 Invalid, 6161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 6077 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-03 16:37:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242986 states. [2022-03-03 16:37:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242986 to 158455. [2022-03-03 16:37:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158455 states, 158451 states have (on average 3.0816277587392946) internal successors, (488287), 158454 states have internal predecessors, (488287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158455 states to 158455 states and 488287 transitions. [2022-03-03 16:37:26,746 INFO L78 Accepts]: Start accepts. Automaton has 158455 states and 488287 transitions. Word has length 114 [2022-03-03 16:37:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:26,746 INFO L470 AbstractCegarLoop]: Abstraction has 158455 states and 488287 transitions. [2022-03-03 16:37:26,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 158455 states and 488287 transitions. [2022-03-03 16:37:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:37:27,373 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:27,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:37:27,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-03 16:37:27,378 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:37:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash 365461738, now seen corresponding path program 33 times [2022-03-03 16:37:27,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:27,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536125005] [2022-03-03 16:37:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:28,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:28,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536125005] [2022-03-03 16:37:28,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536125005] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:28,054 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:28,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-03 16:37:28,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843376664] [2022-03-03 16:37:28,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:28,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-03 16:37:28,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:28,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-03 16:37:28,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-03-03 16:37:28,055 INFO L87 Difference]: Start difference. First operand 158455 states and 488287 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:37,355 INFO L93 Difference]: Finished difference Result 243895 states and 751021 transitions. [2022-03-03 16:37:37,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-03 16:37:37,356 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:37:37,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:38,295 INFO L225 Difference]: With dead ends: 243895 [2022-03-03 16:37:38,295 INFO L226 Difference]: Without dead ends: 243895 [2022-03-03 16:37:38,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-03-03 16:37:38,296 INFO L933 BasicCegarLoop]: 1482 mSDtfsCounter, 2503 mSDsluCounter, 12258 mSDsCounter, 0 mSdLazyCounter, 4532 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2503 SdHoareTripleChecker+Valid, 13740 SdHoareTripleChecker+Invalid, 4606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:38,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2503 Valid, 13740 Invalid, 4606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 4532 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-03 16:37:38,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243895 states. [2022-03-03 16:37:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243895 to 168025. [2022-03-03 16:37:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168025 states, 168021 states have (on average 3.0829182066527396) internal successors, (517995), 168024 states have internal predecessors, (517995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168025 states to 168025 states and 517995 transitions. [2022-03-03 16:37:43,665 INFO L78 Accepts]: Start accepts. Automaton has 168025 states and 517995 transitions. Word has length 114 [2022-03-03 16:37:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:43,666 INFO L470 AbstractCegarLoop]: Abstraction has 168025 states and 517995 transitions. [2022-03-03 16:37:43,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 168025 states and 517995 transitions. [2022-03-03 16:37:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:37:44,255 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:44,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:37:44,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-03 16:37:44,256 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:37:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1568859766, now seen corresponding path program 34 times [2022-03-03 16:37:44,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:44,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483457376] [2022-03-03 16:37:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:44,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:44,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483457376] [2022-03-03 16:37:44,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483457376] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:44,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:44,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:37:44,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672170181] [2022-03-03 16:37:44,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:44,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:37:44,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:44,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:37:44,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:37:44,883 INFO L87 Difference]: Start difference. First operand 168025 states and 517995 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:51,779 INFO L93 Difference]: Finished difference Result 268819 states and 828324 transitions. [2022-03-03 16:37:51,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-03 16:37:51,780 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:37:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:53,004 INFO L225 Difference]: With dead ends: 268819 [2022-03-03 16:37:53,004 INFO L226 Difference]: Without dead ends: 268819 [2022-03-03 16:37:53,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1377, Invalid=3879, Unknown=0, NotChecked=0, Total=5256 [2022-03-03 16:37:53,005 INFO L933 BasicCegarLoop]: 1095 mSDtfsCounter, 3810 mSDsluCounter, 7979 mSDsCounter, 0 mSdLazyCounter, 2838 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3810 SdHoareTripleChecker+Valid, 9074 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:53,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3810 Valid, 9074 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2838 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 16:37:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268819 states. [2022-03-03 16:37:57,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268819 to 169213. [2022-03-03 16:37:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169213 states, 169209 states have (on average 3.082897481812433) internal successors, (521654), 169212 states have internal predecessors, (521654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169213 states to 169213 states and 521654 transitions. [2022-03-03 16:37:58,998 INFO L78 Accepts]: Start accepts. Automaton has 169213 states and 521654 transitions. Word has length 114 [2022-03-03 16:37:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:58,998 INFO L470 AbstractCegarLoop]: Abstraction has 169213 states and 521654 transitions. [2022-03-03 16:37:58,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 169213 states and 521654 transitions. [2022-03-03 16:37:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:37:59,239 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:59,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:37:59,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-03 16:37:59,240 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:37:59,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash 455635790, now seen corresponding path program 35 times [2022-03-03 16:37:59,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:59,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150967420] [2022-03-03 16:37:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:59,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:59,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:59,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150967420] [2022-03-03 16:37:59,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150967420] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:59,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:59,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:37:59,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705182892] [2022-03-03 16:37:59,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:59,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:37:59,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:59,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:37:59,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:37:59,807 INFO L87 Difference]: Start difference. First operand 169213 states and 521654 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:07,514 INFO L93 Difference]: Finished difference Result 285814 states and 881100 transitions. [2022-03-03 16:38:07,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-03 16:38:07,515 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:38:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:08,643 INFO L225 Difference]: With dead ends: 285814 [2022-03-03 16:38:08,643 INFO L226 Difference]: Without dead ends: 285814 [2022-03-03 16:38:08,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1495, Invalid=4205, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:38:08,643 INFO L933 BasicCegarLoop]: 1156 mSDtfsCounter, 3503 mSDsluCounter, 11421 mSDsCounter, 0 mSdLazyCounter, 4183 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3503 SdHoareTripleChecker+Valid, 12577 SdHoareTripleChecker+Invalid, 4256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:08,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3503 Valid, 12577 Invalid, 4256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4183 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-03 16:38:09,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285814 states. [2022-03-03 16:38:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285814 to 169411. [2022-03-03 16:38:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169411 states, 169407 states have (on average 3.0829894868570955) internal successors, (522280), 169410 states have internal predecessors, (522280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169411 states to 169411 states and 522280 transitions. [2022-03-03 16:38:14,776 INFO L78 Accepts]: Start accepts. Automaton has 169411 states and 522280 transitions. Word has length 114 [2022-03-03 16:38:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:14,776 INFO L470 AbstractCegarLoop]: Abstraction has 169411 states and 522280 transitions. [2022-03-03 16:38:14,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 169411 states and 522280 transitions. [2022-03-03 16:38:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:38:14,999 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:14,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:38:14,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-03 16:38:14,999 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:38:15,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash -899867714, now seen corresponding path program 36 times [2022-03-03 16:38:15,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:15,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779724985] [2022-03-03 16:38:15,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:15,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:38:16,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:16,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779724985] [2022-03-03 16:38:16,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779724985] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:16,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:16,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:38:16,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114366739] [2022-03-03 16:38:16,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:16,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:38:16,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:16,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:38:16,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:38:16,166 INFO L87 Difference]: Start difference. First operand 169411 states and 522280 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:26,229 INFO L93 Difference]: Finished difference Result 284230 states and 876274 transitions. [2022-03-03 16:38:26,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-03 16:38:26,229 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:38:26,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:27,225 INFO L225 Difference]: With dead ends: 284230 [2022-03-03 16:38:27,225 INFO L226 Difference]: Without dead ends: 284230 [2022-03-03 16:38:27,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1746, Invalid=4896, Unknown=0, NotChecked=0, Total=6642 [2022-03-03 16:38:27,225 INFO L933 BasicCegarLoop]: 1280 mSDtfsCounter, 3130 mSDsluCounter, 15348 mSDsCounter, 0 mSdLazyCounter, 5676 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3130 SdHoareTripleChecker+Valid, 16628 SdHoareTripleChecker+Invalid, 5745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 5676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:27,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3130 Valid, 16628 Invalid, 5745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 5676 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-03 16:38:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284230 states. [2022-03-03 16:38:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284230 to 169774. [2022-03-03 16:38:32,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169774 states, 169770 states have (on average 3.0830712139954057) internal successors, (523413), 169773 states have internal predecessors, (523413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169774 states to 169774 states and 523413 transitions. [2022-03-03 16:38:33,443 INFO L78 Accepts]: Start accepts. Automaton has 169774 states and 523413 transitions. Word has length 114 [2022-03-03 16:38:33,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:33,444 INFO L470 AbstractCegarLoop]: Abstraction has 169774 states and 523413 transitions. [2022-03-03 16:38:33,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 169774 states and 523413 transitions. [2022-03-03 16:38:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:38:33,649 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:33,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:38:33,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-03 16:38:33,650 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:38:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1833636998, now seen corresponding path program 37 times [2022-03-03 16:38:33,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:33,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749377275] [2022-03-03 16:38:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:38:34,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:34,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749377275] [2022-03-03 16:38:34,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749377275] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:34,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:34,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:38:34,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043298359] [2022-03-03 16:38:34,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:34,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:38:34,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:38:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:38:34,247 INFO L87 Difference]: Start difference. First operand 169774 states and 523413 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:44,077 INFO L93 Difference]: Finished difference Result 282877 states and 871943 transitions. [2022-03-03 16:38:44,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-03 16:38:44,078 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:38:44,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:45,396 INFO L225 Difference]: With dead ends: 282877 [2022-03-03 16:38:45,396 INFO L226 Difference]: Without dead ends: 282877 [2022-03-03 16:38:45,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2030, Invalid=5626, Unknown=0, NotChecked=0, Total=7656 [2022-03-03 16:38:45,397 INFO L933 BasicCegarLoop]: 1386 mSDtfsCounter, 3310 mSDsluCounter, 14103 mSDsCounter, 0 mSdLazyCounter, 5163 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3310 SdHoareTripleChecker+Valid, 15489 SdHoareTripleChecker+Invalid, 5249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 5163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:45,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3310 Valid, 15489 Invalid, 5249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 5163 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-03 16:38:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282877 states. [2022-03-03 16:38:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282877 to 169807. [2022-03-03 16:38:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169807 states, 169803 states have (on average 3.083060958875874) internal successors, (523513), 169806 states have internal predecessors, (523513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169807 states to 169807 states and 523513 transitions. [2022-03-03 16:38:52,541 INFO L78 Accepts]: Start accepts. Automaton has 169807 states and 523513 transitions. Word has length 114 [2022-03-03 16:38:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:52,542 INFO L470 AbstractCegarLoop]: Abstraction has 169807 states and 523513 transitions. [2022-03-03 16:38:52,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 169807 states and 523513 transitions. [2022-03-03 16:38:52,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:38:52,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:52,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:38:52,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-03 16:38:52,745 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:38:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash 285505966, now seen corresponding path program 38 times [2022-03-03 16:38:52,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:52,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728283500] [2022-03-03 16:38:52,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:38:53,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:53,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728283500] [2022-03-03 16:38:53,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728283500] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:53,942 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:53,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:38:53,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793587692] [2022-03-03 16:38:53,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:53,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:38:53,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:53,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:38:53,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:38:53,943 INFO L87 Difference]: Start difference. First operand 169807 states and 523513 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:05,821 INFO L93 Difference]: Finished difference Result 279508 states and 861524 transitions. [2022-03-03 16:39:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-03 16:39:05,822 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:39:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:07,168 INFO L225 Difference]: With dead ends: 279508 [2022-03-03 16:39:07,169 INFO L226 Difference]: Without dead ends: 279508 [2022-03-03 16:39:07,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=2149, Invalid=5161, Unknown=0, NotChecked=0, Total=7310 [2022-03-03 16:39:07,170 INFO L933 BasicCegarLoop]: 1511 mSDtfsCounter, 2993 mSDsluCounter, 14138 mSDsCounter, 0 mSdLazyCounter, 5326 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 15649 SdHoareTripleChecker+Invalid, 5412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 5326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:07,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2993 Valid, 15649 Invalid, 5412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 5326 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-03 16:39:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279508 states. [2022-03-03 16:39:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279508 to 168124. [2022-03-03 16:39:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168124 states, 168120 states have (on average 3.0828872234118485) internal successors, (518295), 168123 states have internal predecessors, (518295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168124 states to 168124 states and 518295 transitions. [2022-03-03 16:39:12,782 INFO L78 Accepts]: Start accepts. Automaton has 168124 states and 518295 transitions. Word has length 114 [2022-03-03 16:39:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:12,782 INFO L470 AbstractCegarLoop]: Abstraction has 168124 states and 518295 transitions. [2022-03-03 16:39:12,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 168124 states and 518295 transitions. [2022-03-03 16:39:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:39:13,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:13,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:39:13,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-03 16:39:13,365 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:39:13,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2084097448, now seen corresponding path program 39 times [2022-03-03 16:39:13,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:13,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750307966] [2022-03-03 16:39:13,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:13,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:13,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750307966] [2022-03-03 16:39:13,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750307966] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:13,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:13,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:39:13,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493011137] [2022-03-03 16:39:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:13,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:39:13,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:13,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:39:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:39:13,990 INFO L87 Difference]: Start difference. First operand 168124 states and 518295 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:21,359 INFO L93 Difference]: Finished difference Result 266110 states and 820035 transitions. [2022-03-03 16:39:21,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:39:21,359 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:39:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:22,296 INFO L225 Difference]: With dead ends: 266110 [2022-03-03 16:39:22,296 INFO L226 Difference]: Without dead ends: 266110 [2022-03-03 16:39:22,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1282, Invalid=3688, Unknown=0, NotChecked=0, Total=4970 [2022-03-03 16:39:22,297 INFO L933 BasicCegarLoop]: 1046 mSDtfsCounter, 3112 mSDsluCounter, 11864 mSDsCounter, 0 mSdLazyCounter, 4461 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3112 SdHoareTripleChecker+Valid, 12910 SdHoareTripleChecker+Invalid, 4524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:22,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3112 Valid, 12910 Invalid, 4524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4461 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 16:39:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266110 states. [2022-03-03 16:39:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266110 to 171589. [2022-03-03 16:39:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171589 states, 171585 states have (on average 3.0842905848413324) internal successors, (529218), 171588 states have internal predecessors, (529218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171589 states to 171589 states and 529218 transitions. [2022-03-03 16:39:28,522 INFO L78 Accepts]: Start accepts. Automaton has 171589 states and 529218 transitions. Word has length 114 [2022-03-03 16:39:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:28,522 INFO L470 AbstractCegarLoop]: Abstraction has 171589 states and 529218 transitions. [2022-03-03 16:39:28,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 171589 states and 529218 transitions. [2022-03-03 16:39:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:39:28,797 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:28,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:39:28,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-03 16:39:28,798 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:39:28,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:28,798 INFO L85 PathProgramCache]: Analyzing trace with hash 728593944, now seen corresponding path program 40 times [2022-03-03 16:39:28,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:28,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878457292] [2022-03-03 16:39:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:28,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:29,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:29,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878457292] [2022-03-03 16:39:29,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878457292] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:29,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:29,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:39:29,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136798721] [2022-03-03 16:39:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:29,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:39:29,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:39:29,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:39:29,399 INFO L87 Difference]: Start difference. First operand 171589 states and 529218 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:37,003 INFO L93 Difference]: Finished difference Result 276175 states and 851492 transitions. [2022-03-03 16:39:37,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 16:39:37,003 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 16:39:37,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:38,237 INFO L225 Difference]: With dead ends: 276175 [2022-03-03 16:39:38,237 INFO L226 Difference]: Without dead ends: 276175 [2022-03-03 16:39:38,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1527, Invalid=4325, Unknown=0, NotChecked=0, Total=5852 [2022-03-03 16:39:38,238 INFO L933 BasicCegarLoop]: 1170 mSDtfsCounter, 3203 mSDsluCounter, 12633 mSDsCounter, 0 mSdLazyCounter, 4639 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3203 SdHoareTripleChecker+Valid, 13803 SdHoareTripleChecker+Invalid, 4714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 4639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:38,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3203 Valid, 13803 Invalid, 4714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4639 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 16:39:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276175 states. [2022-03-03 16:39:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276175 to 171952. [2022-03-03 16:39:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171952 states, 171948 states have (on average 3.0843685300207038) internal successors, (530351), 171951 states have internal predecessors, (530351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171952 states to 171952 states and 530351 transitions. [2022-03-03 16:39:44,035 INFO L78 Accepts]: Start accepts. Automaton has 171952 states and 530351 transitions. Word has length 114 [2022-03-03 16:39:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:44,036 INFO L470 AbstractCegarLoop]: Abstraction has 171952 states and 530351 transitions. [2022-03-03 16:39:44,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 171952 states and 530351 transitions. [2022-03-03 16:39:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 16:39:44,268 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:44,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:39:44,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-03 16:39:44,269 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-03 16:39:44,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash -832868640, now seen corresponding path program 41 times [2022-03-03 16:39:44,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:44,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692520136] [2022-03-03 16:39:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:44,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:44,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692520136] [2022-03-03 16:39:44,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692520136] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:44,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:44,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:39:44,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307074321] [2022-03-03 16:39:44,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:44,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:39:44,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:44,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:39:44,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:39:44,803 INFO L87 Difference]: Start difference. First operand 171952 states and 530351 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)