/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-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 17:17:05,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 17:17:05,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 17:17:05,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 17:17:05,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 17:17:05,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 17:17:05,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 17:17:05,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 17:17:05,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 17:17:05,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 17:17:05,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 17:17:05,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 17:17:05,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 17:17:05,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 17:17:05,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 17:17:05,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 17:17:05,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 17:17:05,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 17:17:05,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 17:17:05,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 17:17:05,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 17:17:05,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 17:17:05,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 17:17:05,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 17:17:06,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 17:17:06,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 17:17:06,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 17:17:06,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 17:17:06,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 17:17:06,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 17:17:06,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 17:17:06,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 17:17:06,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 17:17:06,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 17:17:06,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 17:17:06,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 17:17:06,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 17:17:06,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 17:17:06,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 17:17:06,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 17:17:06,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 17:17:06,025 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-Delay.epf [2021-08-21 17:17:06,054 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 17:17:06,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 17:17:06,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 17:17:06,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 17:17:06,056 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 17:17:06,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 17:17:06,056 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 17:17:06,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 17:17:06,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 17:17:06,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 17:17:06,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 17:17:06,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 17:17:06,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 17:17:06,057 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 17:17:06,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 17:17:06,057 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 17:17:06,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 17:17:06,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 17:17:06,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 17:17:06,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 17:17:06,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 17:17:06,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:17:06,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 17:17:06,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 17:17:06,058 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 17:17:06,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 17:17:06,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 17:17:06,058 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 17:17:06,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 17:17:06,058 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-21 17:17:06,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-21 17:17:06,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 17:17:06,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 17:17:06,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 17:17:06,289 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 17:17:06,290 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 17:17:06,291 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 [2021-08-21 17:17:06,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ac22949/2de0bc9b072643eaabbf4215abf60fe7/FLAG4dea1fcf9 [2021-08-21 17:17:06,780 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 17:17:06,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2021-08-21 17:17:06,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ac22949/2de0bc9b072643eaabbf4215abf60fe7/FLAG4dea1fcf9 [2021-08-21 17:17:06,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ac22949/2de0bc9b072643eaabbf4215abf60fe7 [2021-08-21 17:17:06,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 17:17:06,817 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 17:17:06,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 17:17:06,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 17:17:06,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 17:17:06,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:17:06" (1/1) ... [2021-08-21 17:17:06,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb02fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:06, skipping insertion in model container [2021-08-21 17:17:06,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:17:06" (1/1) ... [2021-08-21 17:17:06,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 17:17:06,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 17:17:06,933 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-21 17:17:07,155 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-08-21 17:17:07,158 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-08-21 17:17:07,159 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-08-21 17:17:07,196 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-08-21 17:17:07,197 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-08-21 17:17:07,198 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-08-21 17:17:07,199 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-08-21 17:17:07,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:17:07,208 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 17:17:07,225 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-21 17:17:07,245 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-08-21 17:17:07,246 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-08-21 17:17:07,246 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-08-21 17:17:07,258 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-08-21 17:17:07,258 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-08-21 17:17:07,259 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-08-21 17:17:07,259 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-08-21 17:17:07,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:17:07,318 INFO L208 MainTranslator]: Completed translation [2021-08-21 17:17:07,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07 WrapperNode [2021-08-21 17:17:07,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 17:17:07,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 17:17:07,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 17:17:07,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 17:17:07,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07" (1/1) ... [2021-08-21 17:17:07,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07" (1/1) ... [2021-08-21 17:17:07,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 17:17:07,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 17:17:07,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 17:17:07,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 17:17:07,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07" (1/1) ... [2021-08-21 17:17:07,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07" (1/1) ... [2021-08-21 17:17:07,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07" (1/1) ... [2021-08-21 17:17:07,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07" (1/1) ... [2021-08-21 17:17:07,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07" (1/1) ... [2021-08-21 17:17:07,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07" (1/1) ... [2021-08-21 17:17:07,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07" (1/1) ... [2021-08-21 17:17:07,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 17:17:07,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 17:17:07,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 17:17:07,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 17:17:07,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07" (1/1) ... [2021-08-21 17:17:07,398 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:17:07,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 17:17:07,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-21 17:17:07,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-21 17:17:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2021-08-21 17:17:07,440 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2021-08-21 17:17:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2021-08-21 17:17:07,440 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2021-08-21 17:17:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 17:17:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 17:17:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-21 17:17:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 17:17:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-08-21 17:17:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 17:17:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 17:17:07,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 17:17:07,442 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 17:17:07,885 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 17:17:07,885 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2021-08-21 17:17:07,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:17:07 BoogieIcfgContainer [2021-08-21 17:17:07,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 17:17:07,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 17:17:07,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 17:17:07,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 17:17:07,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 05:17:06" (1/3) ... [2021-08-21 17:17:07,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@891926d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:17:07, skipping insertion in model container [2021-08-21 17:17:07,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:17:07" (2/3) ... [2021-08-21 17:17:07,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@891926d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:17:07, skipping insertion in model container [2021-08-21 17:17:07,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:17:07" (3/3) ... [2021-08-21 17:17:07,893 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2021-08-21 17:17:07,898 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 17:17:07,898 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 17:17:07,898 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-08-21 17:17:07,898 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 17:17:07,940 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,940 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,940 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,941 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,941 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,941 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,941 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,941 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,942 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,942 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,942 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,942 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,942 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,942 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,942 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,942 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,943 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,943 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,943 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,944 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,944 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,944 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,945 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,945 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,945 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,945 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,945 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,945 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,945 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,945 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,945 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,947 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,947 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,947 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,947 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,947 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,947 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,949 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,949 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,949 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,949 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,949 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,949 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,949 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,949 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,949 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,950 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,950 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,950 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,950 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,950 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,950 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,950 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,950 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,951 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,951 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,951 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,951 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,951 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,951 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,952 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,952 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,952 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,952 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,953 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,953 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,955 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,958 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,959 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,959 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,959 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,959 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,959 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,959 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,959 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,959 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,959 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,960 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,960 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,960 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,960 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,960 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,960 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,960 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,960 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,960 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,960 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,960 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,962 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,962 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,962 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,962 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,963 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,963 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,963 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,963 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,963 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,963 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,963 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,963 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,963 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,963 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,963 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,964 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,964 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,964 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,964 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,964 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,964 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,964 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,964 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,964 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,964 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,964 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,965 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,965 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,965 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,965 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,965 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,965 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,966 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,966 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,966 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,966 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,967 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,968 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,968 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,968 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,968 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,968 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,968 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,968 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,968 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,968 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,968 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,968 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,969 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,969 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,969 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,969 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,969 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,969 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,969 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,969 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,969 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,969 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,970 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,970 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,970 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,970 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,970 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,970 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,970 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,970 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,970 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,970 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,971 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,971 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,972 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,972 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,972 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,974 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,975 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,975 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,975 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,976 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,976 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,980 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,980 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,980 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,980 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,980 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,980 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,980 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,980 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,982 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,982 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,982 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,982 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,982 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,982 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,982 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,982 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,982 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,982 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,982 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,983 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,983 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,983 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,983 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,983 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,983 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,983 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,983 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,983 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,984 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,986 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,987 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,987 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,987 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,987 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,987 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,987 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,987 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,987 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,987 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,987 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,987 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,988 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,989 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,989 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,989 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,991 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,991 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,991 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,991 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,991 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,991 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,991 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,991 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,991 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,992 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,992 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,992 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,992 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,992 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,992 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,992 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,992 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,992 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,992 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,992 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,993 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,994 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,995 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,995 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,995 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,995 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,995 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,995 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,996 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,997 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,998 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:07,999 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,000 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,002 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,002 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,002 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,002 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,002 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,002 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,003 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,004 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,005 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,005 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,005 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,010 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,010 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,010 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,010 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,010 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,010 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,010 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,010 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,010 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,010 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,011 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,011 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,011 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,011 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,011 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,011 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,011 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,011 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,011 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:17:08,016 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-08-21 17:17:08,042 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 17:17:08,048 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 17:17:08,048 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-08-21 17:17:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 84868 states, 82030 states have (on average 1.6796415945385834) internal successors, (137781), 84867 states have internal predecessors, (137781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-21 17:17:12,487 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:12,487 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:12,488 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)] === [2021-08-21 17:17:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1691269654, now seen corresponding path program 1 times [2021-08-21 17:17:12,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:12,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106770320] [2021-08-21 17:17:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:12,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:13,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:13,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106770320] [2021-08-21 17:17:13,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106770320] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:13,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:13,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-21 17:17:13,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165024326] [2021-08-21 17:17:13,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-21 17:17:13,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:13,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-21 17:17:13,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-08-21 17:17:13,309 INFO L87 Difference]: Start difference. First operand has 84868 states, 82030 states have (on average 1.6796415945385834) internal successors, (137781), 84867 states have internal predecessors, (137781), 0 states have call successors, (0), 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 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:15,926 INFO L93 Difference]: Finished difference Result 94952 states and 144937 transitions. [2021-08-21 17:17:15,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-21 17:17:15,927 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-21 17:17:15,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:16,247 INFO L225 Difference]: With dead ends: 94952 [2021-08-21 17:17:16,247 INFO L226 Difference]: Without dead ends: 80636 [2021-08-21 17:17:16,248 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1488.9ms TimeCoverageRelationStatistics Valid=452, Invalid=1270, Unknown=0, NotChecked=0, Total=1722 [2021-08-21 17:17:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80636 states. [2021-08-21 17:17:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80636 to 76524. [2021-08-21 17:17:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76524 states, 76372 states have (on average 1.6037945844026607) internal successors, (122485), 76523 states have internal predecessors, (122485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76524 states to 76524 states and 122485 transitions. [2021-08-21 17:17:18,616 INFO L78 Accepts]: Start accepts. Automaton has 76524 states and 122485 transitions. Word has length 80 [2021-08-21 17:17:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:18,618 INFO L470 AbstractCegarLoop]: Abstraction has 76524 states and 122485 transitions. [2021-08-21 17:17:18,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 76524 states and 122485 transitions. [2021-08-21 17:17:18,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 17:17:18,657 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:18,658 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:18,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 17:17:18,658 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)] === [2021-08-21 17:17:18,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash -56383202, now seen corresponding path program 1 times [2021-08-21 17:17:18,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:18,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919176234] [2021-08-21 17:17:18,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:18,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:19,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:19,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919176234] [2021-08-21 17:17:19,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919176234] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:19,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:19,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-21 17:17:19,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121814027] [2021-08-21 17:17:19,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-21 17:17:19,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:19,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-21 17:17:19,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2021-08-21 17:17:19,211 INFO L87 Difference]: Start difference. First operand 76524 states and 122485 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:22,281 INFO L93 Difference]: Finished difference Result 124049 states and 193551 transitions. [2021-08-21 17:17:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-21 17:17:22,281 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 17:17:22,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:22,627 INFO L225 Difference]: With dead ends: 124049 [2021-08-21 17:17:22,628 INFO L226 Difference]: Without dead ends: 124049 [2021-08-21 17:17:22,629 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1859.7ms TimeCoverageRelationStatistics Valid=530, Invalid=1450, Unknown=0, NotChecked=0, Total=1980 [2021-08-21 17:17:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124049 states. [2021-08-21 17:17:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124049 to 87733. [2021-08-21 17:17:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87733 states, 87581 states have (on average 1.589283063678195) internal successors, (139191), 87732 states have internal predecessors, (139191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87733 states to 87733 states and 139191 transitions. [2021-08-21 17:17:24,924 INFO L78 Accepts]: Start accepts. Automaton has 87733 states and 139191 transitions. Word has length 85 [2021-08-21 17:17:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:24,925 INFO L470 AbstractCegarLoop]: Abstraction has 87733 states and 139191 transitions. [2021-08-21 17:17:24,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 87733 states and 139191 transitions. [2021-08-21 17:17:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 17:17:24,973 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:24,973 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:24,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 17:17:24,973 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)] === [2021-08-21 17:17:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1483257656, now seen corresponding path program 2 times [2021-08-21 17:17:24,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:24,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808508317] [2021-08-21 17:17:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:24,974 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:25,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:25,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808508317] [2021-08-21 17:17:25,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808508317] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:25,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:25,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-21 17:17:25,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590120706] [2021-08-21 17:17:25,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-21 17:17:25,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:25,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-21 17:17:25,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2021-08-21 17:17:25,535 INFO L87 Difference]: Start difference. First operand 87733 states and 139191 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:29,016 INFO L93 Difference]: Finished difference Result 125688 states and 195994 transitions. [2021-08-21 17:17:29,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-21 17:17:29,016 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 17:17:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:29,300 INFO L225 Difference]: With dead ends: 125688 [2021-08-21 17:17:29,301 INFO L226 Difference]: Without dead ends: 125688 [2021-08-21 17:17:29,302 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2352.7ms TimeCoverageRelationStatistics Valid=693, Invalid=1757, Unknown=0, NotChecked=0, Total=2450 [2021-08-21 17:17:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125688 states. [2021-08-21 17:17:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125688 to 90901. [2021-08-21 17:17:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90901 states, 90749 states have (on average 1.5873122568843734) internal successors, (144047), 90900 states have internal predecessors, (144047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90901 states to 90901 states and 144047 transitions. [2021-08-21 17:17:31,382 INFO L78 Accepts]: Start accepts. Automaton has 90901 states and 144047 transitions. Word has length 85 [2021-08-21 17:17:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:31,383 INFO L470 AbstractCegarLoop]: Abstraction has 90901 states and 144047 transitions. [2021-08-21 17:17:31,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 90901 states and 144047 transitions. [2021-08-21 17:17:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 17:17:31,411 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:31,411 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:31,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 17:17:31,412 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)] === [2021-08-21 17:17:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:31,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1948531834, now seen corresponding path program 3 times [2021-08-21 17:17:31,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:31,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252154481] [2021-08-21 17:17:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:31,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:31,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:31,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252154481] [2021-08-21 17:17:31,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252154481] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:31,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:31,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-21 17:17:31,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147485523] [2021-08-21 17:17:31,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-21 17:17:31,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:31,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-21 17:17:31,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-08-21 17:17:31,871 INFO L87 Difference]: Start difference. First operand 90901 states and 144047 transitions. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:34,512 INFO L93 Difference]: Finished difference Result 101898 states and 161105 transitions. [2021-08-21 17:17:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-21 17:17:34,513 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 17:17:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:34,728 INFO L225 Difference]: With dead ends: 101898 [2021-08-21 17:17:34,729 INFO L226 Difference]: Without dead ends: 101898 [2021-08-21 17:17:34,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1561.3ms TimeCoverageRelationStatistics Valid=407, Invalid=1153, Unknown=0, NotChecked=0, Total=1560 [2021-08-21 17:17:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101898 states. [2021-08-21 17:17:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101898 to 86020. [2021-08-21 17:17:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86020 states, 85868 states have (on average 1.5933642334746354) internal successors, (136819), 86019 states have internal predecessors, (136819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86020 states to 86020 states and 136819 transitions. [2021-08-21 17:17:36,551 INFO L78 Accepts]: Start accepts. Automaton has 86020 states and 136819 transitions. Word has length 85 [2021-08-21 17:17:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:36,551 INFO L470 AbstractCegarLoop]: Abstraction has 86020 states and 136819 transitions. [2021-08-21 17:17:36,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 86020 states and 136819 transitions. [2021-08-21 17:17:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-21 17:17:36,602 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:36,602 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:36,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 17:17:36,602 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)] === [2021-08-21 17:17:36,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:36,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2003746216, now seen corresponding path program 1 times [2021-08-21 17:17:36,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:36,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497546775] [2021-08-21 17:17:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:36,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:37,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:37,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497546775] [2021-08-21 17:17:37,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497546775] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:37,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:37,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 17:17:37,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169545459] [2021-08-21 17:17:37,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 17:17:37,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:37,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 17:17:37,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2021-08-21 17:17:37,630 INFO L87 Difference]: Start difference. First operand 86020 states and 136819 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:50,947 INFO L93 Difference]: Finished difference Result 100826 states and 161026 transitions. [2021-08-21 17:17:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-08-21 17:17:50,947 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-21 17:17:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:51,145 INFO L225 Difference]: With dead ends: 100826 [2021-08-21 17:17:51,145 INFO L226 Difference]: Without dead ends: 100826 [2021-08-21 17:17:51,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 11370.7ms TimeCoverageRelationStatistics Valid=3250, Invalid=7880, Unknown=0, NotChecked=0, Total=11130 [2021-08-21 17:17:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100826 states. [2021-08-21 17:17:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100826 to 88988. [2021-08-21 17:17:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88988 states, 88836 states have (on average 1.5977644198297987) internal successors, (141939), 88987 states have internal predecessors, (141939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88988 states to 88988 states and 141939 transitions. [2021-08-21 17:17:52,778 INFO L78 Accepts]: Start accepts. Automaton has 88988 states and 141939 transitions. Word has length 103 [2021-08-21 17:17:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:52,778 INFO L470 AbstractCegarLoop]: Abstraction has 88988 states and 141939 transitions. [2021-08-21 17:17:52,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 88988 states and 141939 transitions. [2021-08-21 17:17:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 17:17:53,166 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:53,166 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:53,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 17:17:53,166 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)] === [2021-08-21 17:17:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1520655097, now seen corresponding path program 1 times [2021-08-21 17:17:53,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:53,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337314202] [2021-08-21 17:17:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:53,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:54,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:54,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337314202] [2021-08-21 17:17:54,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337314202] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:54,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:54,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-08-21 17:17:54,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654236186] [2021-08-21 17:17:54,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-08-21 17:17:54,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-08-21 17:17:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1462, Unknown=0, NotChecked=0, Total=1560 [2021-08-21 17:17:54,601 INFO L87 Difference]: Start difference. First operand 88988 states and 141939 transitions. Second operand has 40 states, 40 states have (on average 2.65) internal successors, (106), 40 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:04,774 INFO L93 Difference]: Finished difference Result 216656 states and 344320 transitions. [2021-08-21 17:18:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-08-21 17:18:04,775 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.65) internal successors, (106), 40 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 17:18:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:05,277 INFO L225 Difference]: With dead ends: 216656 [2021-08-21 17:18:05,277 INFO L226 Difference]: Without dead ends: 216656 [2021-08-21 17:18:05,279 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 6978.0ms TimeCoverageRelationStatistics Valid=1938, Invalid=9404, Unknown=0, NotChecked=0, Total=11342 [2021-08-21 17:18:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216656 states. [2021-08-21 17:18:07,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216656 to 120108. [2021-08-21 17:18:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120108 states, 119956 states have (on average 1.5867984927806862) internal successors, (190346), 120107 states have internal predecessors, (190346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120108 states to 120108 states and 190346 transitions. [2021-08-21 17:18:08,157 INFO L78 Accepts]: Start accepts. Automaton has 120108 states and 190346 transitions. Word has length 106 [2021-08-21 17:18:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:08,158 INFO L470 AbstractCegarLoop]: Abstraction has 120108 states and 190346 transitions. [2021-08-21 17:18:08,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.65) internal successors, (106), 40 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 120108 states and 190346 transitions. [2021-08-21 17:18:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-21 17:18:08,513 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:08,513 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:08,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 17:18:08,514 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 17:18:08,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:08,514 INFO L82 PathProgramCache]: Analyzing trace with hash 104333838, now seen corresponding path program 1 times [2021-08-21 17:18:08,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:08,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299184342] [2021-08-21 17:18:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:08,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:09,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:09,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299184342] [2021-08-21 17:18:09,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299184342] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:09,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:09,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-08-21 17:18:09,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632623676] [2021-08-21 17:18:09,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-08-21 17:18:09,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:09,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-08-21 17:18:09,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1462, Unknown=0, NotChecked=0, Total=1560 [2021-08-21 17:18:09,802 INFO L87 Difference]: Start difference. First operand 120108 states and 190346 transitions. Second operand has 40 states, 40 states have (on average 2.675) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:19,926 INFO L93 Difference]: Finished difference Result 183656 states and 290780 transitions. [2021-08-21 17:18:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-08-21 17:18:19,926 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.675) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-08-21 17:18:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:20,312 INFO L225 Difference]: With dead ends: 183656 [2021-08-21 17:18:20,312 INFO L226 Difference]: Without dead ends: 183656 [2021-08-21 17:18:20,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 7186.1ms TimeCoverageRelationStatistics Valid=2025, Invalid=8895, Unknown=0, NotChecked=0, Total=10920 [2021-08-21 17:18:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183656 states. [2021-08-21 17:18:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183656 to 121020. [2021-08-21 17:18:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121020 states, 120868 states have (on average 1.5869626369262335) internal successors, (191813), 121019 states have internal predecessors, (191813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121020 states to 121020 states and 191813 transitions. [2021-08-21 17:18:23,049 INFO L78 Accepts]: Start accepts. Automaton has 121020 states and 191813 transitions. Word has length 107 [2021-08-21 17:18:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:23,049 INFO L470 AbstractCegarLoop]: Abstraction has 121020 states and 191813 transitions. [2021-08-21 17:18:23,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.675) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 121020 states and 191813 transitions. [2021-08-21 17:18:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:18:23,132 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:23,133 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:23,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 17:18:23,133 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)] === [2021-08-21 17:18:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1706289969, now seen corresponding path program 1 times [2021-08-21 17:18:23,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:23,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100414238] [2021-08-21 17:18:23,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:23,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:24,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:24,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100414238] [2021-08-21 17:18:24,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100414238] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:24,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:24,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 17:18:24,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890327537] [2021-08-21 17:18:24,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 17:18:24,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 17:18:24,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2021-08-21 17:18:24,089 INFO L87 Difference]: Start difference. First operand 121020 states and 191813 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:32,772 INFO L93 Difference]: Finished difference Result 149022 states and 237730 transitions. [2021-08-21 17:18:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-08-21 17:18:32,773 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:18:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:33,064 INFO L225 Difference]: With dead ends: 149022 [2021-08-21 17:18:33,064 INFO L226 Difference]: Without dead ends: 149022 [2021-08-21 17:18:33,065 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 6698.4ms TimeCoverageRelationStatistics Valid=1735, Invalid=4907, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 17:18:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149022 states. [2021-08-21 17:18:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149022 to 121894. [2021-08-21 17:18:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121894 states, 121742 states have (on average 1.5870775903139427) internal successors, (193214), 121893 states have internal predecessors, (193214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121894 states to 121894 states and 193214 transitions. [2021-08-21 17:18:35,993 INFO L78 Accepts]: Start accepts. Automaton has 121894 states and 193214 transitions. Word has length 108 [2021-08-21 17:18:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:35,994 INFO L470 AbstractCegarLoop]: Abstraction has 121894 states and 193214 transitions. [2021-08-21 17:18:35,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 121894 states and 193214 transitions. [2021-08-21 17:18:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:18:36,082 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:36,082 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:36,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 17:18:36,082 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)] === [2021-08-21 17:18:36,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:36,083 INFO L82 PathProgramCache]: Analyzing trace with hash 908131953, now seen corresponding path program 2 times [2021-08-21 17:18:36,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:36,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601633476] [2021-08-21 17:18:36,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:36,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:37,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:37,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601633476] [2021-08-21 17:18:37,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601633476] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:37,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:37,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 17:18:37,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708275444] [2021-08-21 17:18:37,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 17:18:37,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:37,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 17:18:37,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2021-08-21 17:18:37,118 INFO L87 Difference]: Start difference. First operand 121894 states and 193214 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:46,456 INFO L93 Difference]: Finished difference Result 149041 states and 237760 transitions. [2021-08-21 17:18:46,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-08-21 17:18:46,456 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:18:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:46,754 INFO L225 Difference]: With dead ends: 149041 [2021-08-21 17:18:46,755 INFO L226 Difference]: Without dead ends: 149041 [2021-08-21 17:18:46,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 7029.8ms TimeCoverageRelationStatistics Valid=1879, Invalid=5261, Unknown=0, NotChecked=0, Total=7140 [2021-08-21 17:18:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149041 states. [2021-08-21 17:18:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149041 to 121913. [2021-08-21 17:18:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121913 states, 121761 states have (on average 1.5870763216465043) internal successors, (193244), 121912 states have internal predecessors, (193244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121913 states to 121913 states and 193244 transitions. [2021-08-21 17:18:49,232 INFO L78 Accepts]: Start accepts. Automaton has 121913 states and 193244 transitions. Word has length 108 [2021-08-21 17:18:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:49,232 INFO L470 AbstractCegarLoop]: Abstraction has 121913 states and 193244 transitions. [2021-08-21 17:18:49,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 121913 states and 193244 transitions. [2021-08-21 17:18:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:18:49,316 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:49,316 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:49,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 17:18:49,317 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)] === [2021-08-21 17:18:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:49,317 INFO L82 PathProgramCache]: Analyzing trace with hash 86504749, now seen corresponding path program 3 times [2021-08-21 17:18:49,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:49,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239356910] [2021-08-21 17:18:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:49,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:50,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:50,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239356910] [2021-08-21 17:18:50,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239356910] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:50,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:50,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-21 17:18:50,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862131801] [2021-08-21 17:18:50,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-21 17:18:50,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:50,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-21 17:18:50,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2021-08-21 17:18:50,434 INFO L87 Difference]: Start difference. First operand 121913 states and 193244 transitions. Second operand has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:59,078 INFO L93 Difference]: Finished difference Result 148452 states and 236815 transitions. [2021-08-21 17:18:59,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 17:18:59,078 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:18:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:59,370 INFO L225 Difference]: With dead ends: 148452 [2021-08-21 17:18:59,370 INFO L226 Difference]: Without dead ends: 148452 [2021-08-21 17:18:59,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 6587.7ms TimeCoverageRelationStatistics Valid=1695, Invalid=4005, Unknown=0, NotChecked=0, Total=5700 [2021-08-21 17:18:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148452 states. [2021-08-21 17:19:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148452 to 125637. [2021-08-21 17:19:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125637 states, 125485 states have (on average 1.5872415029684823) internal successors, (199175), 125636 states have internal predecessors, (199175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125637 states to 125637 states and 199175 transitions. [2021-08-21 17:19:01,862 INFO L78 Accepts]: Start accepts. Automaton has 125637 states and 199175 transitions. Word has length 108 [2021-08-21 17:19:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:01,862 INFO L470 AbstractCegarLoop]: Abstraction has 125637 states and 199175 transitions. [2021-08-21 17:19:01,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 125637 states and 199175 transitions. [2021-08-21 17:19:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:19:01,948 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:01,948 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:01,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 17:19:01,948 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)] === [2021-08-21 17:19:01,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:01,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1517629371, now seen corresponding path program 4 times [2021-08-21 17:19:01,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:01,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296553995] [2021-08-21 17:19:01,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:01,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:02,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:02,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296553995] [2021-08-21 17:19:02,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296553995] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:02,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:02,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 17:19:02,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276721842] [2021-08-21 17:19:02,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 17:19:02,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:02,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 17:19:02,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2021-08-21 17:19:02,867 INFO L87 Difference]: Start difference. First operand 125637 states and 199175 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:10,584 INFO L93 Difference]: Finished difference Result 152169 states and 242657 transitions. [2021-08-21 17:19:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 17:19:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:19:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:10,937 INFO L225 Difference]: With dead ends: 152169 [2021-08-21 17:19:10,937 INFO L226 Difference]: Without dead ends: 152169 [2021-08-21 17:19:10,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 5882.1ms TimeCoverageRelationStatistics Valid=1503, Invalid=4349, Unknown=0, NotChecked=0, Total=5852 [2021-08-21 17:19:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152169 states. [2021-08-21 17:19:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152169 to 126549. [2021-08-21 17:19:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126549 states, 126397 states have (on average 1.5870708956699922) internal successors, (200601), 126548 states have internal predecessors, (200601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126549 states to 126549 states and 200601 transitions. [2021-08-21 17:19:13,536 INFO L78 Accepts]: Start accepts. Automaton has 126549 states and 200601 transitions. Word has length 108 [2021-08-21 17:19:13,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:13,536 INFO L470 AbstractCegarLoop]: Abstraction has 126549 states and 200601 transitions. [2021-08-21 17:19:13,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 126549 states and 200601 transitions. [2021-08-21 17:19:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:19:13,623 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:13,624 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:13,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 17:19:13,624 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)] === [2021-08-21 17:19:13,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1979179909, now seen corresponding path program 5 times [2021-08-21 17:19:13,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:13,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860278323] [2021-08-21 17:19:13,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:13,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:14,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:14,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860278323] [2021-08-21 17:19:14,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860278323] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:14,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:14,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 17:19:14,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802448258] [2021-08-21 17:19:14,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 17:19:14,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:14,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 17:19:14,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2021-08-21 17:19:14,507 INFO L87 Difference]: Start difference. First operand 126549 states and 200601 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:23,025 INFO L93 Difference]: Finished difference Result 152188 states and 242687 transitions. [2021-08-21 17:19:23,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-21 17:19:23,026 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:19:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:23,366 INFO L225 Difference]: With dead ends: 152188 [2021-08-21 17:19:23,366 INFO L226 Difference]: Without dead ends: 152188 [2021-08-21 17:19:23,369 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 6472.2ms TimeCoverageRelationStatistics Valid=1638, Invalid=4682, Unknown=0, NotChecked=0, Total=6320 [2021-08-21 17:19:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152188 states. [2021-08-21 17:19:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152188 to 126568. [2021-08-21 17:19:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126568 states, 126416 states have (on average 1.5870696747247184) internal successors, (200631), 126567 states have internal predecessors, (200631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126568 states to 126568 states and 200631 transitions. [2021-08-21 17:19:26,072 INFO L78 Accepts]: Start accepts. Automaton has 126568 states and 200631 transitions. Word has length 108 [2021-08-21 17:19:26,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:26,072 INFO L470 AbstractCegarLoop]: Abstraction has 126568 states and 200631 transitions. [2021-08-21 17:19:26,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 126568 states and 200631 transitions. [2021-08-21 17:19:26,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:19:26,161 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:26,161 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:26,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 17:19:26,162 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)] === [2021-08-21 17:19:26,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:26,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1157552705, now seen corresponding path program 6 times [2021-08-21 17:19:26,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:26,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353434174] [2021-08-21 17:19:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:26,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:27,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:27,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353434174] [2021-08-21 17:19:27,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353434174] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:27,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:27,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-21 17:19:27,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574041088] [2021-08-21 17:19:27,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-21 17:19:27,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-21 17:19:27,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2021-08-21 17:19:27,122 INFO L87 Difference]: Start difference. First operand 126568 states and 200631 transitions. Second operand has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:36,057 INFO L93 Difference]: Finished difference Result 155577 states and 248124 transitions. [2021-08-21 17:19:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-21 17:19:36,060 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:19:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:36,395 INFO L225 Difference]: With dead ends: 155577 [2021-08-21 17:19:36,396 INFO L226 Difference]: Without dead ends: 155577 [2021-08-21 17:19:36,396 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 6760.4ms TimeCoverageRelationStatistics Valid=1744, Invalid=4108, Unknown=0, NotChecked=0, Total=5852 [2021-08-21 17:19:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155577 states. [2021-08-21 17:19:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155577 to 125751. [2021-08-21 17:19:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125751 states, 125599 states have (on average 1.587233974792793) internal successors, (199355), 125750 states have internal predecessors, (199355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125751 states to 125751 states and 199355 transitions. [2021-08-21 17:19:39,001 INFO L78 Accepts]: Start accepts. Automaton has 125751 states and 199355 transitions. Word has length 108 [2021-08-21 17:19:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:39,002 INFO L470 AbstractCegarLoop]: Abstraction has 125751 states and 199355 transitions. [2021-08-21 17:19:39,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 125751 states and 199355 transitions. [2021-08-21 17:19:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:19:39,565 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:39,565 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:39,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 17:19:39,565 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)] === [2021-08-21 17:19:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:39,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1814294923, now seen corresponding path program 7 times [2021-08-21 17:19:39,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:39,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738039264] [2021-08-21 17:19:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:39,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:40,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:40,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738039264] [2021-08-21 17:19:40,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738039264] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:40,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:40,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 17:19:40,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053853284] [2021-08-21 17:19:40,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 17:19:40,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:40,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 17:19:40,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2021-08-21 17:19:40,531 INFO L87 Difference]: Start difference. First operand 125751 states and 199355 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:47,633 INFO L93 Difference]: Finished difference Result 149913 states and 239088 transitions. [2021-08-21 17:19:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-08-21 17:19:47,633 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:19:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:48,153 INFO L225 Difference]: With dead ends: 149913 [2021-08-21 17:19:48,153 INFO L226 Difference]: Without dead ends: 149913 [2021-08-21 17:19:48,153 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 5173.4ms TimeCoverageRelationStatistics Valid=1271, Invalid=3841, Unknown=0, NotChecked=0, Total=5112 [2021-08-21 17:19:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149913 states. [2021-08-21 17:19:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149913 to 128050. [2021-08-21 17:19:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128050 states, 127898 states have (on average 1.5873352202536397) internal successors, (203017), 128049 states have internal predecessors, (203017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128050 states to 128050 states and 203017 transitions. [2021-08-21 17:19:50,596 INFO L78 Accepts]: Start accepts. Automaton has 128050 states and 203017 transitions. Word has length 108 [2021-08-21 17:19:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:50,597 INFO L470 AbstractCegarLoop]: Abstraction has 128050 states and 203017 transitions. [2021-08-21 17:19:50,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 128050 states and 203017 transitions. [2021-08-21 17:19:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:19:50,696 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:50,696 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:50,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 17:19:50,696 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)] === [2021-08-21 17:19:50,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:50,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1016136907, now seen corresponding path program 8 times [2021-08-21 17:19:50,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:50,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135247107] [2021-08-21 17:19:50,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:50,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:51,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:51,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135247107] [2021-08-21 17:19:51,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135247107] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:51,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:51,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 17:19:51,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698292488] [2021-08-21 17:19:51,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 17:19:51,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:51,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 17:19:51,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2021-08-21 17:19:51,646 INFO L87 Difference]: Start difference. First operand 128050 states and 203017 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:59,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:59,282 INFO L93 Difference]: Finished difference Result 150160 states and 239478 transitions. [2021-08-21 17:19:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-21 17:19:59,283 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:19:59,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:59,780 INFO L225 Difference]: With dead ends: 150160 [2021-08-21 17:19:59,780 INFO L226 Difference]: Without dead ends: 150160 [2021-08-21 17:19:59,781 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 5745.7ms TimeCoverageRelationStatistics Valid=1397, Invalid=4153, Unknown=0, NotChecked=0, Total=5550 [2021-08-21 17:20:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150160 states. [2021-08-21 17:20:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150160 to 128069. [2021-08-21 17:20:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128069 states, 127917 states have (on average 1.5873339743740082) internal successors, (203047), 128068 states have internal predecessors, (203047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128069 states to 128069 states and 203047 transitions. [2021-08-21 17:20:02,315 INFO L78 Accepts]: Start accepts. Automaton has 128069 states and 203047 transitions. Word has length 108 [2021-08-21 17:20:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:02,316 INFO L470 AbstractCegarLoop]: Abstraction has 128069 states and 203047 transitions. [2021-08-21 17:20:02,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 128069 states and 203047 transitions. [2021-08-21 17:20:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:20:02,412 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:02,412 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:02,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-21 17:20:02,412 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)] === [2021-08-21 17:20:02,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:02,413 INFO L82 PathProgramCache]: Analyzing trace with hash 194509703, now seen corresponding path program 9 times [2021-08-21 17:20:02,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:02,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639591511] [2021-08-21 17:20:02,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:02,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:03,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:03,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639591511] [2021-08-21 17:20:03,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639591511] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:03,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:03,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-21 17:20:03,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734341232] [2021-08-21 17:20:03,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-21 17:20:03,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:03,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-21 17:20:03,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2021-08-21 17:20:03,430 INFO L87 Difference]: Start difference. First operand 128069 states and 203047 transitions. Second operand has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:12,846 INFO L93 Difference]: Finished difference Result 153069 states and 244187 transitions. [2021-08-21 17:20:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-08-21 17:20:12,846 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:20:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:13,163 INFO L225 Difference]: With dead ends: 153069 [2021-08-21 17:20:13,163 INFO L226 Difference]: Without dead ends: 153069 [2021-08-21 17:20:13,164 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 7436.1ms TimeCoverageRelationStatistics Valid=1790, Invalid=4216, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 17:20:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153069 states. [2021-08-21 17:20:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153069 to 126264. [2021-08-21 17:20:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126264 states, 126112 states have (on average 1.5873192083227607) internal successors, (200180), 126263 states have internal predecessors, (200180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126264 states to 126264 states and 200180 transitions. [2021-08-21 17:20:15,895 INFO L78 Accepts]: Start accepts. Automaton has 126264 states and 200180 transitions. Word has length 108 [2021-08-21 17:20:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:15,895 INFO L470 AbstractCegarLoop]: Abstraction has 126264 states and 200180 transitions. [2021-08-21 17:20:15,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 126264 states and 200180 transitions. [2021-08-21 17:20:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:20:15,991 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:15,991 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:15,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-21 17:20:15,991 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)] === [2021-08-21 17:20:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:15,991 INFO L82 PathProgramCache]: Analyzing trace with hash 873531807, now seen corresponding path program 10 times [2021-08-21 17:20:15,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:15,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165864797] [2021-08-21 17:20:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:15,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:16,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:16,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165864797] [2021-08-21 17:20:16,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165864797] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:16,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:16,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 17:20:16,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357771878] [2021-08-21 17:20:16,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 17:20:16,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:16,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 17:20:16,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2021-08-21 17:20:16,932 INFO L87 Difference]: Start difference. First operand 126264 states and 200180 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:22,397 INFO L93 Difference]: Finished difference Result 144948 states and 230896 transitions. [2021-08-21 17:20:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:20:22,398 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:20:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:22,709 INFO L225 Difference]: With dead ends: 144948 [2021-08-21 17:20:22,709 INFO L226 Difference]: Without dead ends: 144948 [2021-08-21 17:20:22,709 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 3926.6ms TimeCoverageRelationStatistics Valid=915, Invalid=3245, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:20:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144948 states. [2021-08-21 17:20:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144948 to 126568. [2021-08-21 17:20:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126568 states, 126416 states have (on average 1.5872990760663208) internal successors, (200660), 126567 states have internal predecessors, (200660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126568 states to 126568 states and 200660 transitions. [2021-08-21 17:20:25,405 INFO L78 Accepts]: Start accepts. Automaton has 126568 states and 200660 transitions. Word has length 108 [2021-08-21 17:20:25,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:25,405 INFO L470 AbstractCegarLoop]: Abstraction has 126568 states and 200660 transitions. [2021-08-21 17:20:25,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 126568 states and 200660 transitions. [2021-08-21 17:20:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:20:25,497 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:25,498 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:25,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-21 17:20:25,498 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)] === [2021-08-21 17:20:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:25,498 INFO L82 PathProgramCache]: Analyzing trace with hash 51904603, now seen corresponding path program 11 times [2021-08-21 17:20:25,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:25,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602429963] [2021-08-21 17:20:25,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:25,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:26,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:26,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602429963] [2021-08-21 17:20:26,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602429963] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:26,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:26,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-21 17:20:26,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295497238] [2021-08-21 17:20:26,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-21 17:20:26,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:26,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-21 17:20:26,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2021-08-21 17:20:26,484 INFO L87 Difference]: Start difference. First operand 126568 states and 200660 transitions. Second operand has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:36,068 INFO L93 Difference]: Finished difference Result 149391 states and 238066 transitions. [2021-08-21 17:20:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-08-21 17:20:36,069 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:20:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:36,384 INFO L225 Difference]: With dead ends: 149391 [2021-08-21 17:20:36,384 INFO L226 Difference]: Without dead ends: 149391 [2021-08-21 17:20:36,385 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 7160.0ms TimeCoverageRelationStatistics Valid=1863, Invalid=4457, Unknown=0, NotChecked=0, Total=6320 [2021-08-21 17:20:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149391 states. [2021-08-21 17:20:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149391 to 127879. [2021-08-21 17:20:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127879 states, 127727 states have (on average 1.5872524994715291) internal successors, (202735), 127878 states have internal predecessors, (202735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127879 states to 127879 states and 202735 transitions. [2021-08-21 17:20:38,962 INFO L78 Accepts]: Start accepts. Automaton has 127879 states and 202735 transitions. Word has length 108 [2021-08-21 17:20:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:38,962 INFO L470 AbstractCegarLoop]: Abstraction has 127879 states and 202735 transitions. [2021-08-21 17:20:38,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 127879 states and 202735 transitions. [2021-08-21 17:20:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-21 17:20:39,057 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:39,057 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:39,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-21 17:20:39,057 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)] === [2021-08-21 17:20:39,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:39,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2138062245, now seen corresponding path program 12 times [2021-08-21 17:20:39,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:39,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241638525] [2021-08-21 17:20:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:39,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:40,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:40,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241638525] [2021-08-21 17:20:40,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241638525] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:40,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:40,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-21 17:20:40,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806456641] [2021-08-21 17:20:40,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-21 17:20:40,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:40,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-21 17:20:40,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2021-08-21 17:20:40,107 INFO L87 Difference]: Start difference. First operand 127879 states and 202735 transitions. Second operand has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:53,496 INFO L93 Difference]: Finished difference Result 151684 states and 240934 transitions. [2021-08-21 17:20:53,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-08-21 17:20:53,497 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-21 17:20:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:53,796 INFO L225 Difference]: With dead ends: 151684 [2021-08-21 17:20:53,796 INFO L226 Difference]: Without dead ends: 151684 [2021-08-21 17:20:53,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1694 ImplicationChecksByTransitivity, 10699.2ms TimeCoverageRelationStatistics Valid=3221, Invalid=7699, Unknown=0, NotChecked=0, Total=10920 [2021-08-21 17:20:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151684 states. [2021-08-21 17:20:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151684 to 122274. [2021-08-21 17:20:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122274 states, 122122 states have (on average 1.586880332781972) internal successors, (193793), 122273 states have internal predecessors, (193793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122274 states to 122274 states and 193793 transitions. [2021-08-21 17:20:56,280 INFO L78 Accepts]: Start accepts. Automaton has 122274 states and 193793 transitions. Word has length 108 [2021-08-21 17:20:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:56,280 INFO L470 AbstractCegarLoop]: Abstraction has 122274 states and 193793 transitions. [2021-08-21 17:20:56,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 122274 states and 193793 transitions. [2021-08-21 17:20:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-21 17:20:56,373 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:56,373 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:56,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-21 17:20:56,373 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)] === [2021-08-21 17:20:56,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:56,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1082568971, now seen corresponding path program 1 times [2021-08-21 17:20:56,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:56,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771780328] [2021-08-21 17:20:56,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:56,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:57,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:57,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771780328] [2021-08-21 17:20:57,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771780328] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:57,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:57,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-08-21 17:20:57,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89852369] [2021-08-21 17:20:57,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-21 17:20:57,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-21 17:20:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1246, Unknown=0, NotChecked=0, Total=1332 [2021-08-21 17:20:57,622 INFO L87 Difference]: Start difference. First operand 122274 states and 193793 transitions. Second operand has 37 states, 37 states have (on average 3.0) internal successors, (111), 37 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:05,647 INFO L93 Difference]: Finished difference Result 216465 states and 349133 transitions. [2021-08-21 17:21:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 17:21:05,647 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.0) internal successors, (111), 37 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-08-21 17:21:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:06,386 INFO L225 Difference]: With dead ends: 216465 [2021-08-21 17:21:06,386 INFO L226 Difference]: Without dead ends: 216465 [2021-08-21 17:21:06,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 4808.3ms TimeCoverageRelationStatistics Valid=1183, Invalid=5623, Unknown=0, NotChecked=0, Total=6806 [2021-08-21 17:21:06,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216465 states. [2021-08-21 17:21:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216465 to 146736. [2021-08-21 17:21:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146736 states, 146584 states have (on average 1.5919268132947662) internal successors, (233351), 146735 states have internal predecessors, (233351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146736 states to 146736 states and 233351 transitions. [2021-08-21 17:21:09,760 INFO L78 Accepts]: Start accepts. Automaton has 146736 states and 233351 transitions. Word has length 111 [2021-08-21 17:21:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:09,760 INFO L470 AbstractCegarLoop]: Abstraction has 146736 states and 233351 transitions. [2021-08-21 17:21:09,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.0) internal successors, (111), 37 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 146736 states and 233351 transitions. [2021-08-21 17:21:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-21 17:21:09,869 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:09,869 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:09,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-21 17:21:09,869 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 17:21:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:09,870 INFO L82 PathProgramCache]: Analyzing trace with hash -800098678, now seen corresponding path program 1 times [2021-08-21 17:21:09,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:09,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128792302] [2021-08-21 17:21:09,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:09,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:11,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:11,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128792302] [2021-08-21 17:21:11,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128792302] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:11,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:11,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 17:21:11,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742650154] [2021-08-21 17:21:11,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 17:21:11,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:11,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 17:21:11,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 17:21:11,069 INFO L87 Difference]: Start difference. First operand 146736 states and 233351 transitions. Second operand has 36 states, 36 states have (on average 3.111111111111111) internal successors, (112), 36 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:18,159 INFO L93 Difference]: Finished difference Result 183693 states and 295811 transitions. [2021-08-21 17:21:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 17:21:18,159 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.111111111111111) internal successors, (112), 36 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-08-21 17:21:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:18,753 INFO L225 Difference]: With dead ends: 183693 [2021-08-21 17:21:18,753 INFO L226 Difference]: Without dead ends: 183693 [2021-08-21 17:21:18,753 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 4396.8ms TimeCoverageRelationStatistics Valid=1211, Invalid=5109, Unknown=0, NotChecked=0, Total=6320 [2021-08-21 17:21:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183693 states. [2021-08-21 17:21:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183693 to 126410. [2021-08-21 17:21:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126410 states, 126258 states have (on average 1.5885171632688622) internal successors, (200563), 126409 states have internal predecessors, (200563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126410 states to 126410 states and 200563 transitions. [2021-08-21 17:21:21,338 INFO L78 Accepts]: Start accepts. Automaton has 126410 states and 200563 transitions. Word has length 112 [2021-08-21 17:21:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:21,338 INFO L470 AbstractCegarLoop]: Abstraction has 126410 states and 200563 transitions. [2021-08-21 17:21:21,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.111111111111111) internal successors, (112), 36 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 126410 states and 200563 transitions. [2021-08-21 17:21:21,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-21 17:21:21,424 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:21,424 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:21,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-21 17:21:21,424 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 17:21:21,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:21,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1429076623, now seen corresponding path program 1 times [2021-08-21 17:21:21,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:21,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055088036] [2021-08-21 17:21:21,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:21,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:21,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:21,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055088036] [2021-08-21 17:21:21,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055088036] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:21,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:21,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-21 17:21:21,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777683040] [2021-08-21 17:21:21,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-21 17:21:21,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:21,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-21 17:21:21,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2021-08-21 17:21:21,835 INFO L87 Difference]: Start difference. First operand 126410 states and 200563 transitions. Second operand has 22 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:26,097 INFO L93 Difference]: Finished difference Result 394007 states and 624167 transitions. [2021-08-21 17:21:26,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-21 17:21:26,099 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-08-21 17:21:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:27,539 INFO L225 Difference]: With dead ends: 394007 [2021-08-21 17:21:27,540 INFO L226 Difference]: Without dead ends: 394007 [2021-08-21 17:21:27,540 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1122.3ms TimeCoverageRelationStatistics Valid=642, Invalid=1808, Unknown=0, NotChecked=0, Total=2450 [2021-08-21 17:21:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394007 states. [2021-08-21 17:21:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394007 to 281852. [2021-08-21 17:21:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281852 states, 281700 states have (on average 1.5838161164359248) internal successors, (446161), 281851 states have internal predecessors, (446161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281852 states to 281852 states and 446161 transitions. [2021-08-21 17:21:34,286 INFO L78 Accepts]: Start accepts. Automaton has 281852 states and 446161 transitions. Word has length 116 [2021-08-21 17:21:34,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:34,287 INFO L470 AbstractCegarLoop]: Abstraction has 281852 states and 446161 transitions. [2021-08-21 17:21:34,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 281852 states and 446161 transitions. [2021-08-21 17:21:34,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-21 17:21:34,541 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:34,541 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:34,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-21 17:21:34,541 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 17:21:34,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1908364485, now seen corresponding path program 2 times [2021-08-21 17:21:34,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:34,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318887652] [2021-08-21 17:21:34,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:34,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:34,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:34,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318887652] [2021-08-21 17:21:34,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318887652] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:34,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:34,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-21 17:21:34,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749905626] [2021-08-21 17:21:34,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-21 17:21:34,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:34,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-21 17:21:34,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-08-21 17:21:34,931 INFO L87 Difference]: Start difference. First operand 281852 states and 446161 transitions. Second operand has 22 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:43,553 INFO L93 Difference]: Finished difference Result 555691 states and 874395 transitions. [2021-08-21 17:21:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-08-21 17:21:43,554 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-08-21 17:21:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:45,445 INFO L225 Difference]: With dead ends: 555691 [2021-08-21 17:21:45,445 INFO L226 Difference]: Without dead ends: 555691 [2021-08-21 17:21:45,445 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2441 ImplicationChecksByTransitivity, 4913.7ms TimeCoverageRelationStatistics Valid=2484, Invalid=7616, Unknown=0, NotChecked=0, Total=10100 [2021-08-21 17:21:46,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555691 states. [2021-08-21 17:21:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555691 to 232143. [2021-08-21 17:21:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232143 states, 231991 states have (on average 1.5902858300537521) internal successors, (368932), 232142 states have internal predecessors, (368932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232143 states to 232143 states and 368932 transitions. [2021-08-21 17:21:53,221 INFO L78 Accepts]: Start accepts. Automaton has 232143 states and 368932 transitions. Word has length 116 [2021-08-21 17:21:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:53,221 INFO L470 AbstractCegarLoop]: Abstraction has 232143 states and 368932 transitions. [2021-08-21 17:21:53,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 232143 states and 368932 transitions. [2021-08-21 17:21:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-21 17:21:53,475 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:53,475 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:53,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-21 17:21:53,476 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 17:21:53,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:53,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1898859497, now seen corresponding path program 3 times [2021-08-21 17:21:53,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:53,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173688607] [2021-08-21 17:21:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:53,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:54,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:54,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173688607] [2021-08-21 17:21:54,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173688607] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:54,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:54,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-08-21 17:21:54,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344487685] [2021-08-21 17:21:54,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-21 17:21:54,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:54,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-21 17:21:54,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2021-08-21 17:21:54,146 INFO L87 Difference]: Start difference. First operand 232143 states and 368932 transitions. Second operand has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:22:00,136 INFO L93 Difference]: Finished difference Result 564639 states and 898741 transitions. [2021-08-21 17:22:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-21 17:22:00,136 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-08-21 17:22:00,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:22:02,191 INFO L225 Difference]: With dead ends: 564639 [2021-08-21 17:22:02,192 INFO L226 Difference]: Without dead ends: 564639 [2021-08-21 17:22:02,192 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2073.9ms TimeCoverageRelationStatistics Valid=763, Invalid=2099, Unknown=0, NotChecked=0, Total=2862 [2021-08-21 17:22:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564639 states. [2021-08-21 17:22:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564639 to 314239. [2021-08-21 17:22:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314239 states, 314087 states have (on average 1.5962392585493828) internal successors, (501358), 314238 states have internal predecessors, (501358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314239 states to 314239 states and 501358 transitions. [2021-08-21 17:22:10,397 INFO L78 Accepts]: Start accepts. Automaton has 314239 states and 501358 transitions. Word has length 116 [2021-08-21 17:22:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:22:10,398 INFO L470 AbstractCegarLoop]: Abstraction has 314239 states and 501358 transitions. [2021-08-21 17:22:10,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 314239 states and 501358 transitions. [2021-08-21 17:22:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-21 17:22:11,073 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:22:11,073 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:22:11,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-21 17:22:11,073 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 17:22:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:22:11,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1904272806, now seen corresponding path program 1 times [2021-08-21 17:22:11,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:22:11,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826515691] [2021-08-21 17:22:11,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:22:11,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:22:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:22:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:22:13,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:22:13,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826515691] [2021-08-21 17:22:13,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826515691] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:22:13,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:22:13,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-08-21 17:22:13,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633644055] [2021-08-21 17:22:13,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-08-21 17:22:13,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:22:13,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-08-21 17:22:13,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2138, Unknown=0, NotChecked=0, Total=2256 [2021-08-21 17:22:13,013 INFO L87 Difference]: Start difference. First operand 314239 states and 501358 transitions. Second operand has 48 states, 48 states have (on average 2.4791666666666665) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:22:29,044 INFO L93 Difference]: Finished difference Result 432441 states and 687932 transitions. [2021-08-21 17:22:29,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-08-21 17:22:29,045 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.4791666666666665) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-08-21 17:22:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:22:31,294 INFO L225 Difference]: With dead ends: 432441 [2021-08-21 17:22:31,295 INFO L226 Difference]: Without dead ends: 432441 [2021-08-21 17:22:31,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 10132.7ms TimeCoverageRelationStatistics Valid=2143, Invalid=12619, Unknown=0, NotChecked=0, Total=14762 [2021-08-21 17:22:32,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432441 states. [2021-08-21 17:22:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432441 to 365003. [2021-08-21 17:22:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365003 states, 364851 states have (on average 1.5941630967161937) internal successors, (581632), 365002 states have internal predecessors, (581632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365003 states to 365003 states and 581632 transitions. [2021-08-21 17:22:39,189 INFO L78 Accepts]: Start accepts. Automaton has 365003 states and 581632 transitions. Word has length 119 [2021-08-21 17:22:39,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:22:39,189 INFO L470 AbstractCegarLoop]: Abstraction has 365003 states and 581632 transitions. [2021-08-21 17:22:39,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.4791666666666665) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 365003 states and 581632 transitions. [2021-08-21 17:22:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-21 17:22:39,924 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:22:39,924 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:22:39,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-21 17:22:39,925 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 17:22:39,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:22:39,926 INFO L82 PathProgramCache]: Analyzing trace with hash -394159482, now seen corresponding path program 2 times [2021-08-21 17:22:39,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:22:39,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322061332] [2021-08-21 17:22:39,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:22:39,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:22:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:22:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:22:41,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:22:41,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322061332] [2021-08-21 17:22:41,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322061332] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:22:41,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:22:41,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-08-21 17:22:41,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644094274] [2021-08-21 17:22:41,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-08-21 17:22:41,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:22:41,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-08-21 17:22:41,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2136, Unknown=0, NotChecked=0, Total=2256 [2021-08-21 17:22:41,943 INFO L87 Difference]: Start difference. First operand 365003 states and 581632 transitions. Second operand has 48 states, 48 states have (on average 2.4791666666666665) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:22:58,134 INFO L93 Difference]: Finished difference Result 466523 states and 743125 transitions. [2021-08-21 17:22:58,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-08-21 17:22:58,135 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.4791666666666665) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-08-21 17:22:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:22:59,699 INFO L225 Difference]: With dead ends: 466523 [2021-08-21 17:22:59,700 INFO L226 Difference]: Without dead ends: 466523 [2021-08-21 17:22:59,700 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2723 ImplicationChecksByTransitivity, 9871.7ms TimeCoverageRelationStatistics Valid=2021, Invalid=11551, Unknown=0, NotChecked=0, Total=13572 [2021-08-21 17:23:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466523 states. [2021-08-21 17:23:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466523 to 360075. [2021-08-21 17:23:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360075 states, 359923 states have (on average 1.5983863215187692) internal successors, (575296), 360074 states have internal predecessors, (575296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:23:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360075 states to 360075 states and 575296 transitions. [2021-08-21 17:23:07,706 INFO L78 Accepts]: Start accepts. Automaton has 360075 states and 575296 transitions. Word has length 119 [2021-08-21 17:23:07,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:23:07,707 INFO L470 AbstractCegarLoop]: Abstraction has 360075 states and 575296 transitions. [2021-08-21 17:23:07,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.4791666666666665) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:23:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 360075 states and 575296 transitions. [2021-08-21 17:23:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-21 17:23:08,516 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:23:08,516 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:23:08,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-21 17:23:08,517 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 17:23:08,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:23:08,517 INFO L82 PathProgramCache]: Analyzing trace with hash 92545524, now seen corresponding path program 3 times [2021-08-21 17:23:08,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:23:08,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824763812] [2021-08-21 17:23:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:23:08,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:23:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:23:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:23:10,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:23:10,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824763812] [2021-08-21 17:23:10,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824763812] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:23:10,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:23:10,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-08-21 17:23:10,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595831554] [2021-08-21 17:23:10,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-08-21 17:23:10,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:23:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-08-21 17:23:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2021-08-21 17:23:10,929 INFO L87 Difference]: Start difference. First operand 360075 states and 575296 transitions. Second operand has 47 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 47 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:23:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:23:27,845 INFO L93 Difference]: Finished difference Result 518849 states and 825523 transitions. [2021-08-21 17:23:27,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-08-21 17:23:27,846 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 47 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-08-21 17:23:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:23:29,406 INFO L225 Difference]: With dead ends: 518849 [2021-08-21 17:23:29,406 INFO L226 Difference]: Without dead ends: 518849 [2021-08-21 17:23:29,407 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3205 ImplicationChecksByTransitivity, 10432.7ms TimeCoverageRelationStatistics Valid=2117, Invalid=12403, Unknown=0, NotChecked=0, Total=14520 [2021-08-21 17:23:30,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518849 states. [2021-08-21 17:23:36,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518849 to 373919. [2021-08-21 17:23:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373919 states, 373767 states have (on average 1.5962645177343104) internal successors, (596631), 373918 states have internal predecessors, (596631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:23:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373919 states to 373919 states and 596631 transitions. [2021-08-21 17:23:38,512 INFO L78 Accepts]: Start accepts. Automaton has 373919 states and 596631 transitions. Word has length 119 [2021-08-21 17:23:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:23:38,512 INFO L470 AbstractCegarLoop]: Abstraction has 373919 states and 596631 transitions. [2021-08-21 17:23:38,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 47 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:23:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 373919 states and 596631 transitions. [2021-08-21 17:23:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-21 17:23:39,290 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:23:39,290 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:23:39,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-21 17:23:39,290 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 17:23:39,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:23:39,291 INFO L82 PathProgramCache]: Analyzing trace with hash -445653899, now seen corresponding path program 1 times [2021-08-21 17:23:39,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:23:39,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871420934] [2021-08-21 17:23:39,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:23:39,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:23:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:23:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:23:39,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:23:39,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871420934] [2021-08-21 17:23:39,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871420934] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:23:39,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:23:39,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-21 17:23:39,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596799337] [2021-08-21 17:23:39,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-21 17:23:39,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:23:39,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-21 17:23:39,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-08-21 17:23:39,753 INFO L87 Difference]: Start difference. First operand 373919 states and 596631 transitions. Second operand has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:23:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:23:45,996 INFO L93 Difference]: Finished difference Result 650159 states and 1033191 transitions. [2021-08-21 17:23:45,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-21 17:23:45,997 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-08-21 17:23:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:23:48,456 INFO L225 Difference]: With dead ends: 650159 [2021-08-21 17:23:48,456 INFO L226 Difference]: Without dead ends: 650159 [2021-08-21 17:23:48,457 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1209.8ms TimeCoverageRelationStatistics Valid=641, Invalid=1809, Unknown=0, NotChecked=0, Total=2450 [2021-08-21 17:23:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650159 states. [2021-08-21 17:23:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650159 to 432641. [2021-08-21 17:23:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432641 states, 432489 states have (on average 1.5940914104173747) internal successors, (689427), 432640 states have internal predecessors, (689427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:23:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432641 states to 432641 states and 689427 transitions. [2021-08-21 17:23:59,840 INFO L78 Accepts]: Start accepts. Automaton has 432641 states and 689427 transitions. Word has length 121 [2021-08-21 17:23:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:23:59,840 INFO L470 AbstractCegarLoop]: Abstraction has 432641 states and 689427 transitions. [2021-08-21 17:23:59,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:23:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 432641 states and 689427 transitions.