/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-c7b2d19 [2022-03-15 13:18:42,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 13:18:42,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 13:18:42,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 13:18:42,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 13:18:42,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 13:18:42,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 13:18:42,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 13:18:42,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 13:18:42,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 13:18:42,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 13:18:42,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 13:18:42,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 13:18:42,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 13:18:42,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 13:18:42,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 13:18:42,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 13:18:42,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 13:18:42,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 13:18:42,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 13:18:42,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 13:18:42,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 13:18:42,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 13:18:42,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 13:18:42,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 13:18:42,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 13:18:42,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 13:18:42,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 13:18:42,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 13:18:42,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 13:18:42,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 13:18:42,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 13:18:42,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 13:18:42,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 13:18:42,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 13:18:42,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 13:18:42,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 13:18:42,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 13:18:42,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 13:18:42,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 13:18:42,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 13:18:42,925 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-15 13:18:42,952 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 13:18:42,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 13:18:42,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 13:18:42,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 13:18:42,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 13:18:42,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 13:18:42,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 13:18:42,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 13:18:42,954 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 13:18:42,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 13:18:42,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 13:18:42,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 13:18:42,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 13:18:42,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 13:18:42,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 13:18:42,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 13:18:42,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 13:18:42,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 13:18:42,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 13:18:42,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 13:18:42,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 13:18:42,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 13:18:42,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 13:18:42,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 13:18:42,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 13:18:42,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 13:18:42,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 13:18:42,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 13:18:42,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 13:18:42,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 13:18:42,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 13:18:42,958 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 13:18:42,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 13:18:42,959 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-15 13:18:43,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 13:18:43,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 13:18:43,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 13:18:43,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 13:18:43,159 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 13:18:43,160 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-15 13:18:43,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83ca2660/46b4589767504dc5a158e1ade9eebd5b/FLAGc718f5c86 [2022-03-15 13:18:43,749 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 13:18:43,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-03-15 13:18:43,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83ca2660/46b4589767504dc5a158e1ade9eebd5b/FLAGc718f5c86 [2022-03-15 13:18:44,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83ca2660/46b4589767504dc5a158e1ade9eebd5b [2022-03-15 13:18:44,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 13:18:44,214 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 13:18:44,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 13:18:44,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 13:18:44,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 13:18:44,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b3cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44, skipping insertion in model container [2022-03-15 13:18:44,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 13:18:44,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 13:18:44,404 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-15 13:18:44,630 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-15 13:18:44,634 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-15 13:18:44,634 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-15 13:18:44,677 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-15 13:18:44,678 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-15 13:18:44,681 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-15 13:18:44,682 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-15 13:18:44,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 13:18:44,695 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 13:18:44,712 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-15 13:18:44,739 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-15 13:18:44,739 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-15 13:18:44,740 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-15 13:18:44,746 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-15 13:18:44,746 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-15 13:18:44,747 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-15 13:18:44,759 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-15 13:18:44,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 13:18:44,812 INFO L208 MainTranslator]: Completed translation [2022-03-15 13:18:44,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44 WrapperNode [2022-03-15 13:18:44,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 13:18:44,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 13:18:44,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 13:18:44,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 13:18:44,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,863 INFO L137 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2022-03-15 13:18:44,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 13:18:44,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 13:18:44,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 13:18:44,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 13:18:44,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 13:18:44,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 13:18:44,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 13:18:44,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 13:18:44,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44" (1/1) ... [2022-03-15 13:18:44,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 13:18:44,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 13:18:44,932 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-15 13:18:44,950 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-15 13:18:44,960 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-03-15 13:18:44,961 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-03-15 13:18:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-03-15 13:18:44,961 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-03-15 13:18:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 13:18:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 13:18:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 13:18:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 13:18:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 13:18:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 13:18:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 13:18:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 13:18:44,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 13:18:44,962 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 13:18:45,058 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 13:18:45,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 13:18:45,280 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 13:18:45,286 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 13:18:45,287 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-15 13:18:45,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:18:45 BoogieIcfgContainer [2022-03-15 13:18:45,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 13:18:45,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 13:18:45,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 13:18:45,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 13:18:45,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:18:44" (1/3) ... [2022-03-15 13:18:45,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a00989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:18:45, skipping insertion in model container [2022-03-15 13:18:45,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:44" (2/3) ... [2022-03-15 13:18:45,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a00989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:18:45, skipping insertion in model container [2022-03-15 13:18:45,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:18:45" (3/3) ... [2022-03-15 13:18:45,293 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-03-15 13:18:45,296 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 13:18:45,296 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 13:18:45,296 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-03-15 13:18:45,296 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 13:18:45,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,335 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,335 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,335 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,335 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,335 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,335 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,338 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,338 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,338 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,338 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,338 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,338 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,338 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,342 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-15 13:18:45,342 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-15 13:18:45,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,342 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-15 13:18:45,342 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-15 13:18:45,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,344 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-15 13:18:45,344 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-15 13:18:45,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,344 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-15 13:18:45,344 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-15 13:18:45,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,349 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-15 13:18:45,349 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-15 13:18:45,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,349 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-15 13:18:45,349 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-15 13:18:45,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,351 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-15 13:18:45,351 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-15 13:18:45,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,351 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-15 13:18:45,351 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-15 13:18:45,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,367 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,367 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,383 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,385 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,385 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,385 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,385 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,398 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,398 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,398 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,398 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,398 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,398 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,399 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,399 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,399 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,399 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,399 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,399 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,399 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,399 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,399 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,399 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,400 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,400 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,400 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,400 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,400 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,400 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,400 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,400 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,401 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,401 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,401 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,401 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,401 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,401 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,402 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,402 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,402 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,402 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,402 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,402 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,402 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,403 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,403 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-15 13:18:45,403 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-15 13:18:45,403 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,403 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,403 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,403 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,403 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-15 13:18:45,403 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-15 13:18:45,404 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,404 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,404 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,404 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,404 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,404 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,404 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,404 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,404 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,404 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,405 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,405 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,405 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,405 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,405 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-15 13:18:45,405 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-15 13:18:45,405 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,405 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,405 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-15 13:18:45,405 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-15 13:18:45,405 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,406 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,406 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,406 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,406 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,406 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,406 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,406 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,406 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,407 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,407 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,407 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,407 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,407 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,407 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,407 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,407 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,407 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,408 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,408 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,408 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,408 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,408 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,408 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,409 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,409 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,409 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,409 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,409 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,409 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,409 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,409 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,410 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,410 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,410 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,410 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,411 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,411 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,411 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,411 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,412 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,412 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,412 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,412 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,412 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,412 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,412 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,412 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,412 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,413 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,413 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,413 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,413 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,413 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,413 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,413 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,413 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,414 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,414 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,414 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,414 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,414 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,415 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,415 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,415 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,415 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,415 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,415 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,416 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,416 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,416 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,416 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,416 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,416 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,418 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,418 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,419 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,419 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,419 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,436 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-15 13:18:45,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,436 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-15 13:18:45,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,439 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,439 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-15 13:18:45,439 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,439 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,439 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-15 13:18:45,439 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,439 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,439 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,439 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,440 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,440 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,440 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,440 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,440 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,440 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,440 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,440 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,440 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,440 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,441 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,441 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,441 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,441 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,441 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,441 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,441 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-15 13:18:45,441 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,441 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,442 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,442 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,442 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,442 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,442 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,442 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-15 13:18:45,442 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:45,445 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 13:18:45,478 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 13:18:45,482 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-15 13:18:45,482 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-03-15 13:18:45,495 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 223 places, 233 transitions, 482 flow [2022-03-15 13:18:48,030 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-15 13:18:48,184 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-15 13:18:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-15 13:18:48,505 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:18:48,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] [2022-03-15 13:18:48,506 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-15 13:18:48,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:18:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash 508547485, now seen corresponding path program 1 times [2022-03-15 13:18:48,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:18:48,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439010345] [2022-03-15 13:18:48,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:18:48,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:18:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:18:49,142 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-15 13:18:49,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:18:49,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439010345] [2022-03-15 13:18:49,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439010345] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:18:49,143 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:18:49,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-15 13:18:49,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335428675] [2022-03-15 13:18:49,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:18:49,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 13:18:49,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:18:49,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 13:18:49,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-03-15 13:18:49,457 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-15 13:18:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:18:52,448 INFO L93 Difference]: Finished difference Result 119975 states and 368792 transitions. [2022-03-15 13:18:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 13:18:52,450 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-15 13:18:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:18:53,093 INFO L225 Difference]: With dead ends: 119975 [2022-03-15 13:18:53,093 INFO L226 Difference]: Without dead ends: 119915 [2022-03-15 13:18:53,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=436, Invalid=1204, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 13:18:53,099 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 1275 mSDsluCounter, 3807 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-15 13:18:53,100 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.5s Time] [2022-03-15 13:18:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119915 states. [2022-03-15 13:18:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119915 to 113165. [2022-03-15 13:18:57,036 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-15 13:18:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113165 states to 113165 states and 348092 transitions. [2022-03-15 13:18:57,888 INFO L78 Accepts]: Start accepts. Automaton has 113165 states and 348092 transitions. Word has length 90 [2022-03-15 13:18:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:18:57,889 INFO L470 AbstractCegarLoop]: Abstraction has 113165 states and 348092 transitions. [2022-03-15 13:18:57,890 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-15 13:18:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 113165 states and 348092 transitions. [2022-03-15 13:18:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-03-15 13:18:57,995 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:18:57,995 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-15 13:18:57,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 13:18:57,996 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-15 13:18:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:18:57,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1144672626, now seen corresponding path program 1 times [2022-03-15 13:18:57,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:18:58,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453565531] [2022-03-15 13:18:58,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:18:58,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:18:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:18:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:18:58,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:18:58,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453565531] [2022-03-15 13:18:58,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453565531] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:18:58,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:18:58,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-15 13:18:58,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617313791] [2022-03-15 13:18:58,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:18:58,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 13:18:58,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:18:58,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 13:18:58,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-03-15 13:18:58,454 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-15 13:19:01,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:19:01,580 INFO L93 Difference]: Finished difference Result 155725 states and 478789 transitions. [2022-03-15 13:19:01,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 13:19:01,581 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-15 13:19:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:19:02,146 INFO L225 Difference]: With dead ends: 155725 [2022-03-15 13:19:02,146 INFO L226 Difference]: Without dead ends: 154885 [2022-03-15 13:19:02,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=389, Invalid=1093, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 13:19:02,149 INFO L933 BasicCegarLoop]: 638 mSDtfsCounter, 2395 mSDsluCounter, 4890 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:19:02,150 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.9s Time] [2022-03-15 13:19:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154885 states. [2022-03-15 13:19:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154885 to 132244. [2022-03-15 13:19:05,735 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-15 13:19:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132244 states to 132244 states and 406952 transitions. [2022-03-15 13:19:06,441 INFO L78 Accepts]: Start accepts. Automaton has 132244 states and 406952 transitions. Word has length 95 [2022-03-15 13:19:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:19:06,443 INFO L470 AbstractCegarLoop]: Abstraction has 132244 states and 406952 transitions. [2022-03-15 13:19:06,443 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-15 13:19:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 132244 states and 406952 transitions. [2022-03-15 13:19:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:19:06,569 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:19:06,570 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-15 13:19:06,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 13:19:06,570 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-15 13:19:06,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:19:06,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1175061358, now seen corresponding path program 1 times [2022-03-15 13:19:06,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:19:06,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464684470] [2022-03-15 13:19:06,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:19:06,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:19:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:19:07,629 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-15 13:19:07,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:19:07,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464684470] [2022-03-15 13:19:07,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464684470] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:19:07,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:19:07,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:19:07,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576779627] [2022-03-15 13:19:07,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:19:07,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:19:07,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:19:07,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:19:07,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:19:07,633 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-15 13:19:14,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:19:14,307 INFO L93 Difference]: Finished difference Result 156625 states and 481546 transitions. [2022-03-15 13:19:14,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 13:19:14,308 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-15 13:19:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:19:14,905 INFO L225 Difference]: With dead ends: 156625 [2022-03-15 13:19:14,905 INFO L226 Difference]: Without dead ends: 156625 [2022-03-15 13:19:14,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1568, Invalid=4284, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 13:19:14,907 INFO L933 BasicCegarLoop]: 1139 mSDtfsCounter, 3939 mSDsluCounter, 7701 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3939 SdHoareTripleChecker+Valid, 8840 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:19:14,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3939 Valid, 8840 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 13:19:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156625 states. [2022-03-15 13:19:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156625 to 133003. [2022-03-15 13:19:18,653 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-15 13:19:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133003 states to 133003 states and 409311 transitions. [2022-03-15 13:19:19,114 INFO L78 Accepts]: Start accepts. Automaton has 133003 states and 409311 transitions. Word has length 114 [2022-03-15 13:19:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:19:19,116 INFO L470 AbstractCegarLoop]: Abstraction has 133003 states and 409311 transitions. [2022-03-15 13:19:19,116 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-15 13:19:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 133003 states and 409311 transitions. [2022-03-15 13:19:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:19:19,601 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:19:19,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:19:19,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 13:19:19,601 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-15 13:19:19,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:19:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash 788572584, now seen corresponding path program 2 times [2022-03-15 13:19:19,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:19:19,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237318353] [2022-03-15 13:19:19,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:19:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:19:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:19:20,286 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-15 13:19:20,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:19:20,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237318353] [2022-03-15 13:19:20,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237318353] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:19:20,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:19:20,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-15 13:19:20,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882967868] [2022-03-15 13:19:20,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:19:20,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 13:19:20,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:19:20,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 13:19:20,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-03-15 13:19:20,288 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-15 13:19:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:19:26,538 INFO L93 Difference]: Finished difference Result 166429 states and 511686 transitions. [2022-03-15 13:19:26,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 13:19:26,539 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-15 13:19:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:19:27,040 INFO L225 Difference]: With dead ends: 166429 [2022-03-15 13:19:27,040 INFO L226 Difference]: Without dead ends: 166429 [2022-03-15 13:19:27,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1293, Invalid=3129, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 13:19:27,042 INFO L933 BasicCegarLoop]: 1055 mSDtfsCounter, 3226 mSDsluCounter, 7751 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:19:27,042 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.2s Time] [2022-03-15 13:19:27,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166429 states. [2022-03-15 13:19:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166429 to 135742. [2022-03-15 13:19:30,589 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-15 13:19:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135742 states to 135742 states and 417729 transitions. [2022-03-15 13:19:31,390 INFO L78 Accepts]: Start accepts. Automaton has 135742 states and 417729 transitions. Word has length 114 [2022-03-15 13:19:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:19:31,391 INFO L470 AbstractCegarLoop]: Abstraction has 135742 states and 417729 transitions. [2022-03-15 13:19:31,392 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-15 13:19:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 135742 states and 417729 transitions. [2022-03-15 13:19:31,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:19:31,527 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:19:31,527 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-15 13:19:31,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 13:19:31,527 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-15 13:19:31,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:19:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash 124783814, now seen corresponding path program 3 times [2022-03-15 13:19:31,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:19:31,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230781521] [2022-03-15 13:19:31,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:19:31,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:19:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:19:32,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-15 13:19:32,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:19:32,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230781521] [2022-03-15 13:19:32,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230781521] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:19:32,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:19:32,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:19:32,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461638563] [2022-03-15 13:19:32,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:19:32,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:19:32,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:19:32,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:19:32,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:19:32,523 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-15 13:19:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:19:40,382 INFO L93 Difference]: Finished difference Result 178621 states and 549053 transitions. [2022-03-15 13:19:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 13:19:40,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-15 13:19:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:19:41,171 INFO L225 Difference]: With dead ends: 178621 [2022-03-15 13:19:41,171 INFO L226 Difference]: Without dead ends: 178621 [2022-03-15 13:19:41,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1794, Invalid=5012, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 13:19:41,173 INFO L933 BasicCegarLoop]: 1205 mSDtfsCounter, 4231 mSDsluCounter, 9352 mSDsCounter, 0 mSdLazyCounter, 3232 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.4s IncrementalHoareTripleChecker+Time [2022-03-15 13:19:41,173 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.4s Time] [2022-03-15 13:19:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178621 states. [2022-03-15 13:19:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178621 to 136501. [2022-03-15 13:19:45,103 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-15 13:19:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136501 states to 136501 states and 420088 transitions. [2022-03-15 13:19:45,951 INFO L78 Accepts]: Start accepts. Automaton has 136501 states and 420088 transitions. Word has length 114 [2022-03-15 13:19:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:19:45,951 INFO L470 AbstractCegarLoop]: Abstraction has 136501 states and 420088 transitions. [2022-03-15 13:19:45,951 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-15 13:19:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 136501 states and 420088 transitions. [2022-03-15 13:19:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:19:46,206 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:19:46,207 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-15 13:19:46,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 13:19:46,207 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-15 13:19:46,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:19:46,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2145687926, now seen corresponding path program 4 times [2022-03-15 13:19:46,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:19:46,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184701036] [2022-03-15 13:19:46,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:19:46,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:19:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:19:47,042 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-15 13:19:47,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:19:47,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184701036] [2022-03-15 13:19:47,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184701036] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:19:47,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:19:47,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:19:47,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169377893] [2022-03-15 13:19:47,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:19:47,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:19:47,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:19:47,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:19:47,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:19:47,044 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-15 13:19:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:19:55,295 INFO L93 Difference]: Finished difference Result 178486 states and 548701 transitions. [2022-03-15 13:19:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 13:19:55,296 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-15 13:19:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:19:55,906 INFO L225 Difference]: With dead ends: 178486 [2022-03-15 13:19:55,906 INFO L226 Difference]: Without dead ends: 178486 [2022-03-15 13:19:55,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1921, Invalid=5389, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 13:19:55,908 INFO L933 BasicCegarLoop]: 1266 mSDtfsCounter, 3659 mSDsluCounter, 11889 mSDsCounter, 0 mSdLazyCounter, 4124 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2022-03-15 13:19:55,908 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.8s Time] [2022-03-15 13:19:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178486 states. [2022-03-15 13:19:59,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178486 to 136699. [2022-03-15 13:19:59,318 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-15 13:20:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136699 states to 136699 states and 420714 transitions. [2022-03-15 13:20:00,151 INFO L78 Accepts]: Start accepts. Automaton has 136699 states and 420714 transitions. Word has length 114 [2022-03-15 13:20:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:20:00,151 INFO L470 AbstractCegarLoop]: Abstraction has 136699 states and 420714 transitions. [2022-03-15 13:20:00,151 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-15 13:20:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 136699 states and 420714 transitions. [2022-03-15 13:20:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:20:00,281 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:20:00,287 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-15 13:20:00,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 13:20:00,288 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-15 13:20:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:20:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash 793775866, now seen corresponding path program 5 times [2022-03-15 13:20:00,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:20:00,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334767037] [2022-03-15 13:20:00,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:20:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:20:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:20:01,030 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-15 13:20:01,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:20:01,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334767037] [2022-03-15 13:20:01,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334767037] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:20:01,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:20:01,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:20:01,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218916748] [2022-03-15 13:20:01,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:20:01,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:20:01,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:20:01,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:20:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:20:01,032 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-15 13:20:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:20:10,697 INFO L93 Difference]: Finished difference Result 177595 states and 545975 transitions. [2022-03-15 13:20:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 13:20:10,697 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-15 13:20:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:20:11,162 INFO L225 Difference]: With dead ends: 177595 [2022-03-15 13:20:11,162 INFO L226 Difference]: Without dead ends: 177595 [2022-03-15 13:20:11,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2184, Invalid=6188, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 13:20:11,164 INFO L933 BasicCegarLoop]: 1390 mSDtfsCounter, 3404 mSDsluCounter, 13145 mSDsCounter, 0 mSdLazyCounter, 4634 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:20:11,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3404 Valid, 14535 Invalid, 4714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4634 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 13:20:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177595 states. [2022-03-15 13:20:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177595 to 137062. [2022-03-15 13:20:14,803 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-15 13:20:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137062 states to 137062 states and 421847 transitions. [2022-03-15 13:20:15,597 INFO L78 Accepts]: Start accepts. Automaton has 137062 states and 421847 transitions. Word has length 114 [2022-03-15 13:20:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:20:15,598 INFO L470 AbstractCegarLoop]: Abstraction has 137062 states and 421847 transitions. [2022-03-15 13:20:15,598 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-15 13:20:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 137062 states and 421847 transitions. [2022-03-15 13:20:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:20:15,715 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:20:15,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:20:15,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 13:20:15,715 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-15 13:20:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:20:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash -767686718, now seen corresponding path program 6 times [2022-03-15 13:20:15,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:20:15,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259214330] [2022-03-15 13:20:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:20:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:20:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:20:16,340 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-15 13:20:16,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:20:16,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259214330] [2022-03-15 13:20:16,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259214330] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:20:16,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:20:16,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:20:16,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749324163] [2022-03-15 13:20:16,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:20:16,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:20:16,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:20:16,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:20:16,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:20:16,342 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-15 13:20:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:20:26,183 INFO L93 Difference]: Finished difference Result 176737 states and 543243 transitions. [2022-03-15 13:20:26,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-03-15 13:20:26,184 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-15 13:20:26,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:20:26,657 INFO L225 Difference]: With dead ends: 176737 [2022-03-15 13:20:26,657 INFO L226 Difference]: Without dead ends: 176737 [2022-03-15 13:20:26,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2492, Invalid=7014, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 13:20:26,659 INFO L933 BasicCegarLoop]: 1496 mSDtfsCounter, 3351 mSDsluCounter, 14035 mSDsCounter, 0 mSdLazyCounter, 4966 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:20:26,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3351 Valid, 15531 Invalid, 5053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 4966 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 13:20:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176737 states. [2022-03-15 13:20:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176737 to 137095. [2022-03-15 13:20:30,309 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-15 13:20:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137095 states to 137095 states and 421947 transitions. [2022-03-15 13:20:31,161 INFO L78 Accepts]: Start accepts. Automaton has 137095 states and 421947 transitions. Word has length 114 [2022-03-15 13:20:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:20:31,161 INFO L470 AbstractCegarLoop]: Abstraction has 137095 states and 421947 transitions. [2022-03-15 13:20:31,161 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-15 13:20:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 137095 states and 421947 transitions. [2022-03-15 13:20:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:20:31,480 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:20:31,480 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-15 13:20:31,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 13:20:31,480 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-15 13:20:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:20:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1979149546, now seen corresponding path program 7 times [2022-03-15 13:20:31,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:20:31,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534149251] [2022-03-15 13:20:31,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:20:31,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:20:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:20:32,452 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-15 13:20:32,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:20:32,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534149251] [2022-03-15 13:20:32,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534149251] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:20:32,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:20:32,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:20:32,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829954617] [2022-03-15 13:20:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:20:32,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:20:32,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:20:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:20:32,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:20:32,454 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-15 13:20:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:20:44,423 INFO L93 Difference]: Finished difference Result 168406 states and 517694 transitions. [2022-03-15 13:20:44,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 13:20:44,423 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-15 13:20:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:20:44,868 INFO L225 Difference]: With dead ends: 168406 [2022-03-15 13:20:44,868 INFO L226 Difference]: Without dead ends: 168406 [2022-03-15 13:20:44,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2323, Invalid=5687, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 13:20:44,870 INFO L933 BasicCegarLoop]: 1500 mSDtfsCounter, 3033 mSDsluCounter, 11199 mSDsCounter, 0 mSdLazyCounter, 3883 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 13:20:44,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3033 Valid, 12699 Invalid, 3977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3883 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 13:20:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168406 states. [2022-03-15 13:20:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168406 to 142999. [2022-03-15 13:20:48,779 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-15 13:20:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142999 states to 142999 states and 440338 transitions. [2022-03-15 13:20:49,189 INFO L78 Accepts]: Start accepts. Automaton has 142999 states and 440338 transitions. Word has length 114 [2022-03-15 13:20:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:20:49,189 INFO L470 AbstractCegarLoop]: Abstraction has 142999 states and 440338 transitions. [2022-03-15 13:20:49,189 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-15 13:20:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 142999 states and 440338 transitions. [2022-03-15 13:20:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:20:49,670 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:20:49,670 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-15 13:20:49,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 13:20:49,670 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-15 13:20:49,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:20:49,670 INFO L85 PathProgramCache]: Analyzing trace with hash -386091310, now seen corresponding path program 8 times [2022-03-15 13:20:49,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:20:49,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014296165] [2022-03-15 13:20:49,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:20:49,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:20:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:20:50,309 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-15 13:20:50,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:20:50,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014296165] [2022-03-15 13:20:50,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014296165] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:20:50,310 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:20:50,310 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:20:50,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239489558] [2022-03-15 13:20:50,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:20:50,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:20:50,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:20:50,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:20:50,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:20:50,311 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-15 13:20:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:20:56,599 INFO L93 Difference]: Finished difference Result 187159 states and 575304 transitions. [2022-03-15 13:20:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 13:20:56,611 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-15 13:20:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:20:57,093 INFO L225 Difference]: With dead ends: 187159 [2022-03-15 13:20:57,095 INFO L226 Difference]: Without dead ends: 187159 [2022-03-15 13:20:57,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 13:20:57,098 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 3419 mSDsluCounter, 9889 mSDsCounter, 0 mSdLazyCounter, 3421 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:20:57,098 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.2s Time] [2022-03-15 13:20:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187159 states. [2022-03-15 13:21:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187159 to 144220. [2022-03-15 13:21:00,667 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-15 13:21:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144220 states to 144220 states and 444097 transitions. [2022-03-15 13:21:01,494 INFO L78 Accepts]: Start accepts. Automaton has 144220 states and 444097 transitions. Word has length 114 [2022-03-15 13:21:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:21:01,494 INFO L470 AbstractCegarLoop]: Abstraction has 144220 states and 444097 transitions. [2022-03-15 13:21:01,494 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-15 13:21:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 144220 states and 444097 transitions. [2022-03-15 13:21:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:21:01,622 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:21:01,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:21:01,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 13:21:01,622 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-15 13:21:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:21:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1049880080, now seen corresponding path program 9 times [2022-03-15 13:21:01,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:21:01,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347448867] [2022-03-15 13:21:01,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:21:01,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:21:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:21:02,305 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-15 13:21:02,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:21:02,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347448867] [2022-03-15 13:21:02,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347448867] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:21:02,305 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:21:02,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:21:02,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641470108] [2022-03-15 13:21:02,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:21:02,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:21:02,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:21:02,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:21:02,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:21:02,306 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-15 13:21:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:21:09,823 INFO L93 Difference]: Finished difference Result 197656 states and 607643 transitions. [2022-03-15 13:21:09,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 13:21:09,824 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-15 13:21:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:21:10,547 INFO L225 Difference]: With dead ends: 197656 [2022-03-15 13:21:10,549 INFO L226 Difference]: Without dead ends: 197656 [2022-03-15 13:21:10,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1587, Invalid=4419, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 13:21:10,549 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 3309 mSDsluCounter, 12865 mSDsCounter, 0 mSdLazyCounter, 4582 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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-15 13:21:10,550 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-15 13:21:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197656 states. [2022-03-15 13:21:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197656 to 144253. [2022-03-15 13:21:14,428 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-15 13:21:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144253 states to 144253 states and 444197 transitions. [2022-03-15 13:21:15,251 INFO L78 Accepts]: Start accepts. Automaton has 144253 states and 444197 transitions. Word has length 114 [2022-03-15 13:21:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:21:15,251 INFO L470 AbstractCegarLoop]: Abstraction has 144253 states and 444197 transitions. [2022-03-15 13:21:15,251 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-15 13:21:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 144253 states and 444197 transitions. [2022-03-15 13:21:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:21:15,391 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:21:15,392 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-15 13:21:15,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 13:21:15,392 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-15 13:21:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:21:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash 974615476, now seen corresponding path program 10 times [2022-03-15 13:21:15,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:21:15,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009609549] [2022-03-15 13:21:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:21:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:21:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:21:15,995 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-15 13:21:15,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:21:15,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009609549] [2022-03-15 13:21:15,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009609549] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:21:15,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:21:15,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:21:15,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150582244] [2022-03-15 13:21:15,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:21:15,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:21:15,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:21:15,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:21:15,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:21:15,997 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-15 13:21:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:21:24,600 INFO L93 Difference]: Finished difference Result 196795 states and 605032 transitions. [2022-03-15 13:21:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 13:21:24,601 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-15 13:21:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:21:25,276 INFO L225 Difference]: With dead ends: 196795 [2022-03-15 13:21:25,276 INFO L226 Difference]: Without dead ends: 196795 [2022-03-15 13:21:25,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1708, Invalid=4772, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 13:21:25,277 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 3302 mSDsluCounter, 13275 mSDsCounter, 0 mSdLazyCounter, 4753 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:21:25,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3302 Valid, 14532 Invalid, 4823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4753 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 13:21:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196795 states. [2022-03-15 13:21:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196795 to 144451. [2022-03-15 13:21:29,236 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-15 13:21:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144451 states to 144451 states and 444823 transitions. [2022-03-15 13:21:30,301 INFO L78 Accepts]: Start accepts. Automaton has 144451 states and 444823 transitions. Word has length 114 [2022-03-15 13:21:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:21:30,302 INFO L470 AbstractCegarLoop]: Abstraction has 144451 states and 444823 transitions. [2022-03-15 13:21:30,302 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-15 13:21:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 144451 states and 444823 transitions. [2022-03-15 13:21:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:21:30,449 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:21:30,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 13:21:30,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 13:21:30,449 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-15 13:21:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:21:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash -380888028, now seen corresponding path program 11 times [2022-03-15 13:21:30,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:21:30,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071397983] [2022-03-15 13:21:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:21:30,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:21:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:21:31,257 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-15 13:21:31,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:21:31,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071397983] [2022-03-15 13:21:31,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071397983] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:21:31,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:21:31,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:21:31,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793158805] [2022-03-15 13:21:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:21:31,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:21:31,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:21:31,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:21:31,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:21:31,259 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-15 13:21:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:21:40,330 INFO L93 Difference]: Finished difference Result 195904 states and 602306 transitions. [2022-03-15 13:21:40,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 13:21:40,330 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-15 13:21:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:21:41,222 INFO L225 Difference]: With dead ends: 195904 [2022-03-15 13:21:41,222 INFO L226 Difference]: Without dead ends: 195904 [2022-03-15 13:21:41,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1965, Invalid=5517, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 13:21:41,223 INFO L933 BasicCegarLoop]: 1381 mSDtfsCounter, 3295 mSDsluCounter, 14691 mSDsCounter, 0 mSdLazyCounter, 5180 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.6s IncrementalHoareTripleChecker+Time [2022-03-15 13:21:41,224 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.6s Time] [2022-03-15 13:21:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195904 states. [2022-03-15 13:21:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195904 to 144814. [2022-03-15 13:21:44,886 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-15 13:21:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144814 states to 144814 states and 445956 transitions. [2022-03-15 13:21:45,731 INFO L78 Accepts]: Start accepts. Automaton has 144814 states and 445956 transitions. Word has length 114 [2022-03-15 13:21:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:21:45,731 INFO L470 AbstractCegarLoop]: Abstraction has 144814 states and 445956 transitions. [2022-03-15 13:21:45,731 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-15 13:21:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 144814 states and 445956 transitions. [2022-03-15 13:21:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:21:45,858 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:21:45,858 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-15 13:21:45,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 13:21:45,859 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-15 13:21:45,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:21:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1942350612, now seen corresponding path program 12 times [2022-03-15 13:21:45,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:21:45,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285618470] [2022-03-15 13:21:45,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:21:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:21:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:21:46,476 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-15 13:21:46,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:21:46,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285618470] [2022-03-15 13:21:46,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285618470] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:21:46,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:21:46,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:21:46,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275515848] [2022-03-15 13:21:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:21:46,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:21:46,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:21:46,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:21:46,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:21:46,478 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-15 13:21:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:21:56,030 INFO L93 Difference]: Finished difference Result 195046 states and 599574 transitions. [2022-03-15 13:21:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 13:21:56,030 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-15 13:21:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:21:56,857 INFO L225 Difference]: With dead ends: 195046 [2022-03-15 13:21:56,858 INFO L226 Difference]: Without dead ends: 195046 [2022-03-15 13:21:56,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2261, Invalid=6295, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 13:21:56,859 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 3048 mSDsluCounter, 17165 mSDsCounter, 0 mSdLazyCounter, 6128 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.7s IncrementalHoareTripleChecker+Time [2022-03-15 13:21:56,859 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.7s Time] [2022-03-15 13:21:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195046 states. [2022-03-15 13:22:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195046 to 144847. [2022-03-15 13:22:00,461 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-15 13:22:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144847 states to 144847 states and 446056 transitions. [2022-03-15 13:22:01,312 INFO L78 Accepts]: Start accepts. Automaton has 144847 states and 446056 transitions. Word has length 114 [2022-03-15 13:22:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:22:01,313 INFO L470 AbstractCegarLoop]: Abstraction has 144847 states and 446056 transitions. [2022-03-15 13:22:01,313 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-15 13:22:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 144847 states and 446056 transitions. [2022-03-15 13:22:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:22:01,442 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:22:01,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:22:01,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 13:22:01,443 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-15 13:22:01,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:22:01,443 INFO L85 PathProgramCache]: Analyzing trace with hash 804485652, now seen corresponding path program 13 times [2022-03-15 13:22:01,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:22:01,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464193496] [2022-03-15 13:22:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:22:01,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:22:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:22:02,181 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-15 13:22:02,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:22:02,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464193496] [2022-03-15 13:22:02,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464193496] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:22:02,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:22:02,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:22:02,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451330811] [2022-03-15 13:22:02,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:22:02,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:22:02,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:22:02,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:22:02,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:22:02,183 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-15 13:22:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:22:10,890 INFO L93 Difference]: Finished difference Result 196747 states and 605065 transitions. [2022-03-15 13:22:10,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 13:22:10,891 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-15 13:22:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:22:11,767 INFO L225 Difference]: With dead ends: 196747 [2022-03-15 13:22:11,767 INFO L226 Difference]: Without dead ends: 196747 [2022-03-15 13:22:11,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2358, Invalid=5652, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 13:22:11,777 INFO L933 BasicCegarLoop]: 1492 mSDtfsCounter, 3385 mSDsluCounter, 11055 mSDsCounter, 0 mSdLazyCounter, 3901 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 13:22:11,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3385 Valid, 12547 Invalid, 3999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3901 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 13:22:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196747 states. [2022-03-15 13:22:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196747 to 155155. [2022-03-15 13:22:15,890 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-15 13:22:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155155 states to 155155 states and 478044 transitions. [2022-03-15 13:22:16,762 INFO L78 Accepts]: Start accepts. Automaton has 155155 states and 478044 transitions. Word has length 114 [2022-03-15 13:22:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:22:16,762 INFO L470 AbstractCegarLoop]: Abstraction has 155155 states and 478044 transitions. [2022-03-15 13:22:16,762 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-15 13:22:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 155155 states and 478044 transitions. [2022-03-15 13:22:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:22:16,945 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:22:16,946 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-15 13:22:16,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 13:22:16,946 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-15 13:22:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:22:16,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1129835852, now seen corresponding path program 14 times [2022-03-15 13:22:16,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:22:16,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146030158] [2022-03-15 13:22:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:22:16,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:22:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:22:17,653 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-15 13:22:17,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:22:17,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146030158] [2022-03-15 13:22:17,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146030158] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:22:17,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:22:17,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:22:17,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156268442] [2022-03-15 13:22:17,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:22:17,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:22:17,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:22:17,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:22:17,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:22:17,655 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-15 13:22:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:22:23,709 INFO L93 Difference]: Finished difference Result 198292 states and 609910 transitions. [2022-03-15 13:22:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 13:22:23,710 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-15 13:22:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:22:24,636 INFO L225 Difference]: With dead ends: 198292 [2022-03-15 13:22:24,637 INFO L226 Difference]: Without dead ends: 198292 [2022-03-15 13:22:24,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1377, Invalid=3879, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 13:22:24,637 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-15 13:22:24,638 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-15 13:22:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198292 states. [2022-03-15 13:22:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198292 to 156343. [2022-03-15 13:22:28,511 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-15 13:22:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156343 states to 156343 states and 481703 transitions. [2022-03-15 13:22:29,363 INFO L78 Accepts]: Start accepts. Automaton has 156343 states and 481703 transitions. Word has length 114 [2022-03-15 13:22:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:22:29,363 INFO L470 AbstractCegarLoop]: Abstraction has 156343 states and 481703 transitions. [2022-03-15 13:22:29,363 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-15 13:22:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 156343 states and 481703 transitions. [2022-03-15 13:22:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:22:29,505 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:22:29,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-15 13:22:29,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 13:22:29,505 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-15 13:22:29,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:22:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash 894659704, now seen corresponding path program 15 times [2022-03-15 13:22:29,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:22:29,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623320676] [2022-03-15 13:22:29,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:22:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:22:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:22:30,050 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-15 13:22:30,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:22:30,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623320676] [2022-03-15 13:22:30,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623320676] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:22:30,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:22:30,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:22:30,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516879889] [2022-03-15 13:22:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:22:30,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:22:30,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:22:30,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:22:30,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:22:30,053 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-15 13:22:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:22:37,587 INFO L93 Difference]: Finished difference Result 207565 states and 638538 transitions. [2022-03-15 13:22:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 13:22:37,587 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-15 13:22:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:22:38,512 INFO L225 Difference]: With dead ends: 207565 [2022-03-15 13:22:38,512 INFO L226 Difference]: Without dead ends: 207565 [2022-03-15 13:22:38,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1495, Invalid=4205, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 13:22:38,513 INFO L933 BasicCegarLoop]: 1147 mSDtfsCounter, 3195 mSDsluCounter, 12351 mSDsCounter, 0 mSdLazyCounter, 4475 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2022-03-15 13:22:38,513 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.0s Time] [2022-03-15 13:22:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207565 states. [2022-03-15 13:22:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207565 to 156541. [2022-03-15 13:22:42,633 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-15 13:22:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156541 states to 156541 states and 482329 transitions. [2022-03-15 13:22:43,100 INFO L78 Accepts]: Start accepts. Automaton has 156541 states and 482329 transitions. Word has length 114 [2022-03-15 13:22:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:22:43,100 INFO L470 AbstractCegarLoop]: Abstraction has 156541 states and 482329 transitions. [2022-03-15 13:22:43,100 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-15 13:22:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 156541 states and 482329 transitions. [2022-03-15 13:22:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:22:43,919 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:22:43,919 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-15 13:22:43,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 13:22:43,922 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-15 13:22:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:22:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash -460843800, now seen corresponding path program 16 times [2022-03-15 13:22:43,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:22:43,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124713207] [2022-03-15 13:22:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:22:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:22:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:22:45,083 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-15 13:22:45,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:22:45,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124713207] [2022-03-15 13:22:45,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124713207] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:22:45,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:22:45,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:22:45,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430313680] [2022-03-15 13:22:45,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:22:45,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:22:45,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:22:45,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:22:45,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:22:45,085 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-15 13:22:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:22:54,134 INFO L93 Difference]: Finished difference Result 206416 states and 634995 transitions. [2022-03-15 13:22:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 13:22:54,135 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-15 13:22:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:22:54,872 INFO L225 Difference]: With dead ends: 206416 [2022-03-15 13:22:54,872 INFO L226 Difference]: Without dead ends: 206416 [2022-03-15 13:22:54,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1541, Invalid=3715, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 13:22:54,873 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-15 13:22:54,873 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-15 13:22:55,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206416 states. [2022-03-15 13:22:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206416 to 158389. [2022-03-15 13:22:59,516 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-15 13:23:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158389 states to 158389 states and 488113 transitions. [2022-03-15 13:23:00,075 INFO L78 Accepts]: Start accepts. Automaton has 158389 states and 488113 transitions. Word has length 114 [2022-03-15 13:23:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:23:00,076 INFO L470 AbstractCegarLoop]: Abstraction has 158389 states and 488113 transitions. [2022-03-15 13:23:00,076 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-15 13:23:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 158389 states and 488113 transitions. [2022-03-15 13:23:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:23:00,714 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:23:00,714 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-15 13:23:00,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 13:23:00,714 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-15 13:23:00,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:23:00,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2022306384, now seen corresponding path program 17 times [2022-03-15 13:23:00,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:23:00,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511185760] [2022-03-15 13:23:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:23:00,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:23:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:23:01,308 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-15 13:23:01,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:23:01,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511185760] [2022-03-15 13:23:01,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511185760] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:23:01,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:23:01,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:23:01,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205120613] [2022-03-15 13:23:01,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:23:01,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:23:01,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:23:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:23:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:23:01,310 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-15 13:23:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:23:10,293 INFO L93 Difference]: Finished difference Result 209887 states and 645493 transitions. [2022-03-15 13:23:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 13:23:10,294 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-15 13:23:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:23:10,899 INFO L225 Difference]: With dead ends: 209887 [2022-03-15 13:23:10,899 INFO L226 Difference]: Without dead ends: 209887 [2022-03-15 13:23:10,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2030, Invalid=5626, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 13:23:10,900 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, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 13:23:10,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3008 Valid, 14797 Invalid, 4890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 4812 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 13:23:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209887 states. [2022-03-15 13:23:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209887 to 158158. [2022-03-15 13:23:14,899 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-15 13:23:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158158 states to 158158 states and 487380 transitions. [2022-03-15 13:23:15,812 INFO L78 Accepts]: Start accepts. Automaton has 158158 states and 487380 transitions. Word has length 114 [2022-03-15 13:23:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:23:15,812 INFO L470 AbstractCegarLoop]: Abstraction has 158158 states and 487380 transitions. [2022-03-15 13:23:15,813 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-15 13:23:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 158158 states and 487380 transitions. [2022-03-15 13:23:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:23:15,959 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:23:15,959 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-15 13:23:15,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 13:23:15,959 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-15 13:23:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:23:15,959 INFO L85 PathProgramCache]: Analyzing trace with hash 724529880, now seen corresponding path program 18 times [2022-03-15 13:23:15,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:23:15,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671368799] [2022-03-15 13:23:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:23:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:23:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:23:16,584 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-15 13:23:16,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:23:16,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671368799] [2022-03-15 13:23:16,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671368799] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:23:16,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:23:16,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:23:16,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572129022] [2022-03-15 13:23:16,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:23:16,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:23:16,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:23:16,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:23:16,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:23:16,586 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-15 13:23:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:23:25,492 INFO L93 Difference]: Finished difference Result 209068 states and 643271 transitions. [2022-03-15 13:23:25,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 13:23:25,507 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-15 13:23:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:23:26,434 INFO L225 Difference]: With dead ends: 209068 [2022-03-15 13:23:26,435 INFO L226 Difference]: Without dead ends: 209068 [2022-03-15 13:23:26,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2414, Invalid=5776, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 13:23:26,436 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.3s IncrementalHoareTripleChecker+Time [2022-03-15 13:23:26,436 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.3s Time] [2022-03-15 13:23:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209068 states. [2022-03-15 13:23:30,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209068 to 155254. [2022-03-15 13:23:30,530 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-15 13:23:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155254 states to 155254 states and 478344 transitions. [2022-03-15 13:23:31,005 INFO L78 Accepts]: Start accepts. Automaton has 155254 states and 478344 transitions. Word has length 114 [2022-03-15 13:23:31,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:23:31,005 INFO L470 AbstractCegarLoop]: Abstraction has 155254 states and 478344 transitions. [2022-03-15 13:23:31,005 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-15 13:23:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 155254 states and 478344 transitions. [2022-03-15 13:23:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:23:31,538 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:23:31,538 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-15 13:23:31,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 13:23:31,539 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-15 13:23:31,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:23:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1771845934, now seen corresponding path program 19 times [2022-03-15 13:23:31,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:23:31,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007708592] [2022-03-15 13:23:31,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:23:31,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:23:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:23:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:23:32,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:23:32,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007708592] [2022-03-15 13:23:32,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007708592] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:23:32,469 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:23:32,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:23:32,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966923069] [2022-03-15 13:23:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:23:32,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:23:32,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:23:32,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:23:32,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:23:32,471 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-15 13:23:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:23:37,996 INFO L93 Difference]: Finished difference Result 195424 states and 601182 transitions. [2022-03-15 13:23:37,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 13:23:37,996 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-15 13:23:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:23:38,784 INFO L225 Difference]: With dead ends: 195424 [2022-03-15 13:23:38,784 INFO L226 Difference]: Without dead ends: 195424 [2022-03-15 13:23:38,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1074, Invalid=2708, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 13:23:38,785 INFO L933 BasicCegarLoop]: 1018 mSDtfsCounter, 2437 mSDsluCounter, 9591 mSDsCounter, 0 mSdLazyCounter, 3482 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-03-15 13:23:38,785 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.3s Time] [2022-03-15 13:23:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195424 states. [2022-03-15 13:23:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195424 to 159412. [2022-03-15 13:23:43,078 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-15 13:23:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159412 states to 159412 states and 491433 transitions. [2022-03-15 13:23:43,964 INFO L78 Accepts]: Start accepts. Automaton has 159412 states and 491433 transitions. Word has length 114 [2022-03-15 13:23:43,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:23:43,964 INFO L470 AbstractCegarLoop]: Abstraction has 159412 states and 491433 transitions. [2022-03-15 13:23:43,964 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-15 13:23:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 159412 states and 491433 transitions. [2022-03-15 13:23:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:23:44,098 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:23:44,098 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-15 13:23:44,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 13:23:44,098 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-15 13:23:44,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:23:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1167617858, now seen corresponding path program 20 times [2022-03-15 13:23:44,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:23:44,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213495659] [2022-03-15 13:23:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:23:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:23:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:23:44,729 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-15 13:23:44,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:23:44,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213495659] [2022-03-15 13:23:44,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213495659] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:23:44,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:23:44,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:23:44,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545293333] [2022-03-15 13:23:44,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:23:44,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:23:44,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:23:44,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:23:44,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:23:44,731 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-15 13:23:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:23:51,791 INFO L93 Difference]: Finished difference Result 206287 states and 634740 transitions. [2022-03-15 13:23:51,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 13:23:51,792 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-15 13:23:51,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:23:52,486 INFO L225 Difference]: With dead ends: 206287 [2022-03-15 13:23:52,486 INFO L226 Difference]: Without dead ends: 206287 [2022-03-15 13:23:52,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1527, Invalid=4325, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 13:23:52,487 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-15 13:23:52,487 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-15 13:23:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206287 states. [2022-03-15 13:23:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206287 to 160270. [2022-03-15 13:23:56,824 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-15 13:23:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160270 states to 160270 states and 494099 transitions. [2022-03-15 13:23:57,352 INFO L78 Accepts]: Start accepts. Automaton has 160270 states and 494099 transitions. Word has length 114 [2022-03-15 13:23:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:23:57,352 INFO L470 AbstractCegarLoop]: Abstraction has 160270 states and 494099 transitions. [2022-03-15 13:23:57,352 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-15 13:23:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 160270 states and 494099 transitions. [2022-03-15 13:23:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:23:57,893 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:23:57,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-15 13:23:57,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 13:23:57,893 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-15 13:23:57,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:23:57,894 INFO L85 PathProgramCache]: Analyzing trace with hash -393844726, now seen corresponding path program 21 times [2022-03-15 13:23:57,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:23:57,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086698444] [2022-03-15 13:23:57,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:23:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:23:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:23:58,536 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-15 13:23:58,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:23:58,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086698444] [2022-03-15 13:23:58,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086698444] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:23:58,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:23:58,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:23:58,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164708464] [2022-03-15 13:23:58,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:23:58,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:23:58,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:23:58,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:23:58,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:23:58,538 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-15 13:24:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:24:06,328 INFO L93 Difference]: Finished difference Result 204988 states and 630661 transitions. [2022-03-15 13:24:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 13:24:06,328 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-15 13:24:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:24:07,244 INFO L225 Difference]: With dead ends: 204988 [2022-03-15 13:24:07,245 INFO L226 Difference]: Without dead ends: 204988 [2022-03-15 13:24:07,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1799, Invalid=5007, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 13:24:07,246 INFO L933 BasicCegarLoop]: 1267 mSDtfsCounter, 3650 mSDsluCounter, 11000 mSDsCounter, 0 mSdLazyCounter, 3919 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2022-03-15 13:24:07,246 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.6s Time] [2022-03-15 13:24:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204988 states. [2022-03-15 13:24:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204988 to 160303. [2022-03-15 13:24:11,431 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-15 13:24:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160303 states to 160303 states and 494199 transitions. [2022-03-15 13:24:11,918 INFO L78 Accepts]: Start accepts. Automaton has 160303 states and 494199 transitions. Word has length 114 [2022-03-15 13:24:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:24:11,918 INFO L470 AbstractCegarLoop]: Abstraction has 160303 states and 494199 transitions. [2022-03-15 13:24:11,918 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-15 13:24:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 160303 states and 494199 transitions. [2022-03-15 13:24:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:24:12,478 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:24:12,478 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-15 13:24:12,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 13:24:12,478 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-15 13:24:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:24:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1941975758, now seen corresponding path program 22 times [2022-03-15 13:24:12,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:24:12,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418872726] [2022-03-15 13:24:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:24:12,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:24:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:24:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:24:13,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:24:13,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418872726] [2022-03-15 13:24:13,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418872726] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:24:13,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:24:13,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:24:13,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378164766] [2022-03-15 13:24:13,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:24:13,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:24:13,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:24:13,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:24:13,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:24:13,427 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-15 13:24:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:24:24,110 INFO L93 Difference]: Finished difference Result 205831 states and 633552 transitions. [2022-03-15 13:24:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 13:24:24,110 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-15 13:24:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:24:25,246 INFO L225 Difference]: With dead ends: 205831 [2022-03-15 13:24:25,247 INFO L226 Difference]: Without dead ends: 205831 [2022-03-15 13:24:25,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2489, Invalid=6067, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 13:24:25,249 INFO L933 BasicCegarLoop]: 1550 mSDtfsCounter, 3311 mSDsluCounter, 12501 mSDsCounter, 0 mSdLazyCounter, 4433 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 13:24:25,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3311 Valid, 14051 Invalid, 4531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4433 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 13:24:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205831 states. [2022-03-15 13:24:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205831 to 155848. [2022-03-15 13:24:29,209 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-15 13:24:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155848 states to 155848 states and 480222 transitions. [2022-03-15 13:24:29,998 INFO L78 Accepts]: Start accepts. Automaton has 155848 states and 480222 transitions. Word has length 114 [2022-03-15 13:24:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:24:29,998 INFO L470 AbstractCegarLoop]: Abstraction has 155848 states and 480222 transitions. [2022-03-15 13:24:29,998 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-15 13:24:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 155848 states and 480222 transitions. [2022-03-15 13:24:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:24:30,152 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:24:30,152 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-15 13:24:30,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 13:24:30,153 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-15 13:24:30,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:24:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1860149644, now seen corresponding path program 23 times [2022-03-15 13:24:30,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:24:30,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178795203] [2022-03-15 13:24:30,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:24:30,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:24:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:24:30,987 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-15 13:24:30,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:24:30,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178795203] [2022-03-15 13:24:30,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178795203] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:24:30,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:24:30,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:24:30,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587163014] [2022-03-15 13:24:30,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:24:30,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:24:30,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:24:30,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:24:30,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:24:30,989 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-15 13:24:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:24:36,649 INFO L93 Difference]: Finished difference Result 195547 states and 601977 transitions. [2022-03-15 13:24:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 13:24:36,650 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-15 13:24:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:24:37,204 INFO L225 Difference]: With dead ends: 195547 [2022-03-15 13:24:37,204 INFO L226 Difference]: Without dead ends: 195547 [2022-03-15 13:24:37,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1089, Invalid=3333, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 13:24:37,205 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.4s IncrementalHoareTripleChecker+Time [2022-03-15 13:24:37,205 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.4s Time] [2022-03-15 13:24:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195547 states. [2022-03-15 13:24:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195547 to 162019. [2022-03-15 13:24:41,262 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-15 13:24:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162019 states to 162019 states and 499483 transitions. [2022-03-15 13:24:42,132 INFO L78 Accepts]: Start accepts. Automaton has 162019 states and 499483 transitions. Word has length 114 [2022-03-15 13:24:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:24:42,133 INFO L470 AbstractCegarLoop]: Abstraction has 162019 states and 499483 transitions. [2022-03-15 13:24:42,133 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-15 13:24:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 162019 states and 499483 transitions. [2022-03-15 13:24:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:24:42,298 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:24:42,298 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-15 13:24:42,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 13:24:42,298 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-15 13:24:42,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:24:42,299 INFO L85 PathProgramCache]: Analyzing trace with hash 873355068, now seen corresponding path program 24 times [2022-03-15 13:24:42,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:24:42,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292224556] [2022-03-15 13:24:42,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:24:42,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:24:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:24:42,951 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-15 13:24:42,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:24:42,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292224556] [2022-03-15 13:24:42,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292224556] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:24:42,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:24:42,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:24:42,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282909600] [2022-03-15 13:24:42,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:24:42,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:24:42,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:24:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:24:42,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:24:42,952 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-15 13:24:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:24:50,766 INFO L93 Difference]: Finished difference Result 197494 states and 608240 transitions. [2022-03-15 13:24:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 13:24:50,767 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-15 13:24:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:24:51,672 INFO L225 Difference]: With dead ends: 197494 [2022-03-15 13:24:51,673 INFO L226 Difference]: Without dead ends: 197494 [2022-03-15 13:24:51,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1334, Invalid=3922, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 13:24:51,674 INFO L933 BasicCegarLoop]: 1033 mSDtfsCounter, 2742 mSDsluCounter, 12683 mSDsCounter, 0 mSdLazyCounter, 4637 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 13:24:51,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2742 Valid, 13716 Invalid, 4712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4637 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 13:24:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197494 states. [2022-03-15 13:24:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197494 to 162052. [2022-03-15 13:24:56,040 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-15 13:24:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162052 states to 162052 states and 499583 transitions. [2022-03-15 13:24:56,485 INFO L78 Accepts]: Start accepts. Automaton has 162052 states and 499583 transitions. Word has length 114 [2022-03-15 13:24:56,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:24:56,486 INFO L470 AbstractCegarLoop]: Abstraction has 162052 states and 499583 transitions. [2022-03-15 13:24:56,486 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-15 13:24:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 162052 states and 499583 transitions. [2022-03-15 13:24:57,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:24:57,017 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:24:57,017 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-15 13:24:57,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 13:24:57,018 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-15 13:24:57,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:24:57,018 INFO L85 PathProgramCache]: Analyzing trace with hash -674775964, now seen corresponding path program 25 times [2022-03-15 13:24:57,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:24:57,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281789972] [2022-03-15 13:24:57,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:24:57,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:24:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:24:57,701 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-15 13:24:57,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:24:57,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281789972] [2022-03-15 13:24:57,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281789972] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:24:57,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:24:57,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:24:57,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985859093] [2022-03-15 13:24:57,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:24:57,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:24:57,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:24:57,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:24:57,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:24:57,708 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-15 13:25:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:25:06,973 INFO L93 Difference]: Finished difference Result 196723 states and 605555 transitions. [2022-03-15 13:25:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 13:25:06,974 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-15 13:25:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:25:07,753 INFO L225 Difference]: With dead ends: 196723 [2022-03-15 13:25:07,754 INFO L226 Difference]: Without dead ends: 196723 [2022-03-15 13:25:07,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2558, Invalid=6184, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 13:25:07,754 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-15 13:25:07,755 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-15 13:25:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196723 states. [2022-03-15 13:25:11,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196723 to 157432. [2022-03-15 13:25:11,826 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-15 13:25:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157432 states to 157432 states and 485187 transitions. [2022-03-15 13:25:12,735 INFO L78 Accepts]: Start accepts. Automaton has 157432 states and 485187 transitions. Word has length 114 [2022-03-15 13:25:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:25:12,753 INFO L470 AbstractCegarLoop]: Abstraction has 157432 states and 485187 transitions. [2022-03-15 13:25:12,753 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-15 13:25:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 157432 states and 485187 transitions. [2022-03-15 13:25:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:25:12,925 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:25:12,925 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-15 13:25:12,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 13:25:12,926 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-15 13:25:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:25:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash -939404236, now seen corresponding path program 26 times [2022-03-15 13:25:12,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:25:12,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615874449] [2022-03-15 13:25:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:25:12,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:25:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:25:13,388 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-15 13:25:13,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:25:13,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615874449] [2022-03-15 13:25:13,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615874449] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:25:13,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:25:13,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:25:13,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96938013] [2022-03-15 13:25:13,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:25:13,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:25:13,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:25:13,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:25:13,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:25:13,389 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-15 13:25:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:25:17,850 INFO L93 Difference]: Finished difference Result 186637 states and 574086 transitions. [2022-03-15 13:25:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 13:25:17,851 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-15 13:25:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:25:18,677 INFO L225 Difference]: With dead ends: 186637 [2022-03-15 13:25:18,677 INFO L226 Difference]: Without dead ends: 186637 [2022-03-15 13:25:18,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=874, Invalid=3032, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 13:25:18,678 INFO L933 BasicCegarLoop]: 818 mSDtfsCounter, 2715 mSDsluCounter, 10812 mSDsCounter, 0 mSdLazyCounter, 3769 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2022-03-15 13:25:18,679 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.7s Time] [2022-03-15 13:25:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186637 states. [2022-03-15 13:25:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186637 to 158026. [2022-03-15 13:25:22,365 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-15 13:25:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158026 states to 158026 states and 486987 transitions. [2022-03-15 13:25:23,252 INFO L78 Accepts]: Start accepts. Automaton has 158026 states and 486987 transitions. Word has length 114 [2022-03-15 13:25:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:25:23,252 INFO L470 AbstractCegarLoop]: Abstraction has 158026 states and 486987 transitions. [2022-03-15 13:25:23,252 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-15 13:25:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 158026 states and 486987 transitions. [2022-03-15 13:25:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:25:23,404 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:25:23,404 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-15 13:25:23,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 13:25:23,404 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-15 13:25:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:25:23,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1807432028, now seen corresponding path program 27 times [2022-03-15 13:25:23,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:25:23,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032862579] [2022-03-15 13:25:23,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:25:23,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:25:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:25:24,077 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-15 13:25:24,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:25:24,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032862579] [2022-03-15 13:25:24,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032862579] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:25:24,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:25:24,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-15 13:25:24,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617578763] [2022-03-15 13:25:24,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:25:24,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 13:25:24,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:25:24,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 13:25:24,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2022-03-15 13:25:24,079 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-15 13:25:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:25:33,234 INFO L93 Difference]: Finished difference Result 188077 states and 578431 transitions. [2022-03-15 13:25:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 13:25:33,235 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-15 13:25:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:25:34,069 INFO L225 Difference]: With dead ends: 188077 [2022-03-15 13:25:34,069 INFO L226 Difference]: Without dead ends: 188077 [2022-03-15 13:25:34,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2244, Invalid=5412, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 13:25:34,070 INFO L933 BasicCegarLoop]: 1502 mSDtfsCounter, 3040 mSDsluCounter, 13790 mSDsCounter, 0 mSdLazyCounter, 4957 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2022-03-15 13:25:34,070 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.0s Time] [2022-03-15 13:25:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188077 states. [2022-03-15 13:25:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188077 to 156211. [2022-03-15 13:25:37,793 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-15 13:25:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156211 states to 156211 states and 481369 transitions. [2022-03-15 13:25:38,714 INFO L78 Accepts]: Start accepts. Automaton has 156211 states and 481369 transitions. Word has length 114 [2022-03-15 13:25:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:25:38,714 INFO L470 AbstractCegarLoop]: Abstraction has 156211 states and 481369 transitions. [2022-03-15 13:25:38,715 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-15 13:25:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 156211 states and 481369 transitions. [2022-03-15 13:25:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:25:38,869 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:25:38,869 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-15 13:25:38,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 13:25:38,869 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-15 13:25:38,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:25:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash -825115224, now seen corresponding path program 28 times [2022-03-15 13:25:38,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:25:38,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972954025] [2022-03-15 13:25:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:25:38,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:25:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:25:39,578 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-15 13:25:39,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:25:39,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972954025] [2022-03-15 13:25:39,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972954025] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:25:39,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:25:39,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:25:39,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154743061] [2022-03-15 13:25:39,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:25:39,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:25:39,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:25:39,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:25:39,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:25:39,579 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-15 13:25:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:25:46,158 INFO L93 Difference]: Finished difference Result 228202 states and 702439 transitions. [2022-03-15 13:25:46,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 13:25:46,158 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-15 13:25:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:25:47,521 INFO L225 Difference]: With dead ends: 228202 [2022-03-15 13:25:47,521 INFO L226 Difference]: Without dead ends: 228202 [2022-03-15 13:25:47,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 13:25:47,522 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 3412 mSDsluCounter, 9505 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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-15 13:25:47,522 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-15 13:25:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228202 states. [2022-03-15 13:25:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228202 to 157828. [2022-03-15 13:25:52,101 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-15 13:25:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157828 states to 157828 states and 486328 transitions. [2022-03-15 13:25:52,990 INFO L78 Accepts]: Start accepts. Automaton has 157828 states and 486328 transitions. Word has length 114 [2022-03-15 13:25:52,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:25:52,990 INFO L470 AbstractCegarLoop]: Abstraction has 157828 states and 486328 transitions. [2022-03-15 13:25:52,990 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-15 13:25:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 157828 states and 486328 transitions. [2022-03-15 13:25:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:25:53,163 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:25:53,163 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-15 13:25:53,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 13:25:53,163 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-15 13:25:53,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:25:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1488903994, now seen corresponding path program 29 times [2022-03-15 13:25:53,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:25:53,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598028511] [2022-03-15 13:25:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:25:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:25:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:25:54,289 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-15 13:25:54,289 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:25:54,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598028511] [2022-03-15 13:25:54,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598028511] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:25:54,290 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:25:54,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:25:54,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893298533] [2022-03-15 13:25:54,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:25:54,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:25:54,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:25:54,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:25:54,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:25:54,298 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-15 13:26:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:26:01,435 INFO L93 Difference]: Finished difference Result 247378 states and 761904 transitions. [2022-03-15 13:26:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 13:26:01,435 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-15 13:26:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:26:02,705 INFO L225 Difference]: With dead ends: 247378 [2022-03-15 13:26:02,705 INFO L226 Difference]: Without dead ends: 247378 [2022-03-15 13:26:02,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1587, Invalid=4419, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 13:26:02,706 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 3199 mSDsluCounter, 13013 mSDsCounter, 0 mSdLazyCounter, 4805 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:26:02,706 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.9s Time] [2022-03-15 13:26:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247378 states. [2022-03-15 13:26:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247378 to 157861. [2022-03-15 13:26:07,273 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-15 13:26:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157861 states to 157861 states and 486428 transitions. [2022-03-15 13:26:07,735 INFO L78 Accepts]: Start accepts. Automaton has 157861 states and 486428 transitions. Word has length 114 [2022-03-15 13:26:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:26:07,736 INFO L470 AbstractCegarLoop]: Abstraction has 157861 states and 486428 transitions. [2022-03-15 13:26:07,736 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-15 13:26:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 157861 states and 486428 transitions. [2022-03-15 13:26:08,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:26:08,253 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:26:08,253 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-15 13:26:08,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 13:26:08,253 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-15 13:26:08,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:26:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash 535591562, now seen corresponding path program 30 times [2022-03-15 13:26:08,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:26:08,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819928858] [2022-03-15 13:26:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:26:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:26:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:26:08,732 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-15 13:26:08,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:26:08,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819928858] [2022-03-15 13:26:08,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819928858] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:26:08,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:26:08,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:26:08,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91155199] [2022-03-15 13:26:08,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:26:08,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:26:08,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:26:08,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:26:08,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:26:08,740 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-15 13:26:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:26:17,150 INFO L93 Difference]: Finished difference Result 245923 states and 757415 transitions. [2022-03-15 13:26:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 13:26:17,151 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-15 13:26:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:26:18,378 INFO L225 Difference]: With dead ends: 245923 [2022-03-15 13:26:18,378 INFO L226 Difference]: Without dead ends: 245923 [2022-03-15 13:26:18,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1708, Invalid=4772, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 13:26:18,380 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 3141 mSDsluCounter, 12656 mSDsCounter, 0 mSdLazyCounter, 4536 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 13:26:18,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3141 Valid, 13913 Invalid, 4606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4536 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 13:26:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245923 states. [2022-03-15 13:26:22,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245923 to 158059. [2022-03-15 13:26:22,801 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-15 13:26:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158059 states to 158059 states and 487054 transitions. [2022-03-15 13:26:23,913 INFO L78 Accepts]: Start accepts. Automaton has 158059 states and 487054 transitions. Word has length 114 [2022-03-15 13:26:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:26:23,913 INFO L470 AbstractCegarLoop]: Abstraction has 158059 states and 487054 transitions. [2022-03-15 13:26:23,913 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-15 13:26:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 158059 states and 487054 transitions. [2022-03-15 13:26:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:26:24,095 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:26:24,095 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-15 13:26:24,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 13:26:24,096 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-15 13:26:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:26:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash -819911942, now seen corresponding path program 31 times [2022-03-15 13:26:24,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:26:24,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13609718] [2022-03-15 13:26:24,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:26:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:26:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:26:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:26:24,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:26:24,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13609718] [2022-03-15 13:26:24,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13609718] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:26:24,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:26:24,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:26:24,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917739916] [2022-03-15 13:26:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:26:24,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:26:24,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:26:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:26:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:26:24,791 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-15 13:26:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:26:34,114 INFO L93 Difference]: Finished difference Result 244339 states and 752589 transitions. [2022-03-15 13:26:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 13:26:34,115 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-15 13:26:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:26:35,328 INFO L225 Difference]: With dead ends: 244339 [2022-03-15 13:26:35,328 INFO L226 Difference]: Without dead ends: 244339 [2022-03-15 13:26:35,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1965, Invalid=5517, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 13:26:35,329 INFO L933 BasicCegarLoop]: 1381 mSDtfsCounter, 3121 mSDsluCounter, 13184 mSDsCounter, 0 mSdLazyCounter, 4731 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:26:35,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3121 Valid, 14565 Invalid, 4801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4731 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 13:26:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244339 states. [2022-03-15 13:26:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244339 to 158422. [2022-03-15 13:26:40,022 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-15 13:26:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158422 states to 158422 states and 488187 transitions. [2022-03-15 13:26:40,551 INFO L78 Accepts]: Start accepts. Automaton has 158422 states and 488187 transitions. Word has length 114 [2022-03-15 13:26:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:26:40,551 INFO L470 AbstractCegarLoop]: Abstraction has 158422 states and 488187 transitions. [2022-03-15 13:26:40,551 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-15 13:26:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 158422 states and 488187 transitions. [2022-03-15 13:26:41,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:26:41,130 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:26:41,130 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-15 13:26:41,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-15 13:26:41,130 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-15 13:26:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:26:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1913592770, now seen corresponding path program 32 times [2022-03-15 13:26:41,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:26:41,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857503516] [2022-03-15 13:26:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:26:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:26:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:26:41,734 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-15 13:26:41,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:26:41,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857503516] [2022-03-15 13:26:41,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857503516] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:26:41,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:26:41,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:26:41,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707430903] [2022-03-15 13:26:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:26:41,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:26:41,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:26:41,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:26:41,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:26:41,736 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-15 13:26:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:26:51,340 INFO L93 Difference]: Finished difference Result 242986 states and 748258 transitions. [2022-03-15 13:26:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 13:26:51,341 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-15 13:26:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:26:52,790 INFO L225 Difference]: With dead ends: 242986 [2022-03-15 13:26:52,790 INFO L226 Difference]: Without dead ends: 242986 [2022-03-15 13:26:52,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2261, Invalid=6295, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 13:26:52,791 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 3304 mSDsluCounter, 16636 mSDsCounter, 0 mSdLazyCounter, 6077 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:26:52,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3304 Valid, 18123 Invalid, 6161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 6077 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 13:26:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242986 states. [2022-03-15 13:26:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242986 to 158455. [2022-03-15 13:26:57,966 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-15 13:26:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158455 states to 158455 states and 488287 transitions. [2022-03-15 13:26:58,996 INFO L78 Accepts]: Start accepts. Automaton has 158455 states and 488287 transitions. Word has length 114 [2022-03-15 13:26:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:26:58,997 INFO L470 AbstractCegarLoop]: Abstraction has 158455 states and 488287 transitions. [2022-03-15 13:26:58,997 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-15 13:26:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 158455 states and 488287 transitions. [2022-03-15 13:26:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:26:59,208 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:26:59,208 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-15 13:26:59,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-15 13:26:59,208 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-15 13:26:59,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:26:59,208 INFO L85 PathProgramCache]: Analyzing trace with hash 365461738, now seen corresponding path program 33 times [2022-03-15 13:26:59,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:26:59,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866281360] [2022-03-15 13:26:59,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:26:59,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:26:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:26:59,726 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-15 13:26:59,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:26:59,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866281360] [2022-03-15 13:26:59,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866281360] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:26:59,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:26:59,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:26:59,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335839006] [2022-03-15 13:26:59,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:26:59,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:26:59,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:26:59,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:26:59,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:26:59,728 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-15 13:27:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:27:08,488 INFO L93 Difference]: Finished difference Result 243895 states and 751021 transitions. [2022-03-15 13:27:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 13:27:08,489 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-15 13:27:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:27:09,772 INFO L225 Difference]: With dead ends: 243895 [2022-03-15 13:27:09,773 INFO L226 Difference]: Without dead ends: 243895 [2022-03-15 13:27:09,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 13:27:09,774 INFO L933 BasicCegarLoop]: 1482 mSDtfsCounter, 2503 mSDsluCounter, 12258 mSDsCounter, 0 mSdLazyCounter, 4532 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2022-03-15 13:27:09,774 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.8s Time] [2022-03-15 13:27:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243895 states. [2022-03-15 13:27:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243895 to 168025. [2022-03-15 13:27:14,198 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-15 13:27:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168025 states to 168025 states and 517995 transitions. [2022-03-15 13:27:15,147 INFO L78 Accepts]: Start accepts. Automaton has 168025 states and 517995 transitions. Word has length 114 [2022-03-15 13:27:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:27:15,147 INFO L470 AbstractCegarLoop]: Abstraction has 168025 states and 517995 transitions. [2022-03-15 13:27:15,147 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-15 13:27:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 168025 states and 517995 transitions. [2022-03-15 13:27:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:27:15,601 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:27:15,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:27:15,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-15 13:27:15,601 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-15 13:27:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:27:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1568859766, now seen corresponding path program 34 times [2022-03-15 13:27:15,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:27:15,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756659927] [2022-03-15 13:27:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:27:15,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:27:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:27:16,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-15 13:27:16,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:27:16,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756659927] [2022-03-15 13:27:16,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756659927] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:27:16,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:27:16,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:27:16,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123966690] [2022-03-15 13:27:16,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:27:16,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:27:16,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:27:16,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:27:16,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:27:16,309 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-15 13:27:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:27:22,728 INFO L93 Difference]: Finished difference Result 268819 states and 828324 transitions. [2022-03-15 13:27:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 13:27:22,728 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-15 13:27:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:27:23,749 INFO L225 Difference]: With dead ends: 268819 [2022-03-15 13:27:23,749 INFO L226 Difference]: Without dead ends: 268819 [2022-03-15 13:27:23,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1377, Invalid=3879, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 13:27:23,750 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-15 13:27:23,750 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-15 13:27:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268819 states. [2022-03-15 13:27:28,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268819 to 169213. [2022-03-15 13:27:28,802 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-15 13:27:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169213 states to 169213 states and 521654 transitions. [2022-03-15 13:27:29,881 INFO L78 Accepts]: Start accepts. Automaton has 169213 states and 521654 transitions. Word has length 114 [2022-03-15 13:27:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:27:29,881 INFO L470 AbstractCegarLoop]: Abstraction has 169213 states and 521654 transitions. [2022-03-15 13:27:29,881 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-15 13:27:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 169213 states and 521654 transitions. [2022-03-15 13:27:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:27:30,103 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:27:30,103 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-15 13:27:30,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-15 13:27:30,104 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-15 13:27:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:27:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash 455635790, now seen corresponding path program 35 times [2022-03-15 13:27:30,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:27:30,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138837330] [2022-03-15 13:27:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:27:30,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:27:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:27:30,699 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-15 13:27:30,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:27:30,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138837330] [2022-03-15 13:27:30,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138837330] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:27:30,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:27:30,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:27:30,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263651055] [2022-03-15 13:27:30,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:27:30,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:27:30,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:27:30,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:27:30,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:27:30,701 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-15 13:27:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:27:38,594 INFO L93 Difference]: Finished difference Result 285814 states and 881100 transitions. [2022-03-15 13:27:38,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 13:27:38,595 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-15 13:27:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:27:39,950 INFO L225 Difference]: With dead ends: 285814 [2022-03-15 13:27:39,950 INFO L226 Difference]: Without dead ends: 285814 [2022-03-15 13:27:39,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1495, Invalid=4205, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 13:27:39,951 INFO L933 BasicCegarLoop]: 1156 mSDtfsCounter, 3503 mSDsluCounter, 11421 mSDsCounter, 0 mSdLazyCounter, 4183 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:27:39,951 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.9s Time] [2022-03-15 13:27:40,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285814 states. [2022-03-15 13:27:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285814 to 169411. [2022-03-15 13:27:45,067 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-15 13:27:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169411 states to 169411 states and 522280 transitions. [2022-03-15 13:27:46,023 INFO L78 Accepts]: Start accepts. Automaton has 169411 states and 522280 transitions. Word has length 114 [2022-03-15 13:27:46,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:27:46,023 INFO L470 AbstractCegarLoop]: Abstraction has 169411 states and 522280 transitions. [2022-03-15 13:27:46,024 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-15 13:27:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 169411 states and 522280 transitions. [2022-03-15 13:27:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:27:46,251 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:27:46,251 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-15 13:27:46,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-15 13:27:46,251 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-15 13:27:46,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:27:46,252 INFO L85 PathProgramCache]: Analyzing trace with hash -899867714, now seen corresponding path program 36 times [2022-03-15 13:27:46,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:27:46,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195204549] [2022-03-15 13:27:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:27:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:27:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:27:46,815 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-15 13:27:46,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:27:46,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195204549] [2022-03-15 13:27:46,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195204549] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:27:46,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:27:46,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:27:46,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963415138] [2022-03-15 13:27:46,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:27:46,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:27:46,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:27:46,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:27:46,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:27:46,817 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-15 13:27:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:27:54,998 INFO L93 Difference]: Finished difference Result 284230 states and 876274 transitions. [2022-03-15 13:27:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 13:27:54,998 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-15 13:27:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:27:56,432 INFO L225 Difference]: With dead ends: 284230 [2022-03-15 13:27:56,432 INFO L226 Difference]: Without dead ends: 284230 [2022-03-15 13:27:56,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1746, Invalid=4896, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 13:27:56,433 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.3s IncrementalHoareTripleChecker+Time [2022-03-15 13:27:56,433 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.3s Time] [2022-03-15 13:27:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284230 states. [2022-03-15 13:28:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284230 to 169774. [2022-03-15 13:28:01,652 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-15 13:28:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169774 states to 169774 states and 523413 transitions. [2022-03-15 13:28:02,620 INFO L78 Accepts]: Start accepts. Automaton has 169774 states and 523413 transitions. Word has length 114 [2022-03-15 13:28:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:28:02,620 INFO L470 AbstractCegarLoop]: Abstraction has 169774 states and 523413 transitions. [2022-03-15 13:28:02,620 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-15 13:28:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 169774 states and 523413 transitions. [2022-03-15 13:28:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:28:02,867 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:28:02,867 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-15 13:28:02,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-15 13:28:02,867 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-15 13:28:02,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:28:02,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1833636998, now seen corresponding path program 37 times [2022-03-15 13:28:02,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:28:02,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596753327] [2022-03-15 13:28:02,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:28:02,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:28:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:28:03,781 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-15 13:28:03,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:28:03,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596753327] [2022-03-15 13:28:03,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596753327] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:28:03,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:28:03,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:28:03,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122721945] [2022-03-15 13:28:03,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:28:03,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:28:03,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:28:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:28:03,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:28:03,783 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-15 13:28:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:28:13,782 INFO L93 Difference]: Finished difference Result 282877 states and 871943 transitions. [2022-03-15 13:28:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 13:28:13,783 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-15 13:28:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:28:15,230 INFO L225 Difference]: With dead ends: 282877 [2022-03-15 13:28:15,230 INFO L226 Difference]: Without dead ends: 282877 [2022-03-15 13:28:15,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2030, Invalid=5626, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 13:28:15,231 INFO L933 BasicCegarLoop]: 1386 mSDtfsCounter, 3310 mSDsluCounter, 14103 mSDsCounter, 0 mSdLazyCounter, 5163 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2022-03-15 13:28:15,231 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.3s Time] [2022-03-15 13:28:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282877 states. [2022-03-15 13:28:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282877 to 169807. [2022-03-15 13:28:20,607 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-15 13:28:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169807 states to 169807 states and 523513 transitions. [2022-03-15 13:28:21,618 INFO L78 Accepts]: Start accepts. Automaton has 169807 states and 523513 transitions. Word has length 114 [2022-03-15 13:28:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:28:21,618 INFO L470 AbstractCegarLoop]: Abstraction has 169807 states and 523513 transitions. [2022-03-15 13:28:21,618 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-15 13:28:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 169807 states and 523513 transitions. [2022-03-15 13:28:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:28:21,847 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:28:21,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-15 13:28:21,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-15 13:28:21,848 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-15 13:28:21,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:28:21,864 INFO L85 PathProgramCache]: Analyzing trace with hash 285505966, now seen corresponding path program 38 times [2022-03-15 13:28:21,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:28:21,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192301468] [2022-03-15 13:28:21,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:28:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:28:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:28:22,665 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-15 13:28:22,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:28:22,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192301468] [2022-03-15 13:28:22,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192301468] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:28:22,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:28:22,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:28:22,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820778829] [2022-03-15 13:28:22,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:28:22,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:28:22,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:28:22,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:28:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:28:22,667 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-15 13:28:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:28:33,586 INFO L93 Difference]: Finished difference Result 279508 states and 861524 transitions. [2022-03-15 13:28:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 13:28:33,587 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-15 13:28:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:28:35,130 INFO L225 Difference]: With dead ends: 279508 [2022-03-15 13:28:35,130 INFO L226 Difference]: Without dead ends: 279508 [2022-03-15 13:28:35,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2149, Invalid=5161, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 13:28:35,131 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.5s IncrementalHoareTripleChecker+Time [2022-03-15 13:28:35,131 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.5s Time] [2022-03-15 13:28:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279508 states. [2022-03-15 13:28:40,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279508 to 168124. [2022-03-15 13:28:40,492 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-15 13:28:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168124 states to 168124 states and 518295 transitions. [2022-03-15 13:28:41,951 INFO L78 Accepts]: Start accepts. Automaton has 168124 states and 518295 transitions. Word has length 114 [2022-03-15 13:28:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:28:41,952 INFO L470 AbstractCegarLoop]: Abstraction has 168124 states and 518295 transitions. [2022-03-15 13:28:41,952 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-15 13:28:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 168124 states and 518295 transitions. [2022-03-15 13:28:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:28:42,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:28:42,221 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-15 13:28:42,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-15 13:28:42,221 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-15 13:28:42,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:28:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2084097448, now seen corresponding path program 39 times [2022-03-15 13:28:42,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:28:42,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080366772] [2022-03-15 13:28:42,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:28:42,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:28:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:28:43,562 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-15 13:28:43,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:28:43,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080366772] [2022-03-15 13:28:43,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080366772] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:28:43,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:28:43,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:28:43,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328005122] [2022-03-15 13:28:43,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:28:43,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:28:43,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:28:43,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:28:43,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:28:43,564 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-15 13:28:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:28:50,768 INFO L93 Difference]: Finished difference Result 266110 states and 820035 transitions. [2022-03-15 13:28:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 13:28:50,769 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-15 13:28:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:28:51,719 INFO L225 Difference]: With dead ends: 266110 [2022-03-15 13:28:51,719 INFO L226 Difference]: Without dead ends: 266110 [2022-03-15 13:28:51,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1282, Invalid=3688, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 13:28:51,720 INFO L933 BasicCegarLoop]: 1046 mSDtfsCounter, 3112 mSDsluCounter, 11864 mSDsCounter, 0 mSdLazyCounter, 4461 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2022-03-15 13:28:51,721 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.8s Time] [2022-03-15 13:28:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266110 states. [2022-03-15 13:28:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266110 to 171589. [2022-03-15 13:28:57,058 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-15 13:28:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171589 states to 171589 states and 529218 transitions. [2022-03-15 13:28:57,985 INFO L78 Accepts]: Start accepts. Automaton has 171589 states and 529218 transitions. Word has length 114 [2022-03-15 13:28:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:28:57,985 INFO L470 AbstractCegarLoop]: Abstraction has 171589 states and 529218 transitions. [2022-03-15 13:28:57,985 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-15 13:28:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 171589 states and 529218 transitions. [2022-03-15 13:28:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:28:58,901 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:28:58,901 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-15 13:28:58,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-15 13:28:58,907 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-15 13:28:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:28:58,907 INFO L85 PathProgramCache]: Analyzing trace with hash 728593944, now seen corresponding path program 40 times [2022-03-15 13:28:58,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:28:58,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13000712] [2022-03-15 13:28:58,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:28:58,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:28:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:28:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:28:59,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:28:59,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13000712] [2022-03-15 13:28:59,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13000712] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:28:59,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:28:59,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:28:59,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273883719] [2022-03-15 13:28:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:28:59,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:28:59,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:28:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:28:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:28:59,573 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-15 13:29:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:29:08,729 INFO L93 Difference]: Finished difference Result 276175 states and 851492 transitions. [2022-03-15 13:29:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 13:29:08,729 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-15 13:29:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:29:10,045 INFO L225 Difference]: With dead ends: 276175 [2022-03-15 13:29:10,046 INFO L226 Difference]: Without dead ends: 276175 [2022-03-15 13:29:10,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1527, Invalid=4325, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 13:29:10,046 INFO L933 BasicCegarLoop]: 1170 mSDtfsCounter, 3203 mSDsluCounter, 12633 mSDsCounter, 0 mSdLazyCounter, 4639 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 13:29:10,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3203 Valid, 13803 Invalid, 4714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4639 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 13:29:10,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276175 states. [2022-03-15 13:29:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276175 to 171952. [2022-03-15 13:29:15,524 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-15 13:29:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171952 states to 171952 states and 530351 transitions. [2022-03-15 13:29:16,859 INFO L78 Accepts]: Start accepts. Automaton has 171952 states and 530351 transitions. Word has length 114 [2022-03-15 13:29:16,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:29:16,859 INFO L470 AbstractCegarLoop]: Abstraction has 171952 states and 530351 transitions. [2022-03-15 13:29:16,859 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-15 13:29:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 171952 states and 530351 transitions. [2022-03-15 13:29:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:29:17,115 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:29:17,115 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-15 13:29:17,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-15 13:29:17,115 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-15 13:29:17,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:29:17,115 INFO L85 PathProgramCache]: Analyzing trace with hash -832868640, now seen corresponding path program 41 times [2022-03-15 13:29:17,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:29:17,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327572440] [2022-03-15 13:29:17,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:29:17,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:29:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:29:18,121 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-15 13:29:18,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:29:18,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327572440] [2022-03-15 13:29:18,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327572440] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:29:18,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:29:18,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:29:18,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452741558] [2022-03-15 13:29:18,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:29:18,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:29:18,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:29:18,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:29:18,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:29:18,122 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) [2022-03-15 13:29:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:29:27,618 INFO L93 Difference]: Finished difference Result 274822 states and 847161 transitions. [2022-03-15 13:29:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 13:29:27,619 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-15 13:29:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:29:28,766 INFO L225 Difference]: With dead ends: 274822 [2022-03-15 13:29:28,767 INFO L226 Difference]: Without dead ends: 274822 [2022-03-15 13:29:28,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1799, Invalid=5007, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 13:29:28,783 INFO L933 BasicCegarLoop]: 1276 mSDtfsCounter, 3269 mSDsluCounter, 12977 mSDsCounter, 0 mSdLazyCounter, 4824 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3269 SdHoareTripleChecker+Valid, 14253 SdHoareTripleChecker+Invalid, 4906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 4824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 13:29:28,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3269 Valid, 14253 Invalid, 4906 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [82 Valid, 4824 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 13:29:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274822 states. [2022-03-15 13:29:33,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274822 to 171985. [2022-03-15 13:29:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171985 states, 171981 states have (on average 3.0843581558427964) internal successors, (530451), 171984 states have internal predecessors, (530451), 0 states have call successors, (0), 0 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-15 13:29:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171985 states to 171985 states and 530451 transitions. [2022-03-15 13:29:34,686 INFO L78 Accepts]: Start accepts. Automaton has 171985 states and 530451 transitions. Word has length 114 [2022-03-15 13:29:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:29:34,688 INFO L470 AbstractCegarLoop]: Abstraction has 171985 states and 530451 transitions. [2022-03-15 13:29:34,688 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-15 13:29:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 171985 states and 530451 transitions. [2022-03-15 13:29:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:29:35,392 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:29:35,392 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-15 13:29:35,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-15 13:29:35,392 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-15 13:29:35,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:29:35,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1913967624, now seen corresponding path program 42 times [2022-03-15 13:29:35,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:29:35,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84630433] [2022-03-15 13:29:35,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:29:35,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:29:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:29:36,173 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-15 13:29:36,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:29:36,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84630433] [2022-03-15 13:29:36,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84630433] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:29:36,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:29:36,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:29:36,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31623158] [2022-03-15 13:29:36,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:29:36,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:29:36,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:29:36,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:29:36,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:29:36,175 INFO L87 Difference]: Start difference. First operand 171985 states and 530451 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-15 13:29:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:29:47,050 INFO L93 Difference]: Finished difference Result 271480 states and 836760 transitions. [2022-03-15 13:29:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 13:29:47,051 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-15 13:29:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:29:48,553 INFO L225 Difference]: With dead ends: 271480 [2022-03-15 13:29:48,553 INFO L226 Difference]: Without dead ends: 271480 [2022-03-15 13:29:48,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2201, Invalid=5281, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 13:29:48,572 INFO L933 BasicCegarLoop]: 1549 mSDtfsCounter, 2740 mSDsluCounter, 14256 mSDsCounter, 0 mSdLazyCounter, 5240 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2740 SdHoareTripleChecker+Valid, 15805 SdHoareTripleChecker+Invalid, 5324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 5240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 13:29:48,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2740 Valid, 15805 Invalid, 5324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 5240 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 13:29:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271480 states. [2022-03-15 13:29:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271480 to 171226. [2022-03-15 13:29:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171226 states, 171222 states have (on average 3.0849715573933256) internal successors, (528215), 171225 states have internal predecessors, (528215), 0 states have call successors, (0), 0 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-15 13:29:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171226 states to 171226 states and 528215 transitions. [2022-03-15 13:29:55,297 INFO L78 Accepts]: Start accepts. Automaton has 171226 states and 528215 transitions. Word has length 114 [2022-03-15 13:29:55,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:29:55,297 INFO L470 AbstractCegarLoop]: Abstraction has 171226 states and 528215 transitions. [2022-03-15 13:29:55,297 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-15 13:29:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 171226 states and 528215 transitions. [2022-03-15 13:29:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 13:29:55,521 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:29:55,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-15 13:29:55,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-15 13:29:55,521 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-15 13:29:55,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:29:55,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1995793738, now seen corresponding path program 43 times [2022-03-15 13:29:55,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:29:55,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484938840] [2022-03-15 13:29:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:29:55,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:29:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:29:56,179 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-15 13:29:56,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:29:56,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484938840] [2022-03-15 13:29:56,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484938840] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:29:56,179 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:29:56,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:29:56,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495340165] [2022-03-15 13:29:56,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:29:56,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:29:56,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:29:56,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:29:56,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:29:56,181 INFO L87 Difference]: Start difference. First operand 171226 states and 528215 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-15 13:30:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:30:02,615 INFO L93 Difference]: Finished difference Result 262609 states and 809779 transitions. [2022-03-15 13:30:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 13:30:02,615 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-15 13:30:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:30:04,016 INFO L225 Difference]: With dead ends: 262609 [2022-03-15 13:30:04,016 INFO L226 Difference]: Without dead ends: 262609 [2022-03-15 13:30:04,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1089, Invalid=3333, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 13:30:04,017 INFO L933 BasicCegarLoop]: 936 mSDtfsCounter, 3130 mSDsluCounter, 10190 mSDsCounter, 0 mSdLazyCounter, 3803 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3130 SdHoareTripleChecker+Valid, 11126 SdHoareTripleChecker+Invalid, 3867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 13:30:04,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3130 Valid, 11126 Invalid, 3867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3803 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 13:30:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262609 states.