/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-bc289cb [2022-01-28 12:23:47,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-28 12:23:47,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-28 12:23:47,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-28 12:23:47,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-28 12:23:47,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-28 12:23:47,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-28 12:23:47,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-28 12:23:47,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-28 12:23:47,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-28 12:23:47,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-28 12:23:47,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-28 12:23:47,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-28 12:23:47,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-28 12:23:47,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-28 12:23:47,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-28 12:23:47,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-28 12:23:47,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-28 12:23:47,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-28 12:23:47,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-28 12:23:47,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-28 12:23:47,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-28 12:23:47,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-28 12:23:47,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-28 12:23:47,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-28 12:23:47,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-28 12:23:47,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-28 12:23:47,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-28 12:23:47,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-28 12:23:47,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-28 12:23:47,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-28 12:23:47,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-28 12:23:47,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-28 12:23:47,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-28 12:23:47,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-28 12:23:47,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-28 12:23:47,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-28 12:23:47,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-28 12:23:47,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-28 12:23:47,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-28 12:23:47,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-28 12:23:47,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-28 12:23:47,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-28 12:23:47,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-28 12:23:47,410 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-28 12:23:47,410 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-28 12:23:47,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-28 12:23:47,411 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-28 12:23:47,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-28 12:23:47,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-28 12:23:47,412 INFO L138 SettingsManager]: * Use SBE=true [2022-01-28 12:23:47,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-28 12:23:47,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-28 12:23:47,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-28 12:23:47,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-28 12:23:47,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-28 12:23:47,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-28 12:23:47,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-28 12:23:47,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-28 12:23:47,413 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-28 12:23:47,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-28 12:23:47,414 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-28 12:23:47,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-28 12:23:47,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-28 12:23:47,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-28 12:23:47,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-28 12:23:47,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-28 12:23:47,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 12:23:47,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-28 12:23:47,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-28 12:23:47,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-28 12:23:47,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-28 12:23:47,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-28 12:23:47,415 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-28 12:23:47,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-28 12:23:47,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-28 12:23:47,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-28 12:23:47,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-28 12:23:47,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-28 12:23:47,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-28 12:23:47,663 INFO L275 PluginConnector]: CDTParser initialized [2022-01-28 12:23:47,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-01-28 12:23:47,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5e038dd/fab426c54e004157b5434aa337ca3c5b/FLAG9810abdb3 [2022-01-28 12:23:48,206 INFO L306 CDTParser]: Found 1 translation units. [2022-01-28 12:23:48,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-01-28 12:23:48,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5e038dd/fab426c54e004157b5434aa337ca3c5b/FLAG9810abdb3 [2022-01-28 12:23:48,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5e038dd/fab426c54e004157b5434aa337ca3c5b [2022-01-28 12:23:48,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-28 12:23:48,518 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-28 12:23:48,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-28 12:23:48,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-28 12:23:48,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-28 12:23:48,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:23:48" (1/1) ... [2022-01-28 12:23:48,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2c7df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:48, skipping insertion in model container [2022-01-28 12:23:48,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:23:48" (1/1) ... [2022-01-28 12:23:48,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-28 12:23:48,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-28 12:23:48,724 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-28 12:23:48,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39095,39108] [2022-01-28 12:23:48,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39180,39193] [2022-01-28 12:23:48,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39232,39245] [2022-01-28 12:23:48,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49285,49298] [2022-01-28 12:23:48,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49334,49347] [2022-01-28 12:23:48,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49462,49475] [2022-01-28 12:23:48,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49520,49533] [2022-01-28 12:23:49,006 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 12:23:49,010 INFO L203 MainTranslator]: Completed pre-run [2022-01-28 12:23:49,019 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-28 12:23:49,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39095,39108] [2022-01-28 12:23:49,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39180,39193] [2022-01-28 12:23:49,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39232,39245] [2022-01-28 12:23:49,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49285,49298] [2022-01-28 12:23:49,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49334,49347] [2022-01-28 12:23:49,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49462,49475] [2022-01-28 12:23:49,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49520,49533] [2022-01-28 12:23:49,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 12:23:49,100 INFO L208 MainTranslator]: Completed translation [2022-01-28 12:23:49,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49 WrapperNode [2022-01-28 12:23:49,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-28 12:23:49,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-28 12:23:49,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-28 12:23:49,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-28 12:23:49,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49" (1/1) ... [2022-01-28 12:23:49,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49" (1/1) ... [2022-01-28 12:23:49,156 INFO L137 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 190 [2022-01-28 12:23:49,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-28 12:23:49,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-28 12:23:49,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-28 12:23:49,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-28 12:23:49,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49" (1/1) ... [2022-01-28 12:23:49,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49" (1/1) ... [2022-01-28 12:23:49,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49" (1/1) ... [2022-01-28 12:23:49,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49" (1/1) ... [2022-01-28 12:23:49,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49" (1/1) ... [2022-01-28 12:23:49,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49" (1/1) ... [2022-01-28 12:23:49,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49" (1/1) ... [2022-01-28 12:23:49,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-28 12:23:49,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-28 12:23:49,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-28 12:23:49,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-28 12:23:49,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49" (1/1) ... [2022-01-28 12:23:49,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 12:23:49,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 12:23:49,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-28 12:23:49,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-28 12:23:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-01-28 12:23:49,272 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-01-28 12:23:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-01-28 12:23:49,272 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-01-28 12:23:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-28 12:23:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-28 12:23:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-28 12:23:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-28 12:23:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-28 12:23:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-28 12:23:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-28 12:23:49,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-28 12:23:49,274 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-28 12:23:49,427 INFO L234 CfgBuilder]: Building ICFG [2022-01-28 12:23:49,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-28 12:23:49,750 INFO L275 CfgBuilder]: Performing block encoding [2022-01-28 12:23:49,758 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-28 12:23:49,758 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-28 12:23:49,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:23:49 BoogieIcfgContainer [2022-01-28 12:23:49,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-28 12:23:49,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-28 12:23:49,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-28 12:23:49,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-28 12:23:49,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:23:48" (1/3) ... [2022-01-28 12:23:49,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f3d5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:23:49, skipping insertion in model container [2022-01-28 12:23:49,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:23:49" (2/3) ... [2022-01-28 12:23:49,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f3d5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:23:49, skipping insertion in model container [2022-01-28 12:23:49,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:23:49" (3/3) ... [2022-01-28 12:23:49,772 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2022-01-28 12:23:49,776 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-28 12:23:49,777 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-28 12:23:49,777 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-28 12:23:49,777 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-28 12:23:49,835 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,836 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,836 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,836 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,836 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,836 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,837 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,837 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,837 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,837 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,838 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,838 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,838 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,838 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,838 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,839 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,839 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,840 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,840 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,841 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,841 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,841 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,841 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,841 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,841 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,843 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,843 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,843 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,843 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,843 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,843 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,848 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,848 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,849 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,849 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,849 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,849 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,849 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,849 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,849 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,850 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,850 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,850 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,851 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,851 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,853 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,865 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,865 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,865 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,865 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,865 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,866 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,867 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,867 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,867 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,867 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,867 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,868 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,868 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,868 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,875 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,878 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,879 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,881 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,881 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,881 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,881 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,881 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,881 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,883 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,883 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,883 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,888 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,888 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,891 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,891 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,891 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,891 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,891 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,891 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,894 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,894 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,894 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,894 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,894 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,894 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,894 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,894 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,894 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,894 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,895 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,895 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,895 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,895 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,895 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,895 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,895 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,895 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,896 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,896 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,896 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,896 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,896 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,896 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,905 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,905 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,905 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,907 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,907 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,907 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,907 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,907 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,907 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,907 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,907 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,907 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,908 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,908 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,908 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,908 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,908 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,908 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,908 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,908 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,909 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,909 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,909 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,909 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,909 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,909 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,909 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,909 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,910 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,910 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,910 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,910 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,910 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,910 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,910 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,910 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,910 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,910 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,911 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,911 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,911 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,911 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,922 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,922 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,922 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,922 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,924 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,924 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,924 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,924 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,926 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:23:49,929 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-28 12:23:49,958 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-28 12:23:49,964 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-28 12:23:49,964 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-01-28 12:23:49,974 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 210 places, 220 transitions, 456 flow [2022-01-28 12:23:52,499 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 88749 states, 88744 states have (on average 3.2628121337780582) internal successors, (289555), 88748 states have internal predecessors, (289555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:23:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 88749 states, 88744 states have (on average 3.2628121337780582) internal successors, (289555), 88748 states have internal predecessors, (289555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:23:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-28 12:23:52,983 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:23:52,984 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:23:52,984 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:23:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:23:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1408739966, now seen corresponding path program 1 times [2022-01-28 12:23:52,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:23:52,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608571526] [2022-01-28 12:23:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:23:52,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:23:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:23:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:23:53,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:23:53,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608571526] [2022-01-28 12:23:53,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608571526] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:23:53,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:23:53,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-28 12:23:53,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440126391] [2022-01-28 12:23:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:23:53,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-28 12:23:53,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:23:53,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-28 12:23:53,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-01-28 12:23:53,936 INFO L87 Difference]: Start difference. First operand has 88749 states, 88744 states have (on average 3.2628121337780582) internal successors, (289555), 88748 states have internal predecessors, (289555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:23:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:23:57,003 INFO L93 Difference]: Finished difference Result 101011 states and 310954 transitions. [2022-01-28 12:23:57,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-28 12:23:57,006 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-01-28 12:23:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:23:57,878 INFO L225 Difference]: With dead ends: 101011 [2022-01-28 12:23:57,879 INFO L226 Difference]: Without dead ends: 100951 [2022-01-28 12:23:57,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=436, Invalid=1204, Unknown=0, NotChecked=0, Total=1640 [2022-01-28 12:23:57,888 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 1127 mSDsluCounter, 3876 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-28 12:23:57,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1127 Valid, 4283 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-28 12:23:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100951 states. [2022-01-28 12:24:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100951 to 95266. [2022-01-28 12:24:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95266 states, 95262 states have (on average 3.0807562301862235) internal successors, (293479), 95265 states have internal predecessors, (293479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95266 states to 95266 states and 293479 transitions. [2022-01-28 12:24:01,952 INFO L78 Accepts]: Start accepts. Automaton has 95266 states and 293479 transitions. Word has length 83 [2022-01-28 12:24:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:24:01,955 INFO L470 AbstractCegarLoop]: Abstraction has 95266 states and 293479 transitions. [2022-01-28 12:24:01,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 95266 states and 293479 transitions. [2022-01-28 12:24:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-28 12:24:02,343 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:24:02,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:24:02,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-28 12:24:02,343 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:24:02,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:24:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash -176902823, now seen corresponding path program 1 times [2022-01-28 12:24:02,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:24:02,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776094919] [2022-01-28 12:24:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:24:02,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:24:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:24:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:24:02,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:24:02,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776094919] [2022-01-28 12:24:02,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776094919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:24:02,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:24:02,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-28 12:24:02,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113803769] [2022-01-28 12:24:02,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:24:02,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-28 12:24:02,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:24:02,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-28 12:24:02,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-01-28 12:24:02,849 INFO L87 Difference]: Start difference. First operand 95266 states and 293479 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:07,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:24:07,089 INFO L93 Difference]: Finished difference Result 153195 states and 472281 transitions. [2022-01-28 12:24:07,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-28 12:24:07,091 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-28 12:24:07,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:24:07,766 INFO L225 Difference]: With dead ends: 153195 [2022-01-28 12:24:07,766 INFO L226 Difference]: Without dead ends: 152229 [2022-01-28 12:24:07,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=535, Invalid=1357, Unknown=0, NotChecked=0, Total=1892 [2022-01-28 12:24:07,768 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 2688 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 5405 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-28 12:24:07,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2688 Valid, 5405 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-28 12:24:08,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152229 states. [2022-01-28 12:24:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152229 to 120205. [2022-01-28 12:24:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120205 states, 120201 states have (on average 3.0863803129757654) internal successors, (370986), 120204 states have internal predecessors, (370986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120205 states to 120205 states and 370986 transitions. [2022-01-28 12:24:12,530 INFO L78 Accepts]: Start accepts. Automaton has 120205 states and 370986 transitions. Word has length 88 [2022-01-28 12:24:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:24:12,530 INFO L470 AbstractCegarLoop]: Abstraction has 120205 states and 370986 transitions. [2022-01-28 12:24:12,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 120205 states and 370986 transitions. [2022-01-28 12:24:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-28 12:24:12,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:24:12,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:24:12,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-28 12:24:12,962 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:24:12,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:24:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash 929430313, now seen corresponding path program 2 times [2022-01-28 12:24:12,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:24:12,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698337596] [2022-01-28 12:24:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:24:12,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:24:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:24:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:24:13,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:24:13,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698337596] [2022-01-28 12:24:13,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698337596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:24:13,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:24:13,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-28 12:24:13,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257371156] [2022-01-28 12:24:13,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:24:13,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-28 12:24:13,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:24:13,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-28 12:24:13,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-01-28 12:24:13,411 INFO L87 Difference]: Start difference. First operand 120205 states and 370986 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:24:17,084 INFO L93 Difference]: Finished difference Result 159338 states and 491229 transitions. [2022-01-28 12:24:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-28 12:24:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-28 12:24:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:24:18,057 INFO L225 Difference]: With dead ends: 159338 [2022-01-28 12:24:18,057 INFO L226 Difference]: Without dead ends: 159086 [2022-01-28 12:24:18,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2022-01-28 12:24:18,059 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 2687 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 5439 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-28 12:24:18,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2687 Valid, 5439 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-28 12:24:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159086 states. [2022-01-28 12:24:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159086 to 118249. [2022-01-28 12:24:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118249 states, 118245 states have (on average 3.086515286058607) internal successors, (364965), 118248 states have internal predecessors, (364965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118249 states to 118249 states and 364965 transitions. [2022-01-28 12:24:22,164 INFO L78 Accepts]: Start accepts. Automaton has 118249 states and 364965 transitions. Word has length 88 [2022-01-28 12:24:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:24:22,165 INFO L470 AbstractCegarLoop]: Abstraction has 118249 states and 364965 transitions. [2022-01-28 12:24:22,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand 118249 states and 364965 transitions. [2022-01-28 12:24:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-28 12:24:22,240 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:24:22,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:24:22,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-28 12:24:22,241 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:24:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:24:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1579355583, now seen corresponding path program 3 times [2022-01-28 12:24:22,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:24:22,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256239570] [2022-01-28 12:24:22,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:24:22,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:24:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:24:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:24:23,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:24:23,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256239570] [2022-01-28 12:24:23,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256239570] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:24:23,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:24:23,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-28 12:24:23,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695776858] [2022-01-28 12:24:23,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:24:23,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-28 12:24:23,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:24:23,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-28 12:24:23,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-01-28 12:24:23,115 INFO L87 Difference]: Start difference. First operand 118249 states and 364965 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:24:26,920 INFO L93 Difference]: Finished difference Result 131753 states and 405812 transitions. [2022-01-28 12:24:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-28 12:24:26,921 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-28 12:24:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:24:27,292 INFO L225 Difference]: With dead ends: 131753 [2022-01-28 12:24:27,293 INFO L226 Difference]: Without dead ends: 131585 [2022-01-28 12:24:27,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=395, Invalid=1087, Unknown=0, NotChecked=0, Total=1482 [2022-01-28 12:24:27,294 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 2365 mSDsluCounter, 4154 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 4741 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-28 12:24:27,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2365 Valid, 4741 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-28 12:24:27,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131585 states. [2022-01-28 12:24:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131585 to 111213. [2022-01-28 12:24:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111213 states, 111209 states have (on average 3.0827271174095623) internal successors, (342827), 111212 states have internal predecessors, (342827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111213 states to 111213 states and 342827 transitions. [2022-01-28 12:24:31,081 INFO L78 Accepts]: Start accepts. Automaton has 111213 states and 342827 transitions. Word has length 88 [2022-01-28 12:24:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:24:31,081 INFO L470 AbstractCegarLoop]: Abstraction has 111213 states and 342827 transitions. [2022-01-28 12:24:31,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 111213 states and 342827 transitions. [2022-01-28 12:24:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:24:31,185 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:24:31,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:24:31,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-28 12:24:31,185 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:24:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:24:31,187 INFO L85 PathProgramCache]: Analyzing trace with hash -903700515, now seen corresponding path program 1 times [2022-01-28 12:24:31,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:24:31,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36971381] [2022-01-28 12:24:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:24:31,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:24:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:24:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:24:32,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:24:32,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36971381] [2022-01-28 12:24:32,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36971381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:24:32,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:24:32,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:24:32,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045662595] [2022-01-28 12:24:32,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:24:32,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:24:32,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:24:32,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:24:32,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:24:32,512 INFO L87 Difference]: Start difference. First operand 111213 states and 342827 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:24:41,601 INFO L93 Difference]: Finished difference Result 163236 states and 502706 transitions. [2022-01-28 12:24:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-28 12:24:41,601 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:24:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:24:42,089 INFO L225 Difference]: With dead ends: 163236 [2022-01-28 12:24:42,089 INFO L226 Difference]: Without dead ends: 163236 [2022-01-28 12:24:42,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-01-28 12:24:42,091 INFO L933 BasicCegarLoop]: 1038 mSDtfsCounter, 2940 mSDsluCounter, 9878 mSDsCounter, 0 mSdLazyCounter, 3846 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2940 SdHoareTripleChecker+Valid, 10916 SdHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-28 12:24:42,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2940 Valid, 10916 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3846 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-28 12:24:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163236 states. [2022-01-28 12:24:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163236 to 112825. [2022-01-28 12:24:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112825 states, 112821 states have (on average 3.0824935074143998) internal successors, (347770), 112824 states have internal predecessors, (347770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112825 states to 112825 states and 347770 transitions. [2022-01-28 12:24:46,226 INFO L78 Accepts]: Start accepts. Automaton has 112825 states and 347770 transitions. Word has length 105 [2022-01-28 12:24:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:24:46,227 INFO L470 AbstractCegarLoop]: Abstraction has 112825 states and 347770 transitions. [2022-01-28 12:24:46,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 112825 states and 347770 transitions. [2022-01-28 12:24:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:24:46,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:24:46,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:24:46,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-28 12:24:46,349 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:24:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:24:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash -535260145, now seen corresponding path program 2 times [2022-01-28 12:24:46,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:24:46,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223583713] [2022-01-28 12:24:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:24:46,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:24:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:24:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:24:47,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:24:47,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223583713] [2022-01-28 12:24:47,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223583713] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:24:47,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:24:47,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:24:47,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387081940] [2022-01-28 12:24:47,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:24:47,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:24:47,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:24:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:24:47,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:24:47,641 INFO L87 Difference]: Start difference. First operand 112825 states and 347770 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:24:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:24:59,290 INFO L93 Difference]: Finished difference Result 170538 states and 525251 transitions. [2022-01-28 12:24:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-28 12:24:59,291 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:24:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:25:00,122 INFO L225 Difference]: With dead ends: 170538 [2022-01-28 12:25:00,122 INFO L226 Difference]: Without dead ends: 170538 [2022-01-28 12:25:00,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-01-28 12:25:00,124 INFO L933 BasicCegarLoop]: 1323 mSDtfsCounter, 3249 mSDsluCounter, 11866 mSDsCounter, 0 mSdLazyCounter, 4594 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3249 SdHoareTripleChecker+Valid, 13189 SdHoareTripleChecker+Invalid, 4671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-28 12:25:00,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3249 Valid, 13189 Invalid, 4671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4594 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-28 12:25:00,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170538 states. [2022-01-28 12:25:03,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170538 to 113321. [2022-01-28 12:25:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113321 states, 113317 states have (on average 3.0827589858538436) internal successors, (349329), 113320 states have internal predecessors, (349329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113321 states to 113321 states and 349329 transitions. [2022-01-28 12:25:05,254 INFO L78 Accepts]: Start accepts. Automaton has 113321 states and 349329 transitions. Word has length 105 [2022-01-28 12:25:05,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:25:05,254 INFO L470 AbstractCegarLoop]: Abstraction has 113321 states and 349329 transitions. [2022-01-28 12:25:05,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 113321 states and 349329 transitions. [2022-01-28 12:25:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:25:05,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:25:05,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:25:05,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-28 12:25:05,361 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:25:05,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:25:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash -813579587, now seen corresponding path program 3 times [2022-01-28 12:25:05,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:25:05,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361853907] [2022-01-28 12:25:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:25:05,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:25:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:25:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:25:06,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:25:06,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361853907] [2022-01-28 12:25:06,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361853907] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:25:06,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:25:06,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:25:06,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034491963] [2022-01-28 12:25:06,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:25:06,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:25:06,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:25:06,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:25:06,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:25:06,875 INFO L87 Difference]: Start difference. First operand 113321 states and 349329 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:17,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:25:17,742 INFO L93 Difference]: Finished difference Result 168926 states and 520215 transitions. [2022-01-28 12:25:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-28 12:25:17,743 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:25:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:25:18,250 INFO L225 Difference]: With dead ends: 168926 [2022-01-28 12:25:18,250 INFO L226 Difference]: Without dead ends: 168926 [2022-01-28 12:25:18,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2094, Invalid=5046, Unknown=0, NotChecked=0, Total=7140 [2022-01-28 12:25:18,252 INFO L933 BasicCegarLoop]: 1370 mSDtfsCounter, 2682 mSDsluCounter, 11129 mSDsCounter, 0 mSdLazyCounter, 4274 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 12499 SdHoareTripleChecker+Invalid, 4358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 4274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-28 12:25:18,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2682 Valid, 12499 Invalid, 4358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 4274 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-28 12:25:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168926 states. [2022-01-28 12:25:21,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168926 to 121350. [2022-01-28 12:25:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121350 states, 121346 states have (on average 3.0848565259670693) internal successors, (374335), 121349 states have internal predecessors, (374335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121350 states to 121350 states and 374335 transitions. [2022-01-28 12:25:21,792 INFO L78 Accepts]: Start accepts. Automaton has 121350 states and 374335 transitions. Word has length 105 [2022-01-28 12:25:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:25:21,792 INFO L470 AbstractCegarLoop]: Abstraction has 121350 states and 374335 transitions. [2022-01-28 12:25:21,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 121350 states and 374335 transitions. [2022-01-28 12:25:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:25:22,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:25:22,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:25:22,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-28 12:25:22,312 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:25:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:25:22,314 INFO L85 PathProgramCache]: Analyzing trace with hash -357336867, now seen corresponding path program 4 times [2022-01-28 12:25:22,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:25:22,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175769287] [2022-01-28 12:25:22,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:25:22,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:25:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:25:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:25:23,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:25:23,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175769287] [2022-01-28 12:25:23,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175769287] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:25:23,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:25:23,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:25:23,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694355401] [2022-01-28 12:25:23,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:25:23,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:25:23,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:25:23,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:25:23,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:25:23,090 INFO L87 Difference]: Start difference. First operand 121350 states and 374335 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:25:31,027 INFO L93 Difference]: Finished difference Result 181721 states and 560556 transitions. [2022-01-28 12:25:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-28 12:25:31,044 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:25:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:25:31,594 INFO L225 Difference]: With dead ends: 181721 [2022-01-28 12:25:31,594 INFO L226 Difference]: Without dead ends: 181721 [2022-01-28 12:25:31,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-28 12:25:31,596 INFO L933 BasicCegarLoop]: 804 mSDtfsCounter, 2955 mSDsluCounter, 9910 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2955 SdHoareTripleChecker+Valid, 10714 SdHoareTripleChecker+Invalid, 4023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-28 12:25:31,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2955 Valid, 10714 Invalid, 4023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-28 12:25:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181721 states. [2022-01-28 12:25:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181721 to 128356. [2022-01-28 12:25:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128356 states, 128352 states have (on average 3.0888961605584644) internal successors, (396466), 128355 states have internal predecessors, (396466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128356 states to 128356 states and 396466 transitions. [2022-01-28 12:25:35,770 INFO L78 Accepts]: Start accepts. Automaton has 128356 states and 396466 transitions. Word has length 105 [2022-01-28 12:25:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:25:35,771 INFO L470 AbstractCegarLoop]: Abstraction has 128356 states and 396466 transitions. [2022-01-28 12:25:35,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 128356 states and 396466 transitions. [2022-01-28 12:25:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:25:35,914 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:25:35,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:25:35,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-28 12:25:35,914 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:25:35,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:25:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1485183559, now seen corresponding path program 5 times [2022-01-28 12:25:35,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:25:35,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140195148] [2022-01-28 12:25:35,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:25:35,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:25:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:25:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:25:36,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:25:36,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140195148] [2022-01-28 12:25:36,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140195148] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:25:36,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:25:36,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-28 12:25:36,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248670169] [2022-01-28 12:25:36,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:25:36,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-28 12:25:36,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:25:36,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-28 12:25:36,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-28 12:25:36,587 INFO L87 Difference]: Start difference. First operand 128356 states and 396466 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:25:42,122 INFO L93 Difference]: Finished difference Result 179706 states and 554136 transitions. [2022-01-28 12:25:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-28 12:25:42,123 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:25:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:25:42,644 INFO L225 Difference]: With dead ends: 179706 [2022-01-28 12:25:42,644 INFO L226 Difference]: Without dead ends: 179706 [2022-01-28 12:25:42,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-01-28 12:25:42,645 INFO L933 BasicCegarLoop]: 773 mSDtfsCounter, 2754 mSDsluCounter, 8247 mSDsCounter, 0 mSdLazyCounter, 3237 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2754 SdHoareTripleChecker+Valid, 9020 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 3237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-28 12:25:42,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2754 Valid, 9020 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 3237 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-28 12:25:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179706 states. [2022-01-28 12:25:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179706 to 129999. [2022-01-28 12:25:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129999 states, 129995 states have (on average 3.0886572560483097) internal successors, (401510), 129998 states have internal predecessors, (401510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129999 states to 129999 states and 401510 transitions. [2022-01-28 12:25:46,865 INFO L78 Accepts]: Start accepts. Automaton has 129999 states and 401510 transitions. Word has length 105 [2022-01-28 12:25:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:25:46,865 INFO L470 AbstractCegarLoop]: Abstraction has 129999 states and 401510 transitions. [2022-01-28 12:25:46,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 129999 states and 401510 transitions. [2022-01-28 12:25:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:25:46,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:25:46,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:25:46,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-28 12:25:46,992 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:25:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:25:46,992 INFO L85 PathProgramCache]: Analyzing trace with hash -635656309, now seen corresponding path program 6 times [2022-01-28 12:25:46,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:25:46,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902080467] [2022-01-28 12:25:46,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:25:46,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:25:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:25:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:25:47,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:25:47,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902080467] [2022-01-28 12:25:47,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902080467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:25:47,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:25:47,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-28 12:25:47,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747344810] [2022-01-28 12:25:47,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:25:47,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-28 12:25:47,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:25:47,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-28 12:25:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2022-01-28 12:25:47,761 INFO L87 Difference]: Start difference. First operand 129999 states and 401510 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:25:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:25:57,611 INFO L93 Difference]: Finished difference Result 180581 states and 556545 transitions. [2022-01-28 12:25:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-28 12:25:57,612 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:25:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:25:58,130 INFO L225 Difference]: With dead ends: 180581 [2022-01-28 12:25:58,131 INFO L226 Difference]: Without dead ends: 180581 [2022-01-28 12:25:58,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1938, Invalid=4542, Unknown=0, NotChecked=0, Total=6480 [2022-01-28 12:25:58,132 INFO L933 BasicCegarLoop]: 1351 mSDtfsCounter, 2698 mSDsluCounter, 11287 mSDsCounter, 0 mSdLazyCounter, 4317 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2698 SdHoareTripleChecker+Valid, 12638 SdHoareTripleChecker+Invalid, 4401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 4317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-28 12:25:58,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2698 Valid, 12638 Invalid, 4401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 4317 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-28 12:25:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180581 states. [2022-01-28 12:26:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180581 to 122838. [2022-01-28 12:26:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122838 states, 122834 states have (on average 3.0855626292394613) internal successors, (379012), 122837 states have internal predecessors, (379012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122838 states to 122838 states and 379012 transitions. [2022-01-28 12:26:02,854 INFO L78 Accepts]: Start accepts. Automaton has 122838 states and 379012 transitions. Word has length 105 [2022-01-28 12:26:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:26:02,854 INFO L470 AbstractCegarLoop]: Abstraction has 122838 states and 379012 transitions. [2022-01-28 12:26:02,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 122838 states and 379012 transitions. [2022-01-28 12:26:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:26:02,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:26:02,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:26:02,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-28 12:26:02,973 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:26:02,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:26:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash -694658595, now seen corresponding path program 7 times [2022-01-28 12:26:02,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:26:02,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818375130] [2022-01-28 12:26:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:26:02,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:26:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:26:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:26:04,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:26:04,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818375130] [2022-01-28 12:26:04,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818375130] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:26:04,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:26:04,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-28 12:26:04,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825651208] [2022-01-28 12:26:04,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:26:04,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-28 12:26:04,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:26:04,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-28 12:26:04,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-01-28 12:26:04,295 INFO L87 Difference]: Start difference. First operand 122838 states and 379012 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:16,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:26:16,785 INFO L93 Difference]: Finished difference Result 170321 states and 525138 transitions. [2022-01-28 12:26:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-28 12:26:16,787 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:26:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:26:17,548 INFO L225 Difference]: With dead ends: 170321 [2022-01-28 12:26:17,548 INFO L226 Difference]: Without dead ends: 170321 [2022-01-28 12:26:17,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1467 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2747, Invalid=6565, Unknown=0, NotChecked=0, Total=9312 [2022-01-28 12:26:17,550 INFO L933 BasicCegarLoop]: 1558 mSDtfsCounter, 3156 mSDsluCounter, 12271 mSDsCounter, 0 mSdLazyCounter, 4844 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3156 SdHoareTripleChecker+Valid, 13829 SdHoareTripleChecker+Invalid, 4943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 4844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-28 12:26:17,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3156 Valid, 13829 Invalid, 4943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 4844 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-28 12:26:17,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170321 states. [2022-01-28 12:26:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170321 to 121461. [2022-01-28 12:26:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121461 states, 121457 states have (on average 3.08510830993685) internal successors, (374708), 121460 states have internal predecessors, (374708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121461 states to 121461 states and 374708 transitions. [2022-01-28 12:26:21,219 INFO L78 Accepts]: Start accepts. Automaton has 121461 states and 374708 transitions. Word has length 105 [2022-01-28 12:26:21,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:26:21,220 INFO L470 AbstractCegarLoop]: Abstraction has 121461 states and 374708 transitions. [2022-01-28 12:26:21,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 121461 states and 374708 transitions. [2022-01-28 12:26:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:26:21,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:26:21,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:26:21,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-28 12:26:21,339 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:26:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:26:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1346089269, now seen corresponding path program 8 times [2022-01-28 12:26:21,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:26:21,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829980693] [2022-01-28 12:26:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:26:21,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:26:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:26:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:26:22,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:26:22,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829980693] [2022-01-28 12:26:22,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829980693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:26:22,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:26:22,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:26:22,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355057088] [2022-01-28 12:26:22,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:26:22,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:26:22,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:26:22,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:26:22,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:26:22,084 INFO L87 Difference]: Start difference. First operand 121461 states and 374708 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:26:29,869 INFO L93 Difference]: Finished difference Result 192382 states and 594542 transitions. [2022-01-28 12:26:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-28 12:26:29,869 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:26:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:26:30,445 INFO L225 Difference]: With dead ends: 192382 [2022-01-28 12:26:30,446 INFO L226 Difference]: Without dead ends: 192382 [2022-01-28 12:26:30,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-28 12:26:30,447 INFO L933 BasicCegarLoop]: 808 mSDtfsCounter, 3086 mSDsluCounter, 8746 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3086 SdHoareTripleChecker+Valid, 9554 SdHoareTripleChecker+Invalid, 3800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-28 12:26:30,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3086 Valid, 9554 Invalid, 3800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-28 12:26:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192382 states. [2022-01-28 12:26:33,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192382 to 132001. [2022-01-28 12:26:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132001 states, 131997 states have (on average 3.089789919467867) internal successors, (407843), 132000 states have internal predecessors, (407843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132001 states to 132001 states and 407843 transitions. [2022-01-28 12:26:34,622 INFO L78 Accepts]: Start accepts. Automaton has 132001 states and 407843 transitions. Word has length 105 [2022-01-28 12:26:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:26:34,623 INFO L470 AbstractCegarLoop]: Abstraction has 132001 states and 407843 transitions. [2022-01-28 12:26:34,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 132001 states and 407843 transitions. [2022-01-28 12:26:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:26:34,755 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:26:34,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:26:34,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-28 12:26:34,755 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:26:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:26:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash 496431157, now seen corresponding path program 9 times [2022-01-28 12:26:34,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:26:34,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774354246] [2022-01-28 12:26:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:26:34,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:26:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:26:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:26:35,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:26:35,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774354246] [2022-01-28 12:26:35,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774354246] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:26:35,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:26:35,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:26:35,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221787175] [2022-01-28 12:26:35,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:26:35,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:26:35,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:26:35,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:26:35,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:26:35,868 INFO L87 Difference]: Start difference. First operand 132001 states and 407843 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:26:43,421 INFO L93 Difference]: Finished difference Result 192506 states and 594422 transitions. [2022-01-28 12:26:43,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-28 12:26:43,421 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:26:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:26:44,293 INFO L225 Difference]: With dead ends: 192506 [2022-01-28 12:26:44,293 INFO L226 Difference]: Without dead ends: 192506 [2022-01-28 12:26:44,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-28 12:26:44,294 INFO L933 BasicCegarLoop]: 941 mSDtfsCounter, 2956 mSDsluCounter, 10519 mSDsCounter, 0 mSdLazyCounter, 4472 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2956 SdHoareTripleChecker+Valid, 11460 SdHoareTripleChecker+Invalid, 4552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-28 12:26:44,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2956 Valid, 11460 Invalid, 4552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4472 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-28 12:26:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192506 states. [2022-01-28 12:26:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192506 to 133117. [2022-01-28 12:26:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133117 states, 133113 states have (on average 3.0893075807772346) internal successors, (411227), 133116 states have internal predecessors, (411227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133117 states to 133117 states and 411227 transitions. [2022-01-28 12:26:48,705 INFO L78 Accepts]: Start accepts. Automaton has 133117 states and 411227 transitions. Word has length 105 [2022-01-28 12:26:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:26:48,705 INFO L470 AbstractCegarLoop]: Abstraction has 133117 states and 411227 transitions. [2022-01-28 12:26:48,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 133117 states and 411227 transitions. [2022-01-28 12:26:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:26:48,857 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:26:48,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:26:48,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-28 12:26:48,858 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:26:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:26:48,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1624408711, now seen corresponding path program 10 times [2022-01-28 12:26:48,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:26:48,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168582560] [2022-01-28 12:26:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:26:48,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:26:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:26:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:26:49,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:26:49,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168582560] [2022-01-28 12:26:49,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168582560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:26:49,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:26:49,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:26:49,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885498398] [2022-01-28 12:26:49,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:26:49,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:26:49,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:26:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:26:49,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:26:49,659 INFO L87 Difference]: Start difference. First operand 133117 states and 411227 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:26:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:26:59,316 INFO L93 Difference]: Finished difference Result 184849 states and 570491 transitions. [2022-01-28 12:26:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-28 12:26:59,317 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:26:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:27:00,126 INFO L225 Difference]: With dead ends: 184849 [2022-01-28 12:27:00,127 INFO L226 Difference]: Without dead ends: 184849 [2022-01-28 12:27:00,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1477, Invalid=3635, Unknown=0, NotChecked=0, Total=5112 [2022-01-28 12:27:00,127 INFO L933 BasicCegarLoop]: 1119 mSDtfsCounter, 2744 mSDsluCounter, 10726 mSDsCounter, 0 mSdLazyCounter, 4601 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2744 SdHoareTripleChecker+Valid, 11845 SdHoareTripleChecker+Invalid, 4692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 4601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-28 12:27:00,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2744 Valid, 11845 Invalid, 4692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 4601 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-28 12:27:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184849 states. [2022-01-28 12:27:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184849 to 133551. [2022-01-28 12:27:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133551 states, 133547 states have (on average 3.0891221817038197) internal successors, (412543), 133550 states have internal predecessors, (412543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133551 states to 133551 states and 412543 transitions. [2022-01-28 12:27:04,027 INFO L78 Accepts]: Start accepts. Automaton has 133551 states and 412543 transitions. Word has length 105 [2022-01-28 12:27:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:27:04,027 INFO L470 AbstractCegarLoop]: Abstraction has 133551 states and 412543 transitions. [2022-01-28 12:27:04,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 133551 states and 412543 transitions. [2022-01-28 12:27:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:27:04,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:27:04,688 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:27:04,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-28 12:27:04,689 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:27:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:27:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1683410997, now seen corresponding path program 11 times [2022-01-28 12:27:04,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:27:04,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959460417] [2022-01-28 12:27:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:27:04,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:27:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:27:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:27:05,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:27:05,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959460417] [2022-01-28 12:27:05,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959460417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:27:05,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:27:05,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:27:05,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292950677] [2022-01-28 12:27:05,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:27:05,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:27:05,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:27:05,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:27:05,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:27:05,459 INFO L87 Difference]: Start difference. First operand 133551 states and 412543 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:27:19,164 INFO L93 Difference]: Finished difference Result 171019 states and 527722 transitions. [2022-01-28 12:27:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-28 12:27:19,165 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:27:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:27:19,633 INFO L225 Difference]: With dead ends: 171019 [2022-01-28 12:27:19,633 INFO L226 Difference]: Without dead ends: 171019 [2022-01-28 12:27:19,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2935, Invalid=7165, Unknown=0, NotChecked=0, Total=10100 [2022-01-28 12:27:19,635 INFO L933 BasicCegarLoop]: 1648 mSDtfsCounter, 2897 mSDsluCounter, 14930 mSDsCounter, 0 mSdLazyCounter, 6046 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 16578 SdHoareTripleChecker+Invalid, 6140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 6046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-28 12:27:19,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2897 Valid, 16578 Invalid, 6140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 6046 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-28 12:27:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171019 states. [2022-01-28 12:27:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171019 to 124716. [2022-01-28 12:27:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124716 states, 124712 states have (on average 3.0866155622554365) internal successors, (384938), 124715 states have internal predecessors, (384938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124716 states to 124716 states and 384938 transitions. [2022-01-28 12:27:23,672 INFO L78 Accepts]: Start accepts. Automaton has 124716 states and 384938 transitions. Word has length 105 [2022-01-28 12:27:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:27:23,672 INFO L470 AbstractCegarLoop]: Abstraction has 124716 states and 384938 transitions. [2022-01-28 12:27:23,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 124716 states and 384938 transitions. [2022-01-28 12:27:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:27:23,824 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:27:23,824 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:27:23,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-28 12:27:23,824 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:27:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:27:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1090206221, now seen corresponding path program 12 times [2022-01-28 12:27:23,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:27:23,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302230569] [2022-01-28 12:27:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:27:23,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:27:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:27:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:27:24,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:27:24,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302230569] [2022-01-28 12:27:24,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302230569] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:27:24,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:27:24,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:27:24,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341801752] [2022-01-28 12:27:24,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:27:24,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:27:24,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:27:24,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:27:24,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:27:24,543 INFO L87 Difference]: Start difference. First operand 124716 states and 384938 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:27:32,556 INFO L93 Difference]: Finished difference Result 178618 states and 552146 transitions. [2022-01-28 12:27:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-28 12:27:32,556 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:27:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:27:33,068 INFO L225 Difference]: With dead ends: 178618 [2022-01-28 12:27:33,069 INFO L226 Difference]: Without dead ends: 178618 [2022-01-28 12:27:33,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-28 12:27:33,070 INFO L933 BasicCegarLoop]: 811 mSDtfsCounter, 3140 mSDsluCounter, 10354 mSDsCounter, 0 mSdLazyCounter, 4470 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3140 SdHoareTripleChecker+Valid, 11165 SdHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-28 12:27:33,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3140 Valid, 11165 Invalid, 4550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4470 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-28 12:27:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178618 states. [2022-01-28 12:27:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178618 to 132652. [2022-01-28 12:27:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132652 states, 132648 states have (on average 3.094347445871781) internal successors, (410459), 132651 states have internal predecessors, (410459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132652 states to 132652 states and 410459 transitions. [2022-01-28 12:27:37,420 INFO L78 Accepts]: Start accepts. Automaton has 132652 states and 410459 transitions. Word has length 105 [2022-01-28 12:27:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:27:37,421 INFO L470 AbstractCegarLoop]: Abstraction has 132652 states and 410459 transitions. [2022-01-28 12:27:37,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 132652 states and 410459 transitions. [2022-01-28 12:27:37,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:27:37,556 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:27:37,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:27:37,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-28 12:27:37,556 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:27:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:27:37,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1362240649, now seen corresponding path program 13 times [2022-01-28 12:27:37,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:27:37,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612673263] [2022-01-28 12:27:37,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:27:37,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:27:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:27:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:27:38,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:27:38,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612673263] [2022-01-28 12:27:38,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612673263] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:27:38,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:27:38,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:27:38,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852579186] [2022-01-28 12:27:38,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:27:38,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:27:38,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:27:38,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:27:38,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:27:38,211 INFO L87 Difference]: Start difference. First operand 132652 states and 410459 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:27:46,160 INFO L93 Difference]: Finished difference Result 171798 states and 530350 transitions. [2022-01-28 12:27:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-28 12:27:46,161 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:27:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:27:46,650 INFO L225 Difference]: With dead ends: 171798 [2022-01-28 12:27:46,650 INFO L226 Difference]: Without dead ends: 171798 [2022-01-28 12:27:46,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-28 12:27:46,651 INFO L933 BasicCegarLoop]: 944 mSDtfsCounter, 3048 mSDsluCounter, 10302 mSDsCounter, 0 mSdLazyCounter, 4454 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 11246 SdHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 4454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-28 12:27:46,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3048 Valid, 11246 Invalid, 4532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 4454 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-28 12:27:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171798 states. [2022-01-28 12:27:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171798 to 132373. [2022-01-28 12:27:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132373 states, 132369 states have (on average 3.0897944382748226) internal successors, (408993), 132372 states have internal predecessors, (408993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132373 states to 132373 states and 408993 transitions. [2022-01-28 12:27:50,519 INFO L78 Accepts]: Start accepts. Automaton has 132373 states and 408993 transitions. Word has length 105 [2022-01-28 12:27:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:27:50,519 INFO L470 AbstractCegarLoop]: Abstraction has 132373 states and 408993 transitions. [2022-01-28 12:27:50,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 132373 states and 408993 transitions. [2022-01-28 12:27:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:27:51,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:27:51,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:27:51,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-28 12:27:51,304 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:27:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:27:51,304 INFO L85 PathProgramCache]: Analyzing trace with hash 811886779, now seen corresponding path program 14 times [2022-01-28 12:27:51,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:27:51,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591209613] [2022-01-28 12:27:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:27:51,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:27:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:27:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:27:52,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:27:52,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591209613] [2022-01-28 12:27:52,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591209613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:27:52,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:27:52,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-28 12:27:52,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426840452] [2022-01-28 12:27:52,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:27:52,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-28 12:27:52,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:27:52,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-28 12:27:52,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-28 12:27:52,246 INFO L87 Difference]: Start difference. First operand 132373 states and 408993 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:27:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:27:58,153 INFO L93 Difference]: Finished difference Result 166050 states and 511771 transitions. [2022-01-28 12:27:58,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-28 12:27:58,153 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:27:58,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:27:58,648 INFO L225 Difference]: With dead ends: 166050 [2022-01-28 12:27:58,648 INFO L226 Difference]: Without dead ends: 166050 [2022-01-28 12:27:58,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=891, Invalid=2301, Unknown=0, NotChecked=0, Total=3192 [2022-01-28 12:27:58,649 INFO L933 BasicCegarLoop]: 832 mSDtfsCounter, 2865 mSDsluCounter, 7540 mSDsCounter, 0 mSdLazyCounter, 3184 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2865 SdHoareTripleChecker+Valid, 8372 SdHoareTripleChecker+Invalid, 3276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 3184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-28 12:27:58,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2865 Valid, 8372 Invalid, 3276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 3184 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-28 12:27:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166050 states. [2022-01-28 12:28:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166050 to 136382. [2022-01-28 12:28:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136382 states, 136378 states have (on average 3.0895452345686256) internal successors, (421346), 136381 states have internal predecessors, (421346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:28:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136382 states to 136382 states and 421346 transitions. [2022-01-28 12:28:02,492 INFO L78 Accepts]: Start accepts. Automaton has 136382 states and 421346 transitions. Word has length 105 [2022-01-28 12:28:02,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:28:02,492 INFO L470 AbstractCegarLoop]: Abstraction has 136382 states and 421346 transitions. [2022-01-28 12:28:02,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:28:02,492 INFO L276 IsEmpty]: Start isEmpty. Operand 136382 states and 421346 transitions. [2022-01-28 12:28:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:28:03,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:28:03,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:28:03,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-28 12:28:03,090 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:28:03,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:28:03,091 INFO L85 PathProgramCache]: Analyzing trace with hash 752884493, now seen corresponding path program 15 times [2022-01-28 12:28:03,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:28:03,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043745506] [2022-01-28 12:28:03,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:28:03,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:28:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:28:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:28:03,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:28:03,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043745506] [2022-01-28 12:28:03,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043745506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:28:03,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:28:03,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:28:03,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592196625] [2022-01-28 12:28:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:28:03,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:28:03,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:28:03,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:28:03,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:28:03,932 INFO L87 Difference]: Start difference. First operand 136382 states and 421346 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:28:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:28:17,908 INFO L93 Difference]: Finished difference Result 167878 states and 517496 transitions. [2022-01-28 12:28:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-28 12:28:17,909 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:28:17,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:28:18,348 INFO L225 Difference]: With dead ends: 167878 [2022-01-28 12:28:18,348 INFO L226 Difference]: Without dead ends: 167878 [2022-01-28 12:28:18,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2980, Invalid=7322, Unknown=0, NotChecked=0, Total=10302 [2022-01-28 12:28:18,350 INFO L933 BasicCegarLoop]: 1671 mSDtfsCounter, 2883 mSDsluCounter, 14926 mSDsCounter, 0 mSdLazyCounter, 6248 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2883 SdHoareTripleChecker+Valid, 16597 SdHoareTripleChecker+Invalid, 6338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 6248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-28 12:28:18,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2883 Valid, 16597 Invalid, 6338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 6248 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-28 12:28:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167878 states. [2022-01-28 12:28:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167878 to 135855. [2022-01-28 12:28:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135855 states, 135851 states have (on average 3.089311083466445) internal successors, (419686), 135854 states have internal predecessors, (419686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:28:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135855 states to 135855 states and 419686 transitions. [2022-01-28 12:28:22,474 INFO L78 Accepts]: Start accepts. Automaton has 135855 states and 419686 transitions. Word has length 105 [2022-01-28 12:28:22,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:28:22,474 INFO L470 AbstractCegarLoop]: Abstraction has 135855 states and 419686 transitions. [2022-01-28 12:28:22,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:28:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 135855 states and 419686 transitions. [2022-01-28 12:28:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:28:22,603 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:28:22,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:28:22,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-28 12:28:22,603 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:28:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:28:22,603 INFO L85 PathProgramCache]: Analyzing trace with hash -379588419, now seen corresponding path program 16 times [2022-01-28 12:28:22,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:28:22,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462169595] [2022-01-28 12:28:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:28:22,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:28:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:28:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:28:23,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:28:23,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462169595] [2022-01-28 12:28:23,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462169595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:28:23,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:28:23,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-28 12:28:23,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817562993] [2022-01-28 12:28:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:28:23,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-28 12:28:23,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:28:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-28 12:28:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-01-28 12:28:23,256 INFO L87 Difference]: Start difference. First operand 135855 states and 419686 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:28:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:28:37,323 INFO L93 Difference]: Finished difference Result 166917 states and 514055 transitions. [2022-01-28 12:28:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-28 12:28:37,324 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:28:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:28:38,047 INFO L225 Difference]: With dead ends: 166917 [2022-01-28 12:28:38,048 INFO L226 Difference]: Without dead ends: 166917 [2022-01-28 12:28:38,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3084, Invalid=7422, Unknown=0, NotChecked=0, Total=10506 [2022-01-28 12:28:38,050 INFO L933 BasicCegarLoop]: 1732 mSDtfsCounter, 2877 mSDsluCounter, 13345 mSDsCounter, 0 mSdLazyCounter, 5523 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2877 SdHoareTripleChecker+Valid, 15077 SdHoareTripleChecker+Invalid, 5612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 5523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-28 12:28:38,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2877 Valid, 15077 Invalid, 5612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 5523 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-28 12:28:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166917 states. [2022-01-28 12:28:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166917 to 136506. [2022-01-28 12:28:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136506 states, 136502 states have (on average 3.088357679740956) internal successors, (421567), 136505 states have internal predecessors, (421567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:28:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136506 states to 136506 states and 421567 transitions. [2022-01-28 12:28:41,825 INFO L78 Accepts]: Start accepts. Automaton has 136506 states and 421567 transitions. Word has length 105 [2022-01-28 12:28:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:28:41,825 INFO L470 AbstractCegarLoop]: Abstraction has 136506 states and 421567 transitions. [2022-01-28 12:28:41,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:28:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 136506 states and 421567 transitions. [2022-01-28 12:28:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:28:41,967 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:28:41,967 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:28:41,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-28 12:28:41,967 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:28:41,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:28:41,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1308959803, now seen corresponding path program 17 times [2022-01-28 12:28:41,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:28:41,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919120293] [2022-01-28 12:28:41,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:28:41,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:28:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:28:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:28:43,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:28:43,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919120293] [2022-01-28 12:28:43,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919120293] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:28:43,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:28:43,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:28:43,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579369169] [2022-01-28 12:28:43,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:28:43,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:28:43,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:28:43,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:28:43,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:28:43,114 INFO L87 Difference]: Start difference. First operand 136506 states and 421567 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:28:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:28:50,901 INFO L93 Difference]: Finished difference Result 183543 states and 565349 transitions. [2022-01-28 12:28:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-28 12:28:50,901 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:28:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:28:51,722 INFO L225 Difference]: With dead ends: 183543 [2022-01-28 12:28:51,722 INFO L226 Difference]: Without dead ends: 183543 [2022-01-28 12:28:51,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-01-28 12:28:51,723 INFO L933 BasicCegarLoop]: 1050 mSDtfsCounter, 2990 mSDsluCounter, 10562 mSDsCounter, 0 mSdLazyCounter, 4232 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2990 SdHoareTripleChecker+Valid, 11612 SdHoareTripleChecker+Invalid, 4295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-28 12:28:51,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2990 Valid, 11612 Invalid, 4295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4232 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-28 12:28:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183543 states. [2022-01-28 12:28:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183543 to 137994. [2022-01-28 12:28:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137994 states, 137990 states have (on average 3.088151315312704) internal successors, (426134), 137993 states have internal predecessors, (426134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:28:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137994 states to 137994 states and 426134 transitions. [2022-01-28 12:28:56,249 INFO L78 Accepts]: Start accepts. Automaton has 137994 states and 426134 transitions. Word has length 105 [2022-01-28 12:28:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:28:56,249 INFO L470 AbstractCegarLoop]: Abstraction has 137994 states and 426134 transitions. [2022-01-28 12:28:56,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:28:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 137994 states and 426134 transitions. [2022-01-28 12:28:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:28:56,453 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:28:56,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:28:56,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-28 12:28:56,453 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:28:56,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:28:56,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1677400173, now seen corresponding path program 18 times [2022-01-28 12:28:56,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:28:56,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864768643] [2022-01-28 12:28:56,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:28:56,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:28:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:28:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:28:57,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:28:57,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864768643] [2022-01-28 12:28:57,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864768643] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:28:57,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:28:57,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:28:57,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331496959] [2022-01-28 12:28:57,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:28:57,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:28:57,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:28:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:28:57,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:28:57,366 INFO L87 Difference]: Start difference. First operand 137994 states and 426134 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:29:08,784 INFO L93 Difference]: Finished difference Result 190845 states and 587894 transitions. [2022-01-28 12:29:08,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-28 12:29:08,785 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:29:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:29:09,630 INFO L225 Difference]: With dead ends: 190845 [2022-01-28 12:29:09,630 INFO L226 Difference]: Without dead ends: 190845 [2022-01-28 12:29:09,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-01-28 12:29:09,631 INFO L933 BasicCegarLoop]: 1335 mSDtfsCounter, 2886 mSDsluCounter, 13872 mSDsCounter, 0 mSdLazyCounter, 5489 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2886 SdHoareTripleChecker+Valid, 15207 SdHoareTripleChecker+Invalid, 5559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 5489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-28 12:29:09,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2886 Valid, 15207 Invalid, 5559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 5489 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-28 12:29:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190845 states. [2022-01-28 12:29:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190845 to 138490. [2022-01-28 12:29:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138490 states, 138486 states have (on average 3.088348280692633) internal successors, (427693), 138489 states have internal predecessors, (427693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138490 states to 138490 states and 427693 transitions. [2022-01-28 12:29:13,510 INFO L78 Accepts]: Start accepts. Automaton has 138490 states and 427693 transitions. Word has length 105 [2022-01-28 12:29:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:29:13,510 INFO L470 AbstractCegarLoop]: Abstraction has 138490 states and 427693 transitions. [2022-01-28 12:29:13,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 138490 states and 427693 transitions. [2022-01-28 12:29:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:29:14,109 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:29:14,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:29:14,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-28 12:29:14,110 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:29:14,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:29:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1399080731, now seen corresponding path program 19 times [2022-01-28 12:29:14,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:29:14,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872550285] [2022-01-28 12:29:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:29:14,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:29:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:29:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:29:14,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:29:14,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872550285] [2022-01-28 12:29:14,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872550285] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:29:14,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:29:14,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-28 12:29:14,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405759144] [2022-01-28 12:29:14,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:29:14,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-28 12:29:14,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:29:14,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-28 12:29:14,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-01-28 12:29:14,862 INFO L87 Difference]: Start difference. First operand 138490 states and 427693 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:29:24,331 INFO L93 Difference]: Finished difference Result 189967 states and 585143 transitions. [2022-01-28 12:29:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-28 12:29:24,331 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:29:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:29:25,160 INFO L225 Difference]: With dead ends: 189967 [2022-01-28 12:29:25,160 INFO L226 Difference]: Without dead ends: 189967 [2022-01-28 12:29:25,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1763, Invalid=4089, Unknown=0, NotChecked=0, Total=5852 [2022-01-28 12:29:25,164 INFO L933 BasicCegarLoop]: 1246 mSDtfsCounter, 2382 mSDsluCounter, 10298 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2382 SdHoareTripleChecker+Valid, 11544 SdHoareTripleChecker+Invalid, 4102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-28 12:29:25,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2382 Valid, 11544 Invalid, 4102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 4030 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-28 12:29:25,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189967 states. [2022-01-28 12:29:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189967 to 146798. [2022-01-28 12:29:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146798 states, 146794 states have (on average 3.08966987751543) internal successors, (453545), 146797 states have internal predecessors, (453545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146798 states to 146798 states and 453545 transitions. [2022-01-28 12:29:29,637 INFO L78 Accepts]: Start accepts. Automaton has 146798 states and 453545 transitions. Word has length 105 [2022-01-28 12:29:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:29:29,637 INFO L470 AbstractCegarLoop]: Abstraction has 146798 states and 453545 transitions. [2022-01-28 12:29:29,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 146798 states and 453545 transitions. [2022-01-28 12:29:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:29:29,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:29:29,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:29:29,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-28 12:29:29,797 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:29:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:29:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1855323451, now seen corresponding path program 20 times [2022-01-28 12:29:29,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:29:29,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040800938] [2022-01-28 12:29:29,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:29:29,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:29:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:29:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:29:30,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:29:30,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040800938] [2022-01-28 12:29:30,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040800938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:29:30,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:29:30,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:29:30,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925440042] [2022-01-28 12:29:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:29:30,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:29:30,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:29:30,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:29:30,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:29:30,435 INFO L87 Difference]: Start difference. First operand 146798 states and 453545 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:29:38,597 INFO L93 Difference]: Finished difference Result 202524 states and 624703 transitions. [2022-01-28 12:29:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-28 12:29:38,598 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:29:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:29:39,279 INFO L225 Difference]: With dead ends: 202524 [2022-01-28 12:29:39,280 INFO L226 Difference]: Without dead ends: 202524 [2022-01-28 12:29:39,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-28 12:29:39,280 INFO L933 BasicCegarLoop]: 816 mSDtfsCounter, 2951 mSDsluCounter, 10390 mSDsCounter, 0 mSdLazyCounter, 4264 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2951 SdHoareTripleChecker+Valid, 11206 SdHoareTripleChecker+Invalid, 4338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-28 12:29:39,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2951 Valid, 11206 Invalid, 4338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 4264 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-28 12:29:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202524 states. [2022-01-28 12:29:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202524 to 153804. [2022-01-28 12:29:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153804 states, 153800 states have (on average 3.0928218465539663) internal successors, (475676), 153803 states have internal predecessors, (475676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153804 states to 153804 states and 475676 transitions. [2022-01-28 12:29:44,404 INFO L78 Accepts]: Start accepts. Automaton has 153804 states and 475676 transitions. Word has length 105 [2022-01-28 12:29:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:29:44,404 INFO L470 AbstractCegarLoop]: Abstraction has 153804 states and 475676 transitions. [2022-01-28 12:29:44,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 153804 states and 475676 transitions. [2022-01-28 12:29:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:29:44,685 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:29:44,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:29:44,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-28 12:29:44,685 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:29:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:29:44,686 INFO L85 PathProgramCache]: Analyzing trace with hash -597123419, now seen corresponding path program 21 times [2022-01-28 12:29:44,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:29:44,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746309311] [2022-01-28 12:29:44,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:29:44,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:29:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:29:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:29:45,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:29:45,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746309311] [2022-01-28 12:29:45,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746309311] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:29:45,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:29:45,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:29:45,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556323913] [2022-01-28 12:29:45,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:29:45,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:29:45,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:29:45,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:29:45,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:29:45,944 INFO L87 Difference]: Start difference. First operand 153804 states and 475676 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:29:54,321 INFO L93 Difference]: Finished difference Result 202741 states and 625144 transitions. [2022-01-28 12:29:54,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-28 12:29:54,322 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:29:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:29:55,321 INFO L225 Difference]: With dead ends: 202741 [2022-01-28 12:29:55,321 INFO L226 Difference]: Without dead ends: 202741 [2022-01-28 12:29:55,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-28 12:29:55,322 INFO L933 BasicCegarLoop]: 958 mSDtfsCounter, 2653 mSDsluCounter, 11513 mSDsCounter, 0 mSdLazyCounter, 4806 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2653 SdHoareTripleChecker+Valid, 12471 SdHoareTripleChecker+Invalid, 4871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-28 12:29:55,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2653 Valid, 12471 Invalid, 4871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4806 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-28 12:29:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202741 states. [2022-01-28 12:29:58,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202741 to 154920. [2022-01-28 12:29:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154920 states, 154916 states have (on average 3.092385550879186) internal successors, (479060), 154919 states have internal predecessors, (479060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154920 states to 154920 states and 479060 transitions. [2022-01-28 12:29:59,850 INFO L78 Accepts]: Start accepts. Automaton has 154920 states and 479060 transitions. Word has length 105 [2022-01-28 12:29:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:29:59,850 INFO L470 AbstractCegarLoop]: Abstraction has 154920 states and 479060 transitions. [2022-01-28 12:29:59,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:29:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 154920 states and 479060 transitions. [2022-01-28 12:30:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:30:00,043 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:30:00,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:30:00,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-28 12:30:00,044 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:30:00,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:30:00,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1577004009, now seen corresponding path program 22 times [2022-01-28 12:30:00,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:30:00,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356080978] [2022-01-28 12:30:00,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:30:00,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:30:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:30:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:30:00,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:30:00,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356080978] [2022-01-28 12:30:00,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356080978] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:30:00,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:30:00,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:30:00,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686360959] [2022-01-28 12:30:00,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:30:00,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:30:00,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:30:00,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:30:00,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:30:00,927 INFO L87 Difference]: Start difference. First operand 154920 states and 479060 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:30:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:30:13,596 INFO L93 Difference]: Finished difference Result 202190 states and 623175 transitions. [2022-01-28 12:30:13,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-28 12:30:13,597 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:30:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:30:14,231 INFO L225 Difference]: With dead ends: 202190 [2022-01-28 12:30:14,231 INFO L226 Difference]: Without dead ends: 202190 [2022-01-28 12:30:14,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-01-28 12:30:14,232 INFO L933 BasicCegarLoop]: 1509 mSDtfsCounter, 2705 mSDsluCounter, 12752 mSDsCounter, 0 mSdLazyCounter, 5009 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2705 SdHoareTripleChecker+Valid, 14261 SdHoareTripleChecker+Invalid, 5094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 5009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-28 12:30:14,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2705 Valid, 14261 Invalid, 5094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 5009 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-28 12:30:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202190 states. [2022-01-28 12:30:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202190 to 147418. [2022-01-28 12:30:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147418 states, 147414 states have (on average 3.09129390695592) internal successors, (455700), 147417 states have internal predecessors, (455700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:30:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147418 states to 147418 states and 455700 transitions. [2022-01-28 12:30:19,079 INFO L78 Accepts]: Start accepts. Automaton has 147418 states and 455700 transitions. Word has length 105 [2022-01-28 12:30:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:30:19,079 INFO L470 AbstractCegarLoop]: Abstraction has 147418 states and 455700 transitions. [2022-01-28 12:30:19,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:30:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 147418 states and 455700 transitions. [2022-01-28 12:30:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:30:19,262 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:30:19,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:30:19,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-28 12:30:19,262 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:30:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:30:19,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1518001723, now seen corresponding path program 23 times [2022-01-28 12:30:19,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:30:19,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285312236] [2022-01-28 12:30:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:30:19,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:30:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:30:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:30:20,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:30:20,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285312236] [2022-01-28 12:30:20,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285312236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:30:20,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:30:20,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-28 12:30:20,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471055997] [2022-01-28 12:30:20,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:30:20,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-28 12:30:20,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:30:20,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-28 12:30:20,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-01-28 12:30:20,041 INFO L87 Difference]: Start difference. First operand 147418 states and 455700 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:30:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:30:31,922 INFO L93 Difference]: Finished difference Result 193520 states and 596104 transitions. [2022-01-28 12:30:31,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-28 12:30:31,922 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:30:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:30:32,785 INFO L225 Difference]: With dead ends: 193520 [2022-01-28 12:30:32,785 INFO L226 Difference]: Without dead ends: 193520 [2022-01-28 12:30:32,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2387, Invalid=5623, Unknown=0, NotChecked=0, Total=8010 [2022-01-28 12:30:32,786 INFO L933 BasicCegarLoop]: 1546 mSDtfsCounter, 2488 mSDsluCounter, 12871 mSDsCounter, 0 mSdLazyCounter, 5308 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2488 SdHoareTripleChecker+Valid, 14417 SdHoareTripleChecker+Invalid, 5381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 5308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-28 12:30:32,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2488 Valid, 14417 Invalid, 5381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 5308 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-01-28 12:30:33,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193520 states. [2022-01-28 12:30:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193520 to 137002. [2022-01-28 12:30:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137002 states, 136998 states have (on average 3.0881545715995853) internal successors, (423071), 137001 states have internal predecessors, (423071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:30:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137002 states to 137002 states and 423071 transitions. [2022-01-28 12:30:38,188 INFO L78 Accepts]: Start accepts. Automaton has 137002 states and 423071 transitions. Word has length 105 [2022-01-28 12:30:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:30:38,189 INFO L470 AbstractCegarLoop]: Abstraction has 137002 states and 423071 transitions. [2022-01-28 12:30:38,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:30:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 137002 states and 423071 transitions. [2022-01-28 12:30:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:30:38,357 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:30:38,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:30:38,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-28 12:30:38,358 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:30:38,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:30:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash 866571049, now seen corresponding path program 24 times [2022-01-28 12:30:38,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:30:38,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979342243] [2022-01-28 12:30:38,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:30:38,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:30:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:30:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:30:38,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:30:38,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979342243] [2022-01-28 12:30:38,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979342243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:30:38,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:30:38,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:30:38,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959503851] [2022-01-28 12:30:38,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:30:38,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:30:38,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:30:38,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:30:38,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:30:38,991 INFO L87 Difference]: Start difference. First operand 137002 states and 423071 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:30:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:30:47,121 INFO L93 Difference]: Finished difference Result 235009 states and 726119 transitions. [2022-01-28 12:30:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-28 12:30:47,121 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:30:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:30:47,905 INFO L225 Difference]: With dead ends: 235009 [2022-01-28 12:30:47,906 INFO L226 Difference]: Without dead ends: 235009 [2022-01-28 12:30:47,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-28 12:30:47,906 INFO L933 BasicCegarLoop]: 820 mSDtfsCounter, 3426 mSDsluCounter, 9525 mSDsCounter, 0 mSdLazyCounter, 4248 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3426 SdHoareTripleChecker+Valid, 10345 SdHoareTripleChecker+Invalid, 4333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:30:47,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3426 Valid, 10345 Invalid, 4333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 4248 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-28 12:30:48,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235009 states. [2022-01-28 12:30:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235009 to 147542. [2022-01-28 12:30:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147542 states, 147538 states have (on average 3.0921254185362415) internal successors, (456206), 147541 states have internal predecessors, (456206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:30:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147542 states to 147542 states and 456206 transitions. [2022-01-28 12:30:52,907 INFO L78 Accepts]: Start accepts. Automaton has 147542 states and 456206 transitions. Word has length 105 [2022-01-28 12:30:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:30:52,907 INFO L470 AbstractCegarLoop]: Abstraction has 147542 states and 456206 transitions. [2022-01-28 12:30:52,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:30:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 147542 states and 456206 transitions. [2022-01-28 12:30:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:30:53,056 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:30:53,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:30:53,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-28 12:30:53,057 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:30:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:30:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1585875821, now seen corresponding path program 25 times [2022-01-28 12:30:53,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:30:53,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913539476] [2022-01-28 12:30:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:30:53,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:30:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:30:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:30:53,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:30:53,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913539476] [2022-01-28 12:30:53,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913539476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:30:53,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:30:53,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:30:53,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155511321] [2022-01-28 12:30:53,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:30:53,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:30:53,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:30:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:30:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:30:53,730 INFO L87 Difference]: Start difference. First operand 147542 states and 456206 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:31:02,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:31:02,033 INFO L93 Difference]: Finished difference Result 235133 states and 725999 transitions. [2022-01-28 12:31:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-28 12:31:02,034 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:31:02,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:31:03,172 INFO L225 Difference]: With dead ends: 235133 [2022-01-28 12:31:03,172 INFO L226 Difference]: Without dead ends: 235133 [2022-01-28 12:31:03,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-28 12:31:03,173 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 2967 mSDsluCounter, 10569 mSDsCounter, 0 mSdLazyCounter, 4653 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2967 SdHoareTripleChecker+Valid, 11522 SdHoareTripleChecker+Invalid, 4725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 4653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-28 12:31:03,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2967 Valid, 11522 Invalid, 4725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 4653 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-28 12:31:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235133 states. [2022-01-28 12:31:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235133 to 148658. [2022-01-28 12:31:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148658 states, 148654 states have (on average 3.0916759723922667) internal successors, (459590), 148657 states have internal predecessors, (459590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:31:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148658 states to 148658 states and 459590 transitions. [2022-01-28 12:31:08,060 INFO L78 Accepts]: Start accepts. Automaton has 148658 states and 459590 transitions. Word has length 105 [2022-01-28 12:31:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:31:08,060 INFO L470 AbstractCegarLoop]: Abstraction has 148658 states and 459590 transitions. [2022-01-28 12:31:08,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:31:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 148658 states and 459590 transitions. [2022-01-28 12:31:08,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:31:08,223 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:31:08,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:31:08,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-28 12:31:08,224 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:31:08,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:31:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash 588251607, now seen corresponding path program 26 times [2022-01-28 12:31:08,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:31:08,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734654641] [2022-01-28 12:31:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:31:08,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:31:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:31:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:31:09,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:31:09,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734654641] [2022-01-28 12:31:09,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734654641] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:31:09,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:31:09,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:31:09,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315207196] [2022-01-28 12:31:09,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:31:09,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:31:09,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:31:09,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:31:09,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:31:09,451 INFO L87 Difference]: Start difference. First operand 148658 states and 459590 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:31:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:31:18,733 INFO L93 Difference]: Finished difference Result 228207 states and 704344 transitions. [2022-01-28 12:31:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-28 12:31:18,734 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:31:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:31:19,463 INFO L225 Difference]: With dead ends: 228207 [2022-01-28 12:31:19,463 INFO L226 Difference]: Without dead ends: 228207 [2022-01-28 12:31:19,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1480, Invalid=3632, Unknown=0, NotChecked=0, Total=5112 [2022-01-28 12:31:19,464 INFO L933 BasicCegarLoop]: 1123 mSDtfsCounter, 2795 mSDsluCounter, 11520 mSDsCounter, 0 mSdLazyCounter, 5060 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2795 SdHoareTripleChecker+Valid, 12643 SdHoareTripleChecker+Invalid, 5150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 5060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-28 12:31:19,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2795 Valid, 12643 Invalid, 5150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 5060 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-28 12:31:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228207 states. [2022-01-28 12:31:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228207 to 149681. [2022-01-28 12:31:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149681 states, 149677 states have (on average 3.091684093080433) internal successors, (462754), 149680 states have internal predecessors, (462754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:31:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149681 states to 149681 states and 462754 transitions. [2022-01-28 12:31:25,707 INFO L78 Accepts]: Start accepts. Automaton has 149681 states and 462754 transitions. Word has length 105 [2022-01-28 12:31:25,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:31:25,708 INFO L470 AbstractCegarLoop]: Abstraction has 149681 states and 462754 transitions. [2022-01-28 12:31:25,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:31:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 149681 states and 462754 transitions. [2022-01-28 12:31:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:31:25,863 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:31:25,863 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:31:25,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-28 12:31:25,864 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:31:25,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:31:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash 529249321, now seen corresponding path program 27 times [2022-01-28 12:31:25,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:31:25,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107030841] [2022-01-28 12:31:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:31:25,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:31:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:31:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:31:26,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:31:26,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107030841] [2022-01-28 12:31:26,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107030841] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:31:26,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:31:26,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:31:26,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625565257] [2022-01-28 12:31:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:31:26,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:31:26,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:31:26,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:31:26,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:31:26,709 INFO L87 Difference]: Start difference. First operand 149681 states and 462754 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:31:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:31:40,257 INFO L93 Difference]: Finished difference Result 225094 states and 694382 transitions. [2022-01-28 12:31:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-28 12:31:40,257 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:31:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:31:41,335 INFO L225 Difference]: With dead ends: 225094 [2022-01-28 12:31:41,335 INFO L226 Difference]: Without dead ends: 225094 [2022-01-28 12:31:41,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2575, Invalid=6167, Unknown=0, NotChecked=0, Total=8742 [2022-01-28 12:31:41,336 INFO L933 BasicCegarLoop]: 1628 mSDtfsCounter, 2944 mSDsluCounter, 14929 mSDsCounter, 0 mSdLazyCounter, 6172 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2944 SdHoareTripleChecker+Valid, 16557 SdHoareTripleChecker+Invalid, 6261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 6172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-28 12:31:41,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2944 Valid, 16557 Invalid, 6261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 6172 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-28 12:31:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225094 states. [2022-01-28 12:31:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225094 to 149185. [2022-01-28 12:31:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149185 states, 149181 states have (on average 3.0919487066047284) internal successors, (461260), 149184 states have internal predecessors, (461260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:31:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149185 states to 149185 states and 461260 transitions. [2022-01-28 12:31:46,095 INFO L78 Accepts]: Start accepts. Automaton has 149185 states and 461260 transitions. Word has length 105 [2022-01-28 12:31:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:31:46,095 INFO L470 AbstractCegarLoop]: Abstraction has 149185 states and 461260 transitions. [2022-01-28 12:31:46,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:31:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 149185 states and 461260 transitions. [2022-01-28 12:31:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:31:46,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:31:46,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:31:46,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-28 12:31:46,256 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:31:46,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:31:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash -992100757, now seen corresponding path program 28 times [2022-01-28 12:31:46,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:31:46,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429552729] [2022-01-28 12:31:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:31:46,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:31:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:31:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:31:47,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:31:47,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429552729] [2022-01-28 12:31:47,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429552729] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:31:47,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:31:47,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:31:47,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690935982] [2022-01-28 12:31:47,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:31:47,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:31:47,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:31:47,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:31:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:31:47,412 INFO L87 Difference]: Start difference. First operand 149185 states and 461260 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:31:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:31:55,802 INFO L93 Difference]: Finished difference Result 260749 states and 808189 transitions. [2022-01-28 12:31:55,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-28 12:31:55,802 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:31:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:31:56,686 INFO L225 Difference]: With dead ends: 260749 [2022-01-28 12:31:56,687 INFO L226 Difference]: Without dead ends: 260749 [2022-01-28 12:31:56,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1275, Invalid=3837, Unknown=0, NotChecked=0, Total=5112 [2022-01-28 12:31:56,687 INFO L933 BasicCegarLoop]: 823 mSDtfsCounter, 3298 mSDsluCounter, 8863 mSDsCounter, 0 mSdLazyCounter, 3865 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3298 SdHoareTripleChecker+Valid, 9686 SdHoareTripleChecker+Invalid, 3945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-28 12:31:56,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3298 Valid, 9686 Invalid, 3945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3865 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-28 12:31:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260749 states. [2022-01-28 12:32:01,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260749 to 162143. [2022-01-28 12:32:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162143 states, 162139 states have (on average 3.102282609366038) internal successors, (503001), 162142 states have internal predecessors, (503001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:32:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162143 states to 162143 states and 503001 transitions. [2022-01-28 12:32:02,098 INFO L78 Accepts]: Start accepts. Automaton has 162143 states and 503001 transitions. Word has length 105 [2022-01-28 12:32:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:32:02,099 INFO L470 AbstractCegarLoop]: Abstraction has 162143 states and 503001 transitions. [2022-01-28 12:32:02,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:32:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 162143 states and 503001 transitions. [2022-01-28 12:32:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:32:02,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:32:02,767 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:32:02,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-28 12:32:02,767 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:32:02,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:32:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash 850419669, now seen corresponding path program 29 times [2022-01-28 12:32:02,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:32:02,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934339504] [2022-01-28 12:32:02,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:32:02,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:32:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:32:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:32:03,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:32:03,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934339504] [2022-01-28 12:32:03,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934339504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:32:03,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:32:03,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:32:03,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242902318] [2022-01-28 12:32:03,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:32:03,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:32:03,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:32:03,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:32:03,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:32:03,394 INFO L87 Difference]: Start difference. First operand 162143 states and 503001 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:32:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:32:12,339 INFO L93 Difference]: Finished difference Result 247171 states and 764785 transitions. [2022-01-28 12:32:12,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-28 12:32:12,340 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:32:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:32:13,165 INFO L225 Difference]: With dead ends: 247171 [2022-01-28 12:32:13,165 INFO L226 Difference]: Without dead ends: 247171 [2022-01-28 12:32:13,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-28 12:32:13,166 INFO L933 BasicCegarLoop]: 956 mSDtfsCounter, 3063 mSDsluCounter, 10991 mSDsCounter, 0 mSdLazyCounter, 4866 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3063 SdHoareTripleChecker+Valid, 11947 SdHoareTripleChecker+Invalid, 4943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-28 12:32:13,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3063 Valid, 11947 Invalid, 4943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4866 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-28 12:32:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247171 states. [2022-01-28 12:32:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247171 to 152750. [2022-01-28 12:32:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152750 states, 152746 states have (on average 3.093599832401503) internal successors, (472535), 152749 states have internal predecessors, (472535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:32:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152750 states to 152750 states and 472535 transitions. [2022-01-28 12:32:18,456 INFO L78 Accepts]: Start accepts. Automaton has 152750 states and 472535 transitions. Word has length 105 [2022-01-28 12:32:18,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:32:18,456 INFO L470 AbstractCegarLoop]: Abstraction has 152750 states and 472535 transitions. [2022-01-28 12:32:18,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:32:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 152750 states and 472535 transitions. [2022-01-28 12:32:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:32:18,638 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:32:18,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:32:18,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-28 12:32:18,638 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:32:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:32:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1270420199, now seen corresponding path program 30 times [2022-01-28 12:32:18,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:32:18,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634066871] [2022-01-28 12:32:18,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:32:18,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:32:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:32:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:32:19,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:32:19,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634066871] [2022-01-28 12:32:19,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634066871] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:32:19,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:32:19,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:32:19,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671469973] [2022-01-28 12:32:19,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:32:19,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:32:19,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:32:19,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:32:19,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:32:19,356 INFO L87 Difference]: Start difference. First operand 152750 states and 472535 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:32:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:32:28,044 INFO L93 Difference]: Finished difference Result 233890 states and 722930 transitions. [2022-01-28 12:32:28,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-28 12:32:28,045 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:32:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:32:29,147 INFO L225 Difference]: With dead ends: 233890 [2022-01-28 12:32:29,147 INFO L226 Difference]: Without dead ends: 233890 [2022-01-28 12:32:29,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1211, Invalid=3079, Unknown=0, NotChecked=0, Total=4290 [2022-01-28 12:32:29,148 INFO L933 BasicCegarLoop]: 998 mSDtfsCounter, 2726 mSDsluCounter, 11674 mSDsCounter, 0 mSdLazyCounter, 5209 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2726 SdHoareTripleChecker+Valid, 12672 SdHoareTripleChecker+Invalid, 5295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 5209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-28 12:32:29,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2726 Valid, 12672 Invalid, 5295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 5209 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-28 12:32:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233890 states. [2022-01-28 12:32:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233890 to 154486. [2022-01-28 12:32:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154486 states, 154482 states have (on average 3.0939138540412476) internal successors, (477954), 154485 states have internal predecessors, (477954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:32:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154486 states to 154486 states and 477954 transitions. [2022-01-28 12:32:33,982 INFO L78 Accepts]: Start accepts. Automaton has 154486 states and 477954 transitions. Word has length 105 [2022-01-28 12:32:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:32:33,982 INFO L470 AbstractCegarLoop]: Abstraction has 154486 states and 477954 transitions. [2022-01-28 12:32:33,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:32:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 154486 states and 477954 transitions. [2022-01-28 12:32:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:32:34,641 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:32:34,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:32:34,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-28 12:32:34,642 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:32:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:32:34,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1329422485, now seen corresponding path program 31 times [2022-01-28 12:32:34,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:32:34,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379521121] [2022-01-28 12:32:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:32:34,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:32:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:32:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:32:35,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:32:35,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379521121] [2022-01-28 12:32:35,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379521121] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:32:35,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:32:35,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-28 12:32:35,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009920581] [2022-01-28 12:32:35,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:32:35,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-28 12:32:35,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:32:35,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-28 12:32:35,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-01-28 12:32:35,348 INFO L87 Difference]: Start difference. First operand 154486 states and 477954 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:32:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:32:48,384 INFO L93 Difference]: Finished difference Result 222438 states and 686362 transitions. [2022-01-28 12:32:48,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-28 12:32:48,384 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:32:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:32:49,069 INFO L225 Difference]: With dead ends: 222438 [2022-01-28 12:32:49,069 INFO L226 Difference]: Without dead ends: 222438 [2022-01-28 12:32:49,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2594, Invalid=6148, Unknown=0, NotChecked=0, Total=8742 [2022-01-28 12:32:49,070 INFO L933 BasicCegarLoop]: 1667 mSDtfsCounter, 2902 mSDsluCounter, 13396 mSDsCounter, 0 mSdLazyCounter, 5738 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2902 SdHoareTripleChecker+Valid, 15063 SdHoareTripleChecker+Invalid, 5825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 5738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-28 12:32:49,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2902 Valid, 15063 Invalid, 5825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 5738 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-28 12:32:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222438 states. [2022-01-28 12:32:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222438 to 144442. [2022-01-28 12:32:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144442 states, 144438 states have (on average 3.09098713634916) internal successors, (446456), 144441 states have internal predecessors, (446456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:32:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144442 states to 144442 states and 446456 transitions. [2022-01-28 12:32:54,147 INFO L78 Accepts]: Start accepts. Automaton has 144442 states and 446456 transitions. Word has length 105 [2022-01-28 12:32:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:32:54,147 INFO L470 AbstractCegarLoop]: Abstraction has 144442 states and 446456 transitions. [2022-01-28 12:32:54,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:32:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 144442 states and 446456 transitions. [2022-01-28 12:32:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:32:54,321 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:32:54,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:32:54,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-28 12:32:54,321 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:32:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:32:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1833071899, now seen corresponding path program 32 times [2022-01-28 12:32:54,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:32:54,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170751899] [2022-01-28 12:32:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:32:54,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:32:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:32:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:32:54,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:32:54,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170751899] [2022-01-28 12:32:54,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170751899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:32:54,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:32:54,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-28 12:32:54,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336566136] [2022-01-28 12:32:54,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:32:54,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-28 12:32:54,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:32:54,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-28 12:32:54,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-01-28 12:32:54,997 INFO L87 Difference]: Start difference. First operand 144442 states and 446456 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:33:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:33:12,197 INFO L93 Difference]: Finished difference Result 239835 states and 738888 transitions. [2022-01-28 12:33:12,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-01-28 12:33:12,198 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:33:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:33:12,982 INFO L225 Difference]: With dead ends: 239835 [2022-01-28 12:33:12,982 INFO L226 Difference]: Without dead ends: 239835 [2022-01-28 12:33:12,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2530 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=3833, Invalid=9739, Unknown=0, NotChecked=0, Total=13572 [2022-01-28 12:33:12,983 INFO L933 BasicCegarLoop]: 1852 mSDtfsCounter, 3843 mSDsluCounter, 12425 mSDsCounter, 0 mSdLazyCounter, 5101 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3843 SdHoareTripleChecker+Valid, 14277 SdHoareTripleChecker+Invalid, 5198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 5101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-28 12:33:12,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3843 Valid, 14277 Invalid, 5198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 5101 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-28 12:33:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239835 states. [2022-01-28 12:33:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239835 to 144442. [2022-01-28 12:33:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144442 states, 144438 states have (on average 3.09098713634916) internal successors, (446456), 144441 states have internal predecessors, (446456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:33:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144442 states to 144442 states and 446456 transitions. [2022-01-28 12:33:17,629 INFO L78 Accepts]: Start accepts. Automaton has 144442 states and 446456 transitions. Word has length 105 [2022-01-28 12:33:17,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:33:17,629 INFO L470 AbstractCegarLoop]: Abstraction has 144442 states and 446456 transitions. [2022-01-28 12:33:17,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:33:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 144442 states and 446456 transitions. [2022-01-28 12:33:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:33:18,261 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:33:18,261 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:33:18,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-28 12:33:18,261 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:33:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:33:18,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1666350753, now seen corresponding path program 33 times [2022-01-28 12:33:18,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:33:18,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429535082] [2022-01-28 12:33:18,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:33:18,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:33:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:33:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:33:18,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:33:18,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429535082] [2022-01-28 12:33:18,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429535082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:33:18,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:33:18,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-28 12:33:18,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737770086] [2022-01-28 12:33:18,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:33:18,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-28 12:33:18,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:33:18,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-28 12:33:18,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-01-28 12:33:18,861 INFO L87 Difference]: Start difference. First operand 144442 states and 446456 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:33:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:33:36,551 INFO L93 Difference]: Finished difference Result 253248 states and 782123 transitions. [2022-01-28 12:33:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-01-28 12:33:36,552 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:33:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:33:37,733 INFO L225 Difference]: With dead ends: 253248 [2022-01-28 12:33:37,733 INFO L226 Difference]: Without dead ends: 253248 [2022-01-28 12:33:37,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2657 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=4135, Invalid=10627, Unknown=0, NotChecked=0, Total=14762 [2022-01-28 12:33:37,734 INFO L933 BasicCegarLoop]: 2352 mSDtfsCounter, 3022 mSDsluCounter, 17393 mSDsCounter, 0 mSdLazyCounter, 7341 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3022 SdHoareTripleChecker+Valid, 19745 SdHoareTripleChecker+Invalid, 7422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 7341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-28 12:33:37,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3022 Valid, 19745 Invalid, 7422 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [81 Valid, 7341 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-01-28 12:33:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253248 states. [2022-01-28 12:33:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253248 to 157152. [2022-01-28 12:33:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157152 states, 157148 states have (on average 3.0958395907043044) internal successors, (486505), 157151 states have internal predecessors, (486505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:33:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157152 states to 157152 states and 486505 transitions. [2022-01-28 12:33:42,816 INFO L78 Accepts]: Start accepts. Automaton has 157152 states and 486505 transitions. Word has length 105 [2022-01-28 12:33:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:33:42,817 INFO L470 AbstractCegarLoop]: Abstraction has 157152 states and 486505 transitions. [2022-01-28 12:33:42,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:33:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 157152 states and 486505 transitions. [2022-01-28 12:33:43,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:33:43,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:33:43,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:33:43,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-28 12:33:43,486 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:33:43,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:33:43,487 INFO L85 PathProgramCache]: Analyzing trace with hash -610967297, now seen corresponding path program 34 times [2022-01-28 12:33:43,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:33:43,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255798096] [2022-01-28 12:33:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:33:43,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:33:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:33:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:33:44,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:33:44,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255798096] [2022-01-28 12:33:44,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255798096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:33:44,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:33:44,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-28 12:33:44,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016797431] [2022-01-28 12:33:44,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:33:44,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-28 12:33:44,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:33:44,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-28 12:33:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2022-01-28 12:33:44,119 INFO L87 Difference]: Start difference. First operand 157152 states and 486505 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:34:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:34:02,696 INFO L93 Difference]: Finished difference Result 259872 states and 803947 transitions. [2022-01-28 12:34:02,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-01-28 12:34:02,696 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-28 12:34:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:34:03,934 INFO L225 Difference]: With dead ends: 259872 [2022-01-28 12:34:03,934 INFO L226 Difference]: Without dead ends: 259872 [2022-01-28 12:34:03,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2852 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=4296, Invalid=11204, Unknown=0, NotChecked=0, Total=15500 [2022-01-28 12:34:03,935 INFO L933 BasicCegarLoop]: 2402 mSDtfsCounter, 2999 mSDsluCounter, 18776 mSDsCounter, 0 mSdLazyCounter, 8368 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2999 SdHoareTripleChecker+Valid, 21178 SdHoareTripleChecker+Invalid, 8449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 8368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-01-28 12:34:03,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2999 Valid, 21178 Invalid, 8449 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [81 Valid, 8368 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-01-28 12:34:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259872 states. [2022-01-28 12:34:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259872 to 157214. [2022-01-28 12:34:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157214 states, 157210 states have (on average 3.095814515616055) internal successors, (486693), 157213 states have internal predecessors, (486693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:34:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157214 states to 157214 states and 486693 transitions. [2022-01-28 12:34:09,553 INFO L78 Accepts]: Start accepts. Automaton has 157214 states and 486693 transitions. Word has length 105 [2022-01-28 12:34:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:34:09,553 INFO L470 AbstractCegarLoop]: Abstraction has 157214 states and 486693 transitions. [2022-01-28 12:34:09,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:34:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 157214 states and 486693 transitions. [2022-01-28 12:34:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-28 12:34:09,760 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:34:09,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:34:09,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-28 12:34:09,761 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-28 12:34:09,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:34:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1308604067, now seen corresponding path program 35 times [2022-01-28 12:34:09,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:34:09,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630274020] [2022-01-28 12:34:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:34:09,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:34:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:34:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:34:10,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:34:10,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630274020] [2022-01-28 12:34:10,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630274020] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:34:10,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:34:10,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-28 12:34:10,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476465363] [2022-01-28 12:34:10,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:34:10,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-28 12:34:10,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:34:10,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-28 12:34:10,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-01-28 12:34:10,406 INFO L87 Difference]: Start difference. First operand 157214 states and 486693 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-01-28 12:34:17,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-28 12:34:17,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1762, Invalid=5378, Unknown=0, NotChecked=0, Total=7140 [2022-01-28 12:34:17,866 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 1656 mSDsluCounter, 5644 mSDsCounter, 0 mSdLazyCounter, 3311 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 6246 SdHoareTripleChecker+Invalid, 3376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-28 12:34:17,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1656 Valid, 6246 Invalid, 3376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3311 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-28 12:34:17,867 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2022-01-28 12:34:17,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-28 12:34:17,867 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (157214states) and FLOYD_HOARE automaton (currently 61 states, 28 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. [2022-01-28 12:34:17,872 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2022-01-28 12:34:17,872 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2022-01-28 12:34:17,872 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2022-01-28 12:34:17,872 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2022-01-28 12:34:17,873 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 10 remaining) [2022-01-28 12:34:17,873 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 10 remaining) [2022-01-28 12:34:17,873 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2022-01-28 12:34:17,873 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2022-01-28 12:34:17,873 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2022-01-28 12:34:17,875 INFO L732 BasicCegarLoop]: Path program histogram: [35, 3, 1] [2022-01-28 12:34:17,877 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-28 12:34:17,877 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-28 12:34:17,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:34:17 BasicIcfg [2022-01-28 12:34:17,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-28 12:34:17,880 INFO L158 Benchmark]: Toolchain (without parser) took 629362.65ms. Allocated memory was 192.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 141.5MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-01-28 12:34:17,880 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-28 12:34:17,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.37ms. Allocated memory is still 192.9MB. Free memory was 141.3MB in the beginning and 146.5MB in the end (delta: -5.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-28 12:34:17,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.45ms. Allocated memory is still 192.9MB. Free memory was 146.0MB in the beginning and 143.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-28 12:34:17,881 INFO L158 Benchmark]: Boogie Preprocessor took 34.88ms. Allocated memory is still 192.9MB. Free memory was 143.4MB in the beginning and 141.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-28 12:34:17,881 INFO L158 Benchmark]: RCFGBuilder took 567.26ms. Allocated memory is still 192.9MB. Free memory was 141.3MB in the beginning and 122.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-28 12:34:17,881 INFO L158 Benchmark]: TraceAbstraction took 628115.71ms. Allocated memory was 192.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 121.9MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-01-28 12:34:17,882 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 581.37ms. Allocated memory is still 192.9MB. Free memory was 141.3MB in the beginning and 146.5MB in the end (delta: -5.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.45ms. Allocated memory is still 192.9MB. Free memory was 146.0MB in the beginning and 143.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.88ms. Allocated memory is still 192.9MB. Free memory was 143.4MB in the beginning and 141.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 567.26ms. Allocated memory is still 192.9MB. Free memory was 141.3MB in the beginning and 122.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 628115.71ms. Allocated memory was 192.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 121.9MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (157214states) and FLOYD_HOARE automaton (currently 61 states, 28 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (157214states) and FLOYD_HOARE automaton (currently 61 states, 28 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (157214states) and FLOYD_HOARE automaton (currently 61 states, 28 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (157214states) and FLOYD_HOARE automaton (currently 61 states, 28 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. - TimeoutResultAtElement [Line: 1076]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (157214states) and FLOYD_HOARE automaton (currently 61 states, 28 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. - TimeoutResultAtElement [Line: 1075]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (157214states) and FLOYD_HOARE automaton (currently 61 states, 28 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 318 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 627.9s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 35, EmptinessCheckTime: 11.2s, AutomataDifference: 408.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110493 SdHoareTripleChecker+Valid, 84.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110493 mSDsluCounter, 467166 SdHoareTripleChecker+Invalid, 71.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421649 mSDsCounter, 3084 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 174779 IncrementalHoareTripleChecker+Invalid, 177863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3084 mSolverCounterUnsat, 45517 mSDtfsCounter, 174779 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3125 GetRequests, 127 SyntacticMatches, 7 SemanticMatches, 2990 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39412 ImplicationChecksByTransitivity, 262.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162143occurred in iteration=32, InterpolantAutomatonStates: 2084, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 172.4s AutomataMinimizationTime, 38 MinimizatonAttempts, 2180516 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 31.0s InterpolantComputationTime, 4022 NumberOfCodeBlocks, 4022 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3983 ConstructedInterpolants, 0 QuantifiedInterpolants, 61718 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available [2022-01-28 12:34:17,885 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown