/usr/bin/java -Xmx16000000000 -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-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 09:46:52,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 09:46:52,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 09:46:52,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 09:46:52,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 09:46:52,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 09:46:52,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 09:46:52,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 09:46:52,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 09:46:52,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 09:46:52,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 09:46:52,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 09:46:52,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 09:46:52,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 09:46:52,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 09:46:52,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 09:46:52,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 09:46:52,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 09:46:52,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 09:46:52,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 09:46:52,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 09:46:52,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 09:46:52,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 09:46:52,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 09:46:52,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 09:46:52,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 09:46:52,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 09:46:52,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 09:46:52,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 09:46:52,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 09:46:52,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 09:46:52,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 09:46:52,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 09:46:52,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 09:46:52,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 09:46:52,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 09:46:52,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 09:46:52,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 09:46:52,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 09:46:52,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 09:46:52,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 09:46:52,576 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-Separate.epf [2022-01-18 09:46:52,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 09:46:52,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 09:46:52,589 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 09:46:52,589 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 09:46:52,590 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 09:46:52,590 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 09:46:52,590 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 09:46:52,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 09:46:52,590 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 09:46:52,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 09:46:52,591 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 09:46:52,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 09:46:52,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 09:46:52,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 09:46:52,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 09:46:52,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 09:46:52,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 09:46:52,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 09:46:52,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 09:46:52,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 09:46:52,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 09:46:52,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 09:46:52,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 09:46:52,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 09:46:52,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 09:46:52,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 09:46:52,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 09:46:52,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 09:46:52,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 09:46:52,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 09:46:52,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 09:46:52,592 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 09:46:52,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 09:46:52,592 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 09:46:52,592 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-18 09:46:52,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 09:46:52,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 09:46:52,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 09:46:52,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 09:46:52,802 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 09:46:52,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-01-18 09:46:52,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174d9180b/e96d3835ea61414aa9988b71d9d293be/FLAG76466425f [2022-01-18 09:46:53,225 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 09:46:53,226 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-01-18 09:46:53,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174d9180b/e96d3835ea61414aa9988b71d9d293be/FLAG76466425f [2022-01-18 09:46:53,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174d9180b/e96d3835ea61414aa9988b71d9d293be [2022-01-18 09:46:53,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 09:46:53,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 09:46:53,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 09:46:53,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 09:46:53,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 09:46:53,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a703669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53, skipping insertion in model container [2022-01-18 09:46:53,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 09:46:53,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 09:46:53,451 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-18 09:46:53,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-01-18 09:46:53,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-01-18 09:46:53,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-01-18 09:46:53,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-01-18 09:46:53,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-01-18 09:46:53,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-01-18 09:46:53,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-01-18 09:46:53,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 09:46:53,667 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 09:46:53,674 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-18 09:46:53,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-01-18 09:46:53,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-01-18 09:46:53,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-01-18 09:46:53,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-01-18 09:46:53,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-01-18 09:46:53,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-01-18 09:46:53,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-01-18 09:46:53,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 09:46:53,758 INFO L208 MainTranslator]: Completed translation [2022-01-18 09:46:53,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53 WrapperNode [2022-01-18 09:46:53,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 09:46:53,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 09:46:53,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 09:46:53,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 09:46:53,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,818 INFO L137 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2022-01-18 09:46:53,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 09:46:53,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 09:46:53,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 09:46:53,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 09:46:53,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 09:46:53,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 09:46:53,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 09:46:53,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 09:46:53,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53" (1/1) ... [2022-01-18 09:46:53,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 09:46:53,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:46:53,894 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-18 09:46:53,917 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-18 09:46:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-01-18 09:46:53,933 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-01-18 09:46:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-01-18 09:46:53,933 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-01-18 09:46:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 09:46:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 09:46:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 09:46:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 09:46:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-18 09:46:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 09:46:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 09:46:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 09:46:53,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 09:46:53,934 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 09:46:54,012 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 09:46:54,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 09:46:54,274 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 09:46:54,281 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 09:46:54,281 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-18 09:46:54,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:46:54 BoogieIcfgContainer [2022-01-18 09:46:54,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 09:46:54,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 09:46:54,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 09:46:54,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 09:46:54,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 09:46:53" (1/3) ... [2022-01-18 09:46:54,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c179411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:46:54, skipping insertion in model container [2022-01-18 09:46:54,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:46:53" (2/3) ... [2022-01-18 09:46:54,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c179411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:46:54, skipping insertion in model container [2022-01-18 09:46:54,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:46:54" (3/3) ... [2022-01-18 09:46:54,293 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-01-18 09:46:54,296 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 09:46:54,296 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 09:46:54,296 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-18 09:46:54,296 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 09:46:54,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,358 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,359 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,367 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,367 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,368 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,368 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,369 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,371 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,383 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,387 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,387 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,387 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,387 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,394 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,394 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,400 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,402 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,405 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,405 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,405 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,405 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,405 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,406 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,406 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,406 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,419 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,420 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,421 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,421 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,421 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,421 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,421 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,421 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,421 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,421 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,422 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,423 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,423 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,428 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,428 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,428 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,428 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,428 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,428 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,428 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,429 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,429 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,429 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,429 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,429 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,431 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,431 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,431 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,432 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,432 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,432 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,432 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,434 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,434 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,438 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,438 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,438 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,438 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,440 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,448 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,448 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,448 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,448 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,448 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,449 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,450 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,451 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,451 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,451 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,451 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,451 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:46:54,454 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-18 09:46:54,486 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 09:46:54,490 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-18 09:46:54,490 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-01-18 09:46:54,499 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 223 places, 233 transitions, 482 flow [2022-01-18 09:46:56,574 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:46:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:46:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-18 09:46:57,056 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:46:57,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:46:57,057 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-18 09:46:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:46:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash 508547485, now seen corresponding path program 1 times [2022-01-18 09:46:57,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:46:57,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744801433] [2022-01-18 09:46:57,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:46:57,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:46:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:46:57,654 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-18 09:46:57,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:46:57,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744801433] [2022-01-18 09:46:57,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744801433] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:46:57,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:46:57,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-18 09:46:57,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526295477] [2022-01-18 09:46:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:46:57,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 09:46:57,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:46:57,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 09:46:57,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-01-18 09:46:57,816 INFO L87 Difference]: Start difference. First operand has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:47:00,190 INFO L93 Difference]: Finished difference Result 105175 states and 323599 transitions. [2022-01-18 09:47:00,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-18 09:47:00,192 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-01-18 09:47:00,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:47:00,629 INFO L225 Difference]: With dead ends: 105175 [2022-01-18 09:47:00,629 INFO L226 Difference]: Without dead ends: 105120 [2022-01-18 09:47:00,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=370, Invalid=890, Unknown=0, NotChecked=0, Total=1260 [2022-01-18 09:47:00,636 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 923 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:47:00,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [923 Valid, 1876 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 09:47:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105120 states. [2022-01-18 09:47:03,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105120 to 105095. [2022-01-18 09:47:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105095 states, 105091 states have (on average 3.0777516628445825) internal successors, (323444), 105094 states have internal predecessors, (323444), 0 states have call successors, (0), 0 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-18 09:47:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105095 states to 105095 states and 323444 transitions. [2022-01-18 09:47:03,773 INFO L78 Accepts]: Start accepts. Automaton has 105095 states and 323444 transitions. Word has length 90 [2022-01-18 09:47:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:47:03,773 INFO L470 AbstractCegarLoop]: Abstraction has 105095 states and 323444 transitions. [2022-01-18 09:47:03,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 105095 states and 323444 transitions. [2022-01-18 09:47:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-01-18 09:47:03,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:47:03,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:47:03,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 09:47:03,852 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-18 09:47:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:47:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1997030488, now seen corresponding path program 1 times [2022-01-18 09:47:03,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:47:03,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554559857] [2022-01-18 09:47:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:47:03,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:47:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:47:04,188 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-18 09:47:04,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:47:04,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554559857] [2022-01-18 09:47:04,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554559857] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:47:04,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:47:04,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-18 09:47:04,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851855361] [2022-01-18 09:47:04,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:47:04,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 09:47:04,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:47:04,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 09:47:04,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-01-18 09:47:04,190 INFO L87 Difference]: Start difference. First operand 105095 states and 323444 transitions. Second operand has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:47:06,501 INFO L93 Difference]: Finished difference Result 119915 states and 368682 transitions. [2022-01-18 09:47:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-18 09:47:06,502 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-01-18 09:47:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:47:06,865 INFO L225 Difference]: With dead ends: 119915 [2022-01-18 09:47:06,865 INFO L226 Difference]: Without dead ends: 119915 [2022-01-18 09:47:06,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=361, Invalid=971, Unknown=0, NotChecked=0, Total=1332 [2022-01-18 09:47:06,866 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 1299 mSDsluCounter, 3974 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 4404 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:47:06,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1299 Valid, 4404 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-18 09:47:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119915 states. [2022-01-18 09:47:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119915 to 113165. [2022-01-18 09:47:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113165 states, 113161 states have (on average 3.076077447177031) internal successors, (348092), 113164 states have internal predecessors, (348092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113165 states to 113165 states and 348092 transitions. [2022-01-18 09:47:09,995 INFO L78 Accepts]: Start accepts. Automaton has 113165 states and 348092 transitions. Word has length 95 [2022-01-18 09:47:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:47:09,996 INFO L470 AbstractCegarLoop]: Abstraction has 113165 states and 348092 transitions. [2022-01-18 09:47:09,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 113165 states and 348092 transitions. [2022-01-18 09:47:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-01-18 09:47:10,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:47:10,051 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:47:10,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 09:47:10,051 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-18 09:47:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:47:10,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1144672626, now seen corresponding path program 2 times [2022-01-18 09:47:10,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:47:10,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536325494] [2022-01-18 09:47:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:47:10,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:47:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:47:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:47:10,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:47:10,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536325494] [2022-01-18 09:47:10,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536325494] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:47:10,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:47:10,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-18 09:47:10,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100144832] [2022-01-18 09:47:10,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:47:10,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-18 09:47:10,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:47:10,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-18 09:47:10,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-01-18 09:47:10,390 INFO L87 Difference]: Start difference. First operand 113165 states and 348092 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:47:13,182 INFO L93 Difference]: Finished difference Result 155725 states and 478789 transitions. [2022-01-18 09:47:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-18 09:47:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-01-18 09:47:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:47:13,912 INFO L225 Difference]: With dead ends: 155725 [2022-01-18 09:47:13,912 INFO L226 Difference]: Without dead ends: 154885 [2022-01-18 09:47:13,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=389, Invalid=1093, Unknown=0, NotChecked=0, Total=1482 [2022-01-18 09:47:13,915 INFO L933 BasicCegarLoop]: 638 mSDtfsCounter, 1981 mSDsluCounter, 5486 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1981 SdHoareTripleChecker+Valid, 6124 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:47:13,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1981 Valid, 6124 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-18 09:47:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154885 states. [2022-01-18 09:47:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154885 to 132244. [2022-01-18 09:47:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132244 states, 132240 states have (on average 3.0773744706594073) internal successors, (406952), 132243 states have internal predecessors, (406952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132244 states to 132244 states and 406952 transitions. [2022-01-18 09:47:17,513 INFO L78 Accepts]: Start accepts. Automaton has 132244 states and 406952 transitions. Word has length 95 [2022-01-18 09:47:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:47:17,514 INFO L470 AbstractCegarLoop]: Abstraction has 132244 states and 406952 transitions. [2022-01-18 09:47:17,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 132244 states and 406952 transitions. [2022-01-18 09:47:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:47:17,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:47:17,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:47:17,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 09:47:17,632 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-18 09:47:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:47:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1175061358, now seen corresponding path program 1 times [2022-01-18 09:47:17,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:47:17,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558187320] [2022-01-18 09:47:17,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:47:17,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:47:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:47:18,296 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-18 09:47:18,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:47:18,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558187320] [2022-01-18 09:47:18,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558187320] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:47:18,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:47:18,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:47:18,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027266151] [2022-01-18 09:47:18,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:47:18,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:47:18,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:47:18,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:47:18,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:47:18,298 INFO L87 Difference]: Start difference. First operand 132244 states and 406952 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:47:25,943 INFO L93 Difference]: Finished difference Result 156625 states and 481546 transitions. [2022-01-18 09:47:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-18 09:47:25,944 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:47:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:47:26,358 INFO L225 Difference]: With dead ends: 156625 [2022-01-18 09:47:26,358 INFO L226 Difference]: Without dead ends: 156625 [2022-01-18 09:47:26,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1568, Invalid=4284, Unknown=0, NotChecked=0, Total=5852 [2022-01-18 09:47:26,360 INFO L933 BasicCegarLoop]: 1139 mSDtfsCounter, 3628 mSDsluCounter, 10478 mSDsCounter, 0 mSdLazyCounter, 3636 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3628 SdHoareTripleChecker+Valid, 11617 SdHoareTripleChecker+Invalid, 3714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:47:26,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3628 Valid, 11617 Invalid, 3714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3636 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-18 09:47:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156625 states. [2022-01-18 09:47:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156625 to 133003. [2022-01-18 09:47:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133003 states, 132999 states have (on average 3.0775494552590623) internal successors, (409311), 133002 states have internal predecessors, (409311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133003 states to 133003 states and 409311 transitions. [2022-01-18 09:47:29,959 INFO L78 Accepts]: Start accepts. Automaton has 133003 states and 409311 transitions. Word has length 114 [2022-01-18 09:47:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:47:29,961 INFO L470 AbstractCegarLoop]: Abstraction has 133003 states and 409311 transitions. [2022-01-18 09:47:29,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 133003 states and 409311 transitions. [2022-01-18 09:47:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:47:30,108 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:47:30,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:47:30,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 09:47:30,108 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-18 09:47:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:47:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash 788572584, now seen corresponding path program 2 times [2022-01-18 09:47:30,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:47:30,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835041655] [2022-01-18 09:47:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:47:30,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:47:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:47:30,786 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-18 09:47:30,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:47:30,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835041655] [2022-01-18 09:47:30,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835041655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:47:30,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:47:30,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:47:30,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789703408] [2022-01-18 09:47:30,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:47:30,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:47:30,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:47:30,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:47:30,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:47:30,788 INFO L87 Difference]: Start difference. First operand 133003 states and 409311 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:47:39,619 INFO L93 Difference]: Finished difference Result 167617 states and 515385 transitions. [2022-01-18 09:47:39,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-01-18 09:47:39,620 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:47:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:47:40,066 INFO L225 Difference]: With dead ends: 167617 [2022-01-18 09:47:40,066 INFO L226 Difference]: Without dead ends: 167617 [2022-01-18 09:47:40,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1678, Invalid=4642, Unknown=0, NotChecked=0, Total=6320 [2022-01-18 09:47:40,068 INFO L933 BasicCegarLoop]: 1144 mSDtfsCounter, 3287 mSDsluCounter, 13563 mSDsCounter, 0 mSdLazyCounter, 4887 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3287 SdHoareTripleChecker+Valid, 14707 SdHoareTripleChecker+Invalid, 4962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 4887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:47:40,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3287 Valid, 14707 Invalid, 4962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4887 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-18 09:47:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167617 states. [2022-01-18 09:47:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167617 to 133036. [2022-01-18 09:47:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133036 states, 133032 states have (on average 3.077537735281737) internal successors, (409411), 133035 states have internal predecessors, (409411), 0 states have call successors, (0), 0 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-18 09:47:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133036 states to 133036 states and 409411 transitions. [2022-01-18 09:47:43,877 INFO L78 Accepts]: Start accepts. Automaton has 133036 states and 409411 transitions. Word has length 114 [2022-01-18 09:47:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:47:43,877 INFO L470 AbstractCegarLoop]: Abstraction has 133036 states and 409411 transitions. [2022-01-18 09:47:43,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 133036 states and 409411 transitions. [2022-01-18 09:47:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:47:43,988 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:47:43,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:47:43,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 09:47:43,989 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-18 09:47:43,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:47:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash 124783814, now seen corresponding path program 3 times [2022-01-18 09:47:43,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:47:43,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194896526] [2022-01-18 09:47:43,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:47:43,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:47:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:47:44,652 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-18 09:47:44,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:47:44,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194896526] [2022-01-18 09:47:44,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194896526] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:47:44,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:47:44,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:47:44,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800813292] [2022-01-18 09:47:44,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:47:44,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:47:44,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:47:44,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:47:44,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:47:44,654 INFO L87 Difference]: Start difference. First operand 133036 states and 409411 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:47:53,814 INFO L93 Difference]: Finished difference Result 167485 states and 514985 transitions. [2022-01-18 09:47:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-18 09:47:53,815 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:47:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:47:54,244 INFO L225 Difference]: With dead ends: 167485 [2022-01-18 09:47:54,244 INFO L226 Difference]: Without dead ends: 167485 [2022-01-18 09:47:54,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1797, Invalid=5009, Unknown=0, NotChecked=0, Total=6806 [2022-01-18 09:47:54,246 INFO L933 BasicCegarLoop]: 1205 mSDtfsCounter, 3590 mSDsluCounter, 12746 mSDsCounter, 0 mSdLazyCounter, 4580 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3590 SdHoareTripleChecker+Valid, 13951 SdHoareTripleChecker+Invalid, 4661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 4580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:47:54,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3590 Valid, 13951 Invalid, 4661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 4580 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-18 09:47:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167485 states. [2022-01-18 09:47:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167485 to 133069. [2022-01-18 09:47:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133069 states, 133065 states have (on average 3.077526021117499) internal successors, (409511), 133068 states have internal predecessors, (409511), 0 states have call successors, (0), 0 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-18 09:47:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133069 states to 133069 states and 409511 transitions. [2022-01-18 09:47:57,483 INFO L78 Accepts]: Start accepts. Automaton has 133069 states and 409511 transitions. Word has length 114 [2022-01-18 09:47:57,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:47:57,483 INFO L470 AbstractCegarLoop]: Abstraction has 133069 states and 409511 transitions. [2022-01-18 09:47:57,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:47:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 133069 states and 409511 transitions. [2022-01-18 09:47:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:47:58,094 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:47:58,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:47:58,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 09:47:58,094 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-18 09:47:58,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:47:58,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2145687926, now seen corresponding path program 4 times [2022-01-18 09:47:58,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:47:58,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164913661] [2022-01-18 09:47:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:47:58,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:47:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:47:58,695 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-18 09:47:58,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:47:58,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164913661] [2022-01-18 09:47:58,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164913661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:47:58,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:47:58,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:47:58,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733589390] [2022-01-18 09:47:58,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:47:58,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:47:58,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:47:58,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:47:58,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:47:58,697 INFO L87 Difference]: Start difference. First operand 133069 states and 409511 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:48:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:48:07,869 INFO L93 Difference]: Finished difference Result 166624 states and 512374 transitions. [2022-01-18 09:48:07,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-18 09:48:07,870 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:48:07,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:48:08,811 INFO L225 Difference]: With dead ends: 166624 [2022-01-18 09:48:08,811 INFO L226 Difference]: Without dead ends: 166624 [2022-01-18 09:48:08,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1921, Invalid=5389, Unknown=0, NotChecked=0, Total=7310 [2022-01-18 09:48:08,813 INFO L933 BasicCegarLoop]: 1266 mSDtfsCounter, 3295 mSDsluCounter, 14169 mSDsCounter, 0 mSdLazyCounter, 5069 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3295 SdHoareTripleChecker+Valid, 15435 SdHoareTripleChecker+Invalid, 5145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 5069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:48:08,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3295 Valid, 15435 Invalid, 5145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 5069 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-18 09:48:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166624 states. [2022-01-18 09:48:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166624 to 133267. [2022-01-18 09:48:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133267 states, 133263 states have (on average 3.0776509608818654) internal successors, (410137), 133266 states have internal predecessors, (410137), 0 states have call successors, (0), 0 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-18 09:48:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133267 states to 133267 states and 410137 transitions. [2022-01-18 09:48:12,065 INFO L78 Accepts]: Start accepts. Automaton has 133267 states and 410137 transitions. Word has length 114 [2022-01-18 09:48:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:48:12,065 INFO L470 AbstractCegarLoop]: Abstraction has 133267 states and 410137 transitions. [2022-01-18 09:48:12,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:48:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 133267 states and 410137 transitions. [2022-01-18 09:48:12,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:48:12,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:48:12,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:48:12,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 09:48:12,178 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-18 09:48:12,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:48:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash 793775866, now seen corresponding path program 5 times [2022-01-18 09:48:12,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:48:12,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547324771] [2022-01-18 09:48:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:48:12,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:48:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:48:13,247 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-18 09:48:13,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:48:13,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547324771] [2022-01-18 09:48:13,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547324771] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:48:13,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:48:13,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:48:13,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097846940] [2022-01-18 09:48:13,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:48:13,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:48:13,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:48:13,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:48:13,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:48:13,249 INFO L87 Difference]: Start difference. First operand 133267 states and 410137 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:48:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:48:23,206 INFO L93 Difference]: Finished difference Result 165733 states and 509648 transitions. [2022-01-18 09:48:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-18 09:48:23,206 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:48:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:48:23,886 INFO L225 Difference]: With dead ends: 165733 [2022-01-18 09:48:23,886 INFO L226 Difference]: Without dead ends: 165733 [2022-01-18 09:48:23,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2184, Invalid=6188, Unknown=0, NotChecked=0, Total=8372 [2022-01-18 09:48:23,888 INFO L933 BasicCegarLoop]: 1390 mSDtfsCounter, 3446 mSDsluCounter, 14059 mSDsCounter, 0 mSdLazyCounter, 4949 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3446 SdHoareTripleChecker+Valid, 15449 SdHoareTripleChecker+Invalid, 5035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:48:23,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3446 Valid, 15449 Invalid, 5035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4949 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-18 09:48:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165733 states. [2022-01-18 09:48:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165733 to 133630. [2022-01-18 09:48:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133630 states, 133626 states have (on average 3.0777692963944143) internal successors, (411270), 133629 states have internal predecessors, (411270), 0 states have call successors, (0), 0 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-18 09:48:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133630 states to 133630 states and 411270 transitions. [2022-01-18 09:48:27,097 INFO L78 Accepts]: Start accepts. Automaton has 133630 states and 411270 transitions. Word has length 114 [2022-01-18 09:48:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:48:27,097 INFO L470 AbstractCegarLoop]: Abstraction has 133630 states and 411270 transitions. [2022-01-18 09:48:27,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:48:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 133630 states and 411270 transitions. [2022-01-18 09:48:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:48:27,209 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:48:27,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:48:27,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 09:48:27,209 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-18 09:48:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:48:27,209 INFO L85 PathProgramCache]: Analyzing trace with hash -767686718, now seen corresponding path program 6 times [2022-01-18 09:48:27,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:48:27,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810348118] [2022-01-18 09:48:27,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:48:27,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:48:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:48:27,802 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-18 09:48:27,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:48:27,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810348118] [2022-01-18 09:48:27,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810348118] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:48:27,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:48:27,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:48:27,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192472563] [2022-01-18 09:48:27,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:48:27,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:48:27,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:48:27,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:48:27,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:48:27,805 INFO L87 Difference]: Start difference. First operand 133630 states and 411270 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:48:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:48:38,941 INFO L93 Difference]: Finished difference Result 164875 states and 506916 transitions. [2022-01-18 09:48:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-18 09:48:38,942 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:48:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:48:39,606 INFO L225 Difference]: With dead ends: 164875 [2022-01-18 09:48:39,606 INFO L226 Difference]: Without dead ends: 164875 [2022-01-18 09:48:39,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2492, Invalid=7014, Unknown=0, NotChecked=0, Total=9506 [2022-01-18 09:48:39,608 INFO L933 BasicCegarLoop]: 1496 mSDtfsCounter, 3877 mSDsluCounter, 15984 mSDsCounter, 0 mSdLazyCounter, 5724 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3877 SdHoareTripleChecker+Valid, 17480 SdHoareTripleChecker+Invalid, 5827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 5724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:48:39,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3877 Valid, 17480 Invalid, 5827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 5724 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-01-18 09:48:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164875 states. [2022-01-18 09:48:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164875 to 133663. [2022-01-18 09:48:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133663 states, 133659 states have (on average 3.0777575771178896) internal successors, (411370), 133662 states have internal predecessors, (411370), 0 states have call successors, (0), 0 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-18 09:48:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133663 states to 133663 states and 411370 transitions. [2022-01-18 09:48:42,863 INFO L78 Accepts]: Start accepts. Automaton has 133663 states and 411370 transitions. Word has length 114 [2022-01-18 09:48:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:48:42,864 INFO L470 AbstractCegarLoop]: Abstraction has 133663 states and 411370 transitions. [2022-01-18 09:48:42,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:48:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 133663 states and 411370 transitions. [2022-01-18 09:48:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:48:42,975 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:48:42,975 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:48:42,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 09:48:42,975 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-18 09:48:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:48:42,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1979149546, now seen corresponding path program 7 times [2022-01-18 09:48:42,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:48:42,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582530118] [2022-01-18 09:48:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:48:42,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:48:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:48:43,642 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-18 09:48:43,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:48:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582530118] [2022-01-18 09:48:43,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582530118] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:48:43,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:48:43,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:48:43,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998041701] [2022-01-18 09:48:43,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:48:43,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:48:43,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:48:43,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:48:43,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:48:43,644 INFO L87 Difference]: Start difference. First operand 133663 states and 411370 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:48:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:48:54,128 INFO L93 Difference]: Finished difference Result 163753 states and 503417 transitions. [2022-01-18 09:48:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-18 09:48:54,128 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:48:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:48:54,542 INFO L225 Difference]: With dead ends: 163753 [2022-01-18 09:48:54,542 INFO L226 Difference]: Without dead ends: 163753 [2022-01-18 09:48:54,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2300, Invalid=5532, Unknown=0, NotChecked=0, Total=7832 [2022-01-18 09:48:54,544 INFO L933 BasicCegarLoop]: 1500 mSDtfsCounter, 2666 mSDsluCounter, 12223 mSDsCounter, 0 mSdLazyCounter, 4491 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2666 SdHoareTripleChecker+Valid, 13723 SdHoareTripleChecker+Invalid, 4574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 4491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-18 09:48:54,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2666 Valid, 13723 Invalid, 4574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 4491 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-18 09:48:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163753 states. [2022-01-18 09:48:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163753 to 142999. [2022-01-18 09:48:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142999 states, 142995 states have (on average 3.0793943844190355) internal successors, (440338), 142998 states have internal predecessors, (440338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:48:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142999 states to 142999 states and 440338 transitions. [2022-01-18 09:48:58,656 INFO L78 Accepts]: Start accepts. Automaton has 142999 states and 440338 transitions. Word has length 114 [2022-01-18 09:48:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:48:58,656 INFO L470 AbstractCegarLoop]: Abstraction has 142999 states and 440338 transitions. [2022-01-18 09:48:58,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:48:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 142999 states and 440338 transitions. [2022-01-18 09:48:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:48:58,793 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:48:58,793 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:48:58,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 09:48:58,793 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-18 09:48:58,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:48:58,794 INFO L85 PathProgramCache]: Analyzing trace with hash -386091310, now seen corresponding path program 8 times [2022-01-18 09:48:58,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:48:58,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707922711] [2022-01-18 09:48:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:48:58,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:48:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:48:59,517 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-18 09:48:59,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:48:59,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707922711] [2022-01-18 09:48:59,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707922711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:48:59,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:48:59,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:48:59,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875642078] [2022-01-18 09:48:59,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:48:59,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:48:59,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:48:59,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:48:59,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:48:59,519 INFO L87 Difference]: Start difference. First operand 142999 states and 440338 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:49:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:49:06,718 INFO L93 Difference]: Finished difference Result 187159 states and 575304 transitions. [2022-01-18 09:49:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-18 09:49:06,719 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:49:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:49:07,221 INFO L225 Difference]: With dead ends: 187159 [2022-01-18 09:49:07,222 INFO L226 Difference]: Without dead ends: 187159 [2022-01-18 09:49:07,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-01-18 09:49:07,222 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 3762 mSDsluCounter, 8850 mSDsCounter, 0 mSdLazyCounter, 3054 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3762 SdHoareTripleChecker+Valid, 9985 SdHoareTripleChecker+Invalid, 3131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 09:49:07,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3762 Valid, 9985 Invalid, 3131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3054 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-18 09:49:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187159 states. [2022-01-18 09:49:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187159 to 144220. [2022-01-18 09:49:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144220 states, 144216 states have (on average 3.079387862650469) internal successors, (444097), 144219 states have internal predecessors, (444097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:49:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144220 states to 144220 states and 444097 transitions. [2022-01-18 09:49:11,323 INFO L78 Accepts]: Start accepts. Automaton has 144220 states and 444097 transitions. Word has length 114 [2022-01-18 09:49:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:49:11,323 INFO L470 AbstractCegarLoop]: Abstraction has 144220 states and 444097 transitions. [2022-01-18 09:49:11,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:49:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 144220 states and 444097 transitions. [2022-01-18 09:49:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:49:11,454 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:49:11,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:49:11,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 09:49:11,454 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-18 09:49:11,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:49:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1049880080, now seen corresponding path program 9 times [2022-01-18 09:49:11,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:49:11,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098669906] [2022-01-18 09:49:11,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:49:11,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:49:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:49:12,070 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-18 09:49:12,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:49:12,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098669906] [2022-01-18 09:49:12,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098669906] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:49:12,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:49:12,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:49:12,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42609516] [2022-01-18 09:49:12,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:49:12,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:49:12,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:49:12,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:49:12,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:49:12,072 INFO L87 Difference]: Start difference. First operand 144220 states and 444097 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:49:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:49:20,272 INFO L93 Difference]: Finished difference Result 197656 states and 607643 transitions. [2022-01-18 09:49:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-18 09:49:20,273 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:49:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:49:21,124 INFO L225 Difference]: With dead ends: 197656 [2022-01-18 09:49:21,124 INFO L226 Difference]: Without dead ends: 197656 [2022-01-18 09:49:21,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1587, Invalid=4419, Unknown=0, NotChecked=0, Total=6006 [2022-01-18 09:49:21,125 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 3383 mSDsluCounter, 12520 mSDsCounter, 0 mSdLazyCounter, 4479 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3383 SdHoareTripleChecker+Valid, 13716 SdHoareTripleChecker+Invalid, 4549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:49:21,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3383 Valid, 13716 Invalid, 4549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4479 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-18 09:49:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197656 states. [2022-01-18 09:49:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197656 to 144253. [2022-01-18 09:49:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144253 states, 144249 states have (on average 3.079376633460197) internal successors, (444197), 144252 states have internal predecessors, (444197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:49:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144253 states to 144253 states and 444197 transitions. [2022-01-18 09:49:24,686 INFO L78 Accepts]: Start accepts. Automaton has 144253 states and 444197 transitions. Word has length 114 [2022-01-18 09:49:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:49:24,686 INFO L470 AbstractCegarLoop]: Abstraction has 144253 states and 444197 transitions. [2022-01-18 09:49:24,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:49:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 144253 states and 444197 transitions. [2022-01-18 09:49:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:49:24,813 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:49:24,813 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:49:24,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-18 09:49:24,813 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-18 09:49:24,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:49:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash 974615476, now seen corresponding path program 10 times [2022-01-18 09:49:24,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:49:24,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054392052] [2022-01-18 09:49:24,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:49:24,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:49:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:49:25,932 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-18 09:49:25,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:49:25,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054392052] [2022-01-18 09:49:25,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054392052] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:49:25,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:49:25,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:49:25,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885316833] [2022-01-18 09:49:25,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:49:25,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:49:25,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:49:25,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:49:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:49:25,933 INFO L87 Difference]: Start difference. First operand 144253 states and 444197 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:49:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:49:34,658 INFO L93 Difference]: Finished difference Result 196795 states and 605032 transitions. [2022-01-18 09:49:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-01-18 09:49:34,658 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:49:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:49:35,204 INFO L225 Difference]: With dead ends: 196795 [2022-01-18 09:49:35,205 INFO L226 Difference]: Without dead ends: 196795 [2022-01-18 09:49:35,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1705, Invalid=4775, Unknown=0, NotChecked=0, Total=6480 [2022-01-18 09:49:35,206 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 3096 mSDsluCounter, 13880 mSDsCounter, 0 mSdLazyCounter, 4952 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 15137 SdHoareTripleChecker+Invalid, 5017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:49:35,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3096 Valid, 15137 Invalid, 5017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4952 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-18 09:49:35,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196795 states. [2022-01-18 09:49:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196795 to 144451. [2022-01-18 09:49:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144451 states, 144447 states have (on average 3.0794893628805027) internal successors, (444823), 144450 states have internal predecessors, (444823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:49:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144451 states to 144451 states and 444823 transitions. [2022-01-18 09:49:39,383 INFO L78 Accepts]: Start accepts. Automaton has 144451 states and 444823 transitions. Word has length 114 [2022-01-18 09:49:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:49:39,383 INFO L470 AbstractCegarLoop]: Abstraction has 144451 states and 444823 transitions. [2022-01-18 09:49:39,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:49:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 144451 states and 444823 transitions. [2022-01-18 09:49:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:49:39,511 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:49:39,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:49:39,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-18 09:49:39,511 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-18 09:49:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:49:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash -380888028, now seen corresponding path program 11 times [2022-01-18 09:49:39,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:49:39,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458347849] [2022-01-18 09:49:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:49:39,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:49:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:49:40,266 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-18 09:49:40,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:49:40,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458347849] [2022-01-18 09:49:40,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458347849] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:49:40,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:49:40,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-18 09:49:40,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75007124] [2022-01-18 09:49:40,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:49:40,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-18 09:49:40,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:49:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-18 09:49:40,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2022-01-18 09:49:40,267 INFO L87 Difference]: Start difference. First operand 144451 states and 444823 transitions. Second operand has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:49:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:49:53,768 INFO L93 Difference]: Finished difference Result 194812 states and 598988 transitions. [2022-01-18 09:49:53,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-18 09:49:53,771 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:49:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:49:54,301 INFO L225 Difference]: With dead ends: 194812 [2022-01-18 09:49:54,302 INFO L226 Difference]: Without dead ends: 194812 [2022-01-18 09:49:54,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2647, Invalid=7453, Unknown=0, NotChecked=0, Total=10100 [2022-01-18 09:49:54,303 INFO L933 BasicCegarLoop]: 1667 mSDtfsCounter, 3396 mSDsluCounter, 17753 mSDsCounter, 0 mSdLazyCounter, 6360 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3396 SdHoareTripleChecker+Valid, 19420 SdHoareTripleChecker+Invalid, 6439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 6360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:49:54,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3396 Valid, 19420 Invalid, 6439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 6360 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-18 09:49:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194812 states. [2022-01-18 09:49:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194812 to 145802. [2022-01-18 09:49:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145802 states, 145798 states have (on average 3.0792191936789255) internal successors, (448944), 145801 states have internal predecessors, (448944), 0 states have call successors, (0), 0 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-18 09:49:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145802 states to 145802 states and 448944 transitions. [2022-01-18 09:49:57,911 INFO L78 Accepts]: Start accepts. Automaton has 145802 states and 448944 transitions. Word has length 114 [2022-01-18 09:49:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:49:57,911 INFO L470 AbstractCegarLoop]: Abstraction has 145802 states and 448944 transitions. [2022-01-18 09:49:57,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:49:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 145802 states and 448944 transitions. [2022-01-18 09:49:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:49:58,537 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:49:58,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:49:58,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-18 09:49:58,538 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-18 09:49:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:49:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1942350612, now seen corresponding path program 12 times [2022-01-18 09:49:58,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:49:58,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416799206] [2022-01-18 09:49:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:49:58,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:49:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:49:59,167 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-18 09:49:59,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:49:59,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416799206] [2022-01-18 09:49:59,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416799206] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:49:59,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:49:59,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:49:59,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920725111] [2022-01-18 09:49:59,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:49:59,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:49:59,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:49:59,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:49:59,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:49:59,169 INFO L87 Difference]: Start difference. First operand 145802 states and 448944 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:50:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:50:09,449 INFO L93 Difference]: Finished difference Result 193954 states and 596256 transitions. [2022-01-18 09:50:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-18 09:50:09,450 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:50:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:50:10,235 INFO L225 Difference]: With dead ends: 193954 [2022-01-18 09:50:10,235 INFO L226 Difference]: Without dead ends: 193954 [2022-01-18 09:50:10,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2261, Invalid=6295, Unknown=0, NotChecked=0, Total=8556 [2022-01-18 09:50:10,236 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 2996 mSDsluCounter, 16115 mSDsCounter, 0 mSdLazyCounter, 5755 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2996 SdHoareTripleChecker+Valid, 17602 SdHoareTripleChecker+Invalid, 5830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 5755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-18 09:50:10,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2996 Valid, 17602 Invalid, 5830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 5755 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-18 09:50:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193954 states. [2022-01-18 09:50:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193954 to 145835. [2022-01-18 09:50:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145835 states, 145831 states have (on average 3.079208124472849) internal successors, (449044), 145834 states have internal predecessors, (449044), 0 states have call successors, (0), 0 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-18 09:50:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145835 states to 145835 states and 449044 transitions. [2022-01-18 09:50:13,782 INFO L78 Accepts]: Start accepts. Automaton has 145835 states and 449044 transitions. Word has length 114 [2022-01-18 09:50:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:50:13,783 INFO L470 AbstractCegarLoop]: Abstraction has 145835 states and 449044 transitions. [2022-01-18 09:50:13,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:50:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 145835 states and 449044 transitions. [2022-01-18 09:50:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:50:13,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:50:13,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:50:13,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-18 09:50:13,916 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-18 09:50:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:50:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash 804485652, now seen corresponding path program 13 times [2022-01-18 09:50:13,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:50:13,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255351903] [2022-01-18 09:50:13,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:50:13,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:50:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:50:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:50:15,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:50:15,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255351903] [2022-01-18 09:50:15,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255351903] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:50:15,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:50:15,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:50:15,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44222064] [2022-01-18 09:50:15,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:50:15,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:50:15,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:50:15,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:50:15,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:50:15,085 INFO L87 Difference]: Start difference. First operand 145835 states and 449044 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:50:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:50:25,403 INFO L93 Difference]: Finished difference Result 196747 states and 604701 transitions. [2022-01-18 09:50:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-18 09:50:25,404 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:50:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:50:25,963 INFO L225 Difference]: With dead ends: 196747 [2022-01-18 09:50:25,964 INFO L226 Difference]: Without dead ends: 196747 [2022-01-18 09:50:25,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2358, Invalid=5652, Unknown=0, NotChecked=0, Total=8010 [2022-01-18 09:50:25,968 INFO L933 BasicCegarLoop]: 1492 mSDtfsCounter, 3242 mSDsluCounter, 12047 mSDsCounter, 0 mSdLazyCounter, 4192 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3242 SdHoareTripleChecker+Valid, 13539 SdHoareTripleChecker+Invalid, 4284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 4192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-18 09:50:25,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3242 Valid, 13539 Invalid, 4284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 4192 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-18 09:50:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196747 states. [2022-01-18 09:50:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196747 to 155155. [2022-01-18 09:50:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155155 states, 155151 states have (on average 3.0788070976016915) internal successors, (477680), 155154 states have internal predecessors, (477680), 0 states have call successors, (0), 0 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-18 09:50:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155155 states to 155155 states and 477680 transitions. [2022-01-18 09:50:29,970 INFO L78 Accepts]: Start accepts. Automaton has 155155 states and 477680 transitions. Word has length 114 [2022-01-18 09:50:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:50:29,971 INFO L470 AbstractCegarLoop]: Abstraction has 155155 states and 477680 transitions. [2022-01-18 09:50:29,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:50:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 155155 states and 477680 transitions. [2022-01-18 09:50:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:50:30,112 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:50:30,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:50:30,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-18 09:50:30,113 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-18 09:50:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:50:30,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1129835852, now seen corresponding path program 14 times [2022-01-18 09:50:30,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:50:30,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279713907] [2022-01-18 09:50:30,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:50:30,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:50:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:50:31,174 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-18 09:50:31,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:50:31,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279713907] [2022-01-18 09:50:31,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279713907] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:50:31,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:50:31,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:50:31,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682989603] [2022-01-18 09:50:31,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:50:31,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:50:31,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:50:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:50:31,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:50:31,176 INFO L87 Difference]: Start difference. First operand 155155 states and 477680 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:50:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:50:38,061 INFO L93 Difference]: Finished difference Result 198292 states and 609546 transitions. [2022-01-18 09:50:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-18 09:50:38,062 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:50:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:50:38,922 INFO L225 Difference]: With dead ends: 198292 [2022-01-18 09:50:38,922 INFO L226 Difference]: Without dead ends: 198292 [2022-01-18 09:50:38,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1377, Invalid=3879, Unknown=0, NotChecked=0, Total=5256 [2022-01-18 09:50:38,923 INFO L933 BasicCegarLoop]: 1086 mSDtfsCounter, 3033 mSDsluCounter, 10560 mSDsCounter, 0 mSdLazyCounter, 3714 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 11646 SdHoareTripleChecker+Invalid, 3778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-18 09:50:38,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3033 Valid, 11646 Invalid, 3778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3714 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-18 09:50:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198292 states. [2022-01-18 09:50:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198292 to 156343. [2022-01-18 09:50:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156343 states, 156339 states have (on average 3.0788159064596807) internal successors, (481339), 156342 states have internal predecessors, (481339), 0 states have call successors, (0), 0 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-18 09:50:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156343 states to 156343 states and 481339 transitions. [2022-01-18 09:50:43,194 INFO L78 Accepts]: Start accepts. Automaton has 156343 states and 481339 transitions. Word has length 114 [2022-01-18 09:50:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:50:43,194 INFO L470 AbstractCegarLoop]: Abstraction has 156343 states and 481339 transitions. [2022-01-18 09:50:43,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:50:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 156343 states and 481339 transitions. [2022-01-18 09:50:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:50:43,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:50:43,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:50:43,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-18 09:50:43,394 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-18 09:50:43,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:50:43,394 INFO L85 PathProgramCache]: Analyzing trace with hash 894659704, now seen corresponding path program 15 times [2022-01-18 09:50:43,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:50:43,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406123108] [2022-01-18 09:50:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:50:43,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:50:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:50:43,962 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-18 09:50:43,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:50:43,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406123108] [2022-01-18 09:50:43,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406123108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:50:43,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:50:43,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:50:43,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648233884] [2022-01-18 09:50:43,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:50:43,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:50:43,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:50:43,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:50:43,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:50:43,963 INFO L87 Difference]: Start difference. First operand 156343 states and 481339 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:50:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:50:51,926 INFO L93 Difference]: Finished difference Result 207565 states and 638174 transitions. [2022-01-18 09:50:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-18 09:50:51,926 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:50:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:50:52,518 INFO L225 Difference]: With dead ends: 207565 [2022-01-18 09:50:52,519 INFO L226 Difference]: Without dead ends: 207565 [2022-01-18 09:50:52,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1492, Invalid=4208, Unknown=0, NotChecked=0, Total=5700 [2022-01-18 09:50:52,519 INFO L933 BasicCegarLoop]: 1147 mSDtfsCounter, 3791 mSDsluCounter, 11761 mSDsCounter, 0 mSdLazyCounter, 4215 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3791 SdHoareTripleChecker+Valid, 12908 SdHoareTripleChecker+Invalid, 4300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:50:52,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3791 Valid, 12908 Invalid, 4300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 4215 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-18 09:50:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207565 states. [2022-01-18 09:50:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207565 to 156541. [2022-01-18 09:50:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156541 states, 156537 states have (on average 3.0789206385710726) internal successors, (481965), 156540 states have internal predecessors, (481965), 0 states have call successors, (0), 0 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-18 09:50:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156541 states to 156541 states and 481965 transitions. [2022-01-18 09:50:57,513 INFO L78 Accepts]: Start accepts. Automaton has 156541 states and 481965 transitions. Word has length 114 [2022-01-18 09:50:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:50:57,514 INFO L470 AbstractCegarLoop]: Abstraction has 156541 states and 481965 transitions. [2022-01-18 09:50:57,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:50:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 156541 states and 481965 transitions. [2022-01-18 09:50:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:50:57,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:50:57,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:50:57,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-18 09:50:57,664 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-18 09:50:57,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:50:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash -460843800, now seen corresponding path program 16 times [2022-01-18 09:50:57,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:50:57,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319991618] [2022-01-18 09:50:57,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:50:57,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:50:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:50:58,205 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-18 09:50:58,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:50:58,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319991618] [2022-01-18 09:50:58,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319991618] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:50:58,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:50:58,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:50:58,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697446880] [2022-01-18 09:50:58,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:50:58,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:50:58,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:50:58,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:50:58,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:50:58,207 INFO L87 Difference]: Start difference. First operand 156541 states and 481965 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:51:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:51:06,920 INFO L93 Difference]: Finished difference Result 206674 states and 635448 transitions. [2022-01-18 09:51:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-01-18 09:51:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:51:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:51:07,825 INFO L225 Difference]: With dead ends: 206674 [2022-01-18 09:51:07,825 INFO L226 Difference]: Without dead ends: 206674 [2022-01-18 09:51:07,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1746, Invalid=4896, Unknown=0, NotChecked=0, Total=6642 [2022-01-18 09:51:07,826 INFO L933 BasicCegarLoop]: 1271 mSDtfsCounter, 3148 mSDsluCounter, 11723 mSDsCounter, 0 mSdLazyCounter, 4091 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3148 SdHoareTripleChecker+Valid, 12994 SdHoareTripleChecker+Invalid, 4166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 4091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:51:07,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3148 Valid, 12994 Invalid, 4166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4091 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-18 09:51:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206674 states. [2022-01-18 09:51:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206674 to 156904. [2022-01-18 09:51:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156904 states, 156900 states have (on average 3.079018483110261) internal successors, (483098), 156903 states have internal predecessors, (483098), 0 states have call successors, (0), 0 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-18 09:51:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156904 states to 156904 states and 483098 transitions. [2022-01-18 09:51:12,209 INFO L78 Accepts]: Start accepts. Automaton has 156904 states and 483098 transitions. Word has length 114 [2022-01-18 09:51:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:51:12,210 INFO L470 AbstractCegarLoop]: Abstraction has 156904 states and 483098 transitions. [2022-01-18 09:51:12,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:51:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 156904 states and 483098 transitions. [2022-01-18 09:51:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:51:12,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:51:12,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:51:12,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-18 09:51:12,382 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-18 09:51:12,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:51:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2022306384, now seen corresponding path program 17 times [2022-01-18 09:51:12,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:51:12,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480732691] [2022-01-18 09:51:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:51:12,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:51:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:51:12,935 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-18 09:51:12,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:51:12,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480732691] [2022-01-18 09:51:12,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480732691] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:51:12,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:51:12,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:51:12,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878927306] [2022-01-18 09:51:12,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:51:12,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:51:12,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:51:12,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:51:12,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:51:12,936 INFO L87 Difference]: Start difference. First operand 156904 states and 483098 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:51:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:51:22,561 INFO L93 Difference]: Finished difference Result 205816 states and 632716 transitions. [2022-01-18 09:51:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-18 09:51:22,562 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:51:22,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:51:23,153 INFO L225 Difference]: With dead ends: 205816 [2022-01-18 09:51:23,153 INFO L226 Difference]: Without dead ends: 205816 [2022-01-18 09:51:23,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2027, Invalid=5629, Unknown=0, NotChecked=0, Total=7656 [2022-01-18 09:51:23,154 INFO L933 BasicCegarLoop]: 1377 mSDtfsCounter, 2950 mSDsluCounter, 12055 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2950 SdHoareTripleChecker+Valid, 13432 SdHoareTripleChecker+Invalid, 4339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:51:23,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2950 Valid, 13432 Invalid, 4339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 4265 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-18 09:51:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205816 states. [2022-01-18 09:51:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205816 to 156937. [2022-01-18 09:51:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156937 states, 156933 states have (on average 3.079008239184875) internal successors, (483198), 156936 states have internal predecessors, (483198), 0 states have call successors, (0), 0 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-18 09:51:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156937 states to 156937 states and 483198 transitions. [2022-01-18 09:51:27,342 INFO L78 Accepts]: Start accepts. Automaton has 156937 states and 483198 transitions. Word has length 114 [2022-01-18 09:51:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:51:27,342 INFO L470 AbstractCegarLoop]: Abstraction has 156937 states and 483198 transitions. [2022-01-18 09:51:27,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:51:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 156937 states and 483198 transitions. [2022-01-18 09:51:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:51:27,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:51:27,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:51:27,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-18 09:51:27,486 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-18 09:51:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:51:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash 724529880, now seen corresponding path program 18 times [2022-01-18 09:51:27,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:51:27,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362742012] [2022-01-18 09:51:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:51:27,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:51:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:51:28,652 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-18 09:51:28,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:51:28,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362742012] [2022-01-18 09:51:28,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362742012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:51:28,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:51:28,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:51:28,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788016156] [2022-01-18 09:51:28,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:51:28,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:51:28,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:51:28,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:51:28,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:51:28,654 INFO L87 Difference]: Start difference. First operand 156937 states and 483198 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:51:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:51:38,815 INFO L93 Difference]: Finished difference Result 200170 states and 615675 transitions. [2022-01-18 09:51:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-18 09:51:38,815 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:51:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:51:39,381 INFO L225 Difference]: With dead ends: 200170 [2022-01-18 09:51:39,381 INFO L226 Difference]: Without dead ends: 200170 [2022-01-18 09:51:39,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2414, Invalid=5776, Unknown=0, NotChecked=0, Total=8190 [2022-01-18 09:51:39,382 INFO L933 BasicCegarLoop]: 1530 mSDtfsCounter, 3090 mSDsluCounter, 10849 mSDsCounter, 0 mSdLazyCounter, 3762 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3090 SdHoareTripleChecker+Valid, 12379 SdHoareTripleChecker+Invalid, 3853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:51:39,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3090 Valid, 12379 Invalid, 3853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3762 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-18 09:51:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200170 states. [2022-01-18 09:51:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200170 to 144653. [2022-01-18 09:51:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144653 states, 144649 states have (on average 3.0793023111117255) internal successors, (445418), 144652 states have internal predecessors, (445418), 0 states have call successors, (0), 0 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-18 09:51:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144653 states to 144653 states and 445418 transitions. [2022-01-18 09:51:43,430 INFO L78 Accepts]: Start accepts. Automaton has 144653 states and 445418 transitions. Word has length 114 [2022-01-18 09:51:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:51:43,430 INFO L470 AbstractCegarLoop]: Abstraction has 144653 states and 445418 transitions. [2022-01-18 09:51:43,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:51:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 144653 states and 445418 transitions. [2022-01-18 09:51:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:51:43,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:51:43,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:51:43,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-18 09:51:43,561 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-18 09:51:43,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:51:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1771845934, now seen corresponding path program 19 times [2022-01-18 09:51:43,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:51:43,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251124483] [2022-01-18 09:51:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:51:43,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:51:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:51:44,239 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-18 09:51:44,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:51:44,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251124483] [2022-01-18 09:51:44,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251124483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:51:44,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:51:44,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-18 09:51:44,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088503093] [2022-01-18 09:51:44,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:51:44,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-18 09:51:44,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:51:44,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-18 09:51:44,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2022-01-18 09:51:44,241 INFO L87 Difference]: Start difference. First operand 144653 states and 445418 transitions. Second operand has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:51:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:51:52,749 INFO L93 Difference]: Finished difference Result 186533 states and 573473 transitions. [2022-01-18 09:51:52,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-18 09:51:52,749 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:51:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:51:53,511 INFO L225 Difference]: With dead ends: 186533 [2022-01-18 09:51:53,512 INFO L226 Difference]: Without dead ends: 186533 [2022-01-18 09:51:53,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1631, Invalid=4531, Unknown=0, NotChecked=0, Total=6162 [2022-01-18 09:51:53,512 INFO L933 BasicCegarLoop]: 1201 mSDtfsCounter, 3621 mSDsluCounter, 9321 mSDsCounter, 0 mSdLazyCounter, 3244 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3621 SdHoareTripleChecker+Valid, 10522 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:51:53,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3621 Valid, 10522 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 3244 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-18 09:51:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186533 states. [2022-01-18 09:51:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186533 to 145860. [2022-01-18 09:51:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145860 states, 145856 states have (on average 3.0791396994295743) internal successors, (449111), 145859 states have internal predecessors, (449111), 0 states have call successors, (0), 0 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-18 09:51:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145860 states to 145860 states and 449111 transitions. [2022-01-18 09:51:57,077 INFO L78 Accepts]: Start accepts. Automaton has 145860 states and 449111 transitions. Word has length 114 [2022-01-18 09:51:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:51:57,077 INFO L470 AbstractCegarLoop]: Abstraction has 145860 states and 449111 transitions. [2022-01-18 09:51:57,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:51:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 145860 states and 449111 transitions. [2022-01-18 09:51:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:51:57,208 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:51:57,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:51:57,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-18 09:51:57,209 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-18 09:51:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:51:57,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1466241108, now seen corresponding path program 20 times [2022-01-18 09:51:57,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:51:57,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159744870] [2022-01-18 09:51:57,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:51:57,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:51:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:51:57,784 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-18 09:51:57,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:51:57,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159744870] [2022-01-18 09:51:57,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159744870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:51:57,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:51:57,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:51:57,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153160269] [2022-01-18 09:51:57,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:51:57,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:51:57,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:51:57,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:51:57,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:51:57,785 INFO L87 Difference]: Start difference. First operand 145860 states and 449111 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:52:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:52:04,790 INFO L93 Difference]: Finished difference Result 186750 states and 574166 transitions. [2022-01-18 09:52:04,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-18 09:52:04,791 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:52:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:52:05,277 INFO L225 Difference]: With dead ends: 186750 [2022-01-18 09:52:05,277 INFO L226 Difference]: Without dead ends: 186750 [2022-01-18 09:52:05,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1282, Invalid=3688, Unknown=0, NotChecked=0, Total=4970 [2022-01-18 09:52:05,278 INFO L933 BasicCegarLoop]: 1037 mSDtfsCounter, 2880 mSDsluCounter, 10987 mSDsCounter, 0 mSdLazyCounter, 3883 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2880 SdHoareTripleChecker+Valid, 12024 SdHoareTripleChecker+Invalid, 3947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:52:05,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2880 Valid, 12024 Invalid, 3947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3883 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-18 09:52:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186750 states. [2022-01-18 09:52:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186750 to 148196. [2022-01-18 09:52:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148196 states, 148192 states have (on average 3.081009771107752) internal successors, (456581), 148195 states have internal predecessors, (456581), 0 states have call successors, (0), 0 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-18 09:52:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148196 states to 148196 states and 456581 transitions. [2022-01-18 09:52:09,212 INFO L78 Accepts]: Start accepts. Automaton has 148196 states and 456581 transitions. Word has length 114 [2022-01-18 09:52:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:52:09,212 INFO L470 AbstractCegarLoop]: Abstraction has 148196 states and 456581 transitions. [2022-01-18 09:52:09,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:52:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 148196 states and 456581 transitions. [2022-01-18 09:52:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:52:09,347 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:52:09,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:52:09,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-18 09:52:09,347 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-18 09:52:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:52:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1167617858, now seen corresponding path program 21 times [2022-01-18 09:52:09,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:52:09,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130986503] [2022-01-18 09:52:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:52:09,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:52:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:52:09,898 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-18 09:52:09,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:52:09,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130986503] [2022-01-18 09:52:09,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130986503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:52:09,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:52:09,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:52:09,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185991951] [2022-01-18 09:52:09,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:52:09,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:52:09,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:52:09,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:52:09,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:52:09,899 INFO L87 Difference]: Start difference. First operand 148196 states and 456581 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:52:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:52:17,965 INFO L93 Difference]: Finished difference Result 191462 states and 588908 transitions. [2022-01-18 09:52:17,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-18 09:52:17,966 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:52:17,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:52:18,480 INFO L225 Difference]: With dead ends: 191462 [2022-01-18 09:52:18,480 INFO L226 Difference]: Without dead ends: 191462 [2022-01-18 09:52:18,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1527, Invalid=4325, Unknown=0, NotChecked=0, Total=5852 [2022-01-18 09:52:18,481 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 3215 mSDsluCounter, 12491 mSDsCounter, 0 mSdLazyCounter, 4444 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3215 SdHoareTripleChecker+Valid, 13652 SdHoareTripleChecker+Invalid, 4521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:52:18,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3215 Valid, 13652 Invalid, 4521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4444 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-18 09:52:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191462 states. [2022-01-18 09:52:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191462 to 148559. [2022-01-18 09:52:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148559 states, 148555 states have (on average 3.0811080071354042) internal successors, (457714), 148558 states have internal predecessors, (457714), 0 states have call successors, (0), 0 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-18 09:52:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148559 states to 148559 states and 457714 transitions. [2022-01-18 09:52:22,459 INFO L78 Accepts]: Start accepts. Automaton has 148559 states and 457714 transitions. Word has length 114 [2022-01-18 09:52:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:52:22,459 INFO L470 AbstractCegarLoop]: Abstraction has 148559 states and 457714 transitions. [2022-01-18 09:52:22,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:52:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 148559 states and 457714 transitions. [2022-01-18 09:52:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:52:22,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:52:22,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:52:22,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-18 09:52:22,596 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-18 09:52:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:52:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash -393844726, now seen corresponding path program 22 times [2022-01-18 09:52:22,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:52:22,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132389948] [2022-01-18 09:52:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:52:22,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:52:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:52:23,177 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-18 09:52:23,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:52:23,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132389948] [2022-01-18 09:52:23,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132389948] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:52:23,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:52:23,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:52:23,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670791939] [2022-01-18 09:52:23,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:52:23,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:52:23,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:52:23,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:52:23,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:52:23,178 INFO L87 Difference]: Start difference. First operand 148559 states and 457714 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:52:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:52:32,328 INFO L93 Difference]: Finished difference Result 190604 states and 586176 transitions. [2022-01-18 09:52:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-18 09:52:32,329 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:52:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:52:32,837 INFO L225 Difference]: With dead ends: 190604 [2022-01-18 09:52:32,838 INFO L226 Difference]: Without dead ends: 190604 [2022-01-18 09:52:32,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1799, Invalid=5007, Unknown=0, NotChecked=0, Total=6806 [2022-01-18 09:52:32,838 INFO L933 BasicCegarLoop]: 1267 mSDtfsCounter, 3563 mSDsluCounter, 11384 mSDsCounter, 0 mSdLazyCounter, 4066 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3563 SdHoareTripleChecker+Valid, 12651 SdHoareTripleChecker+Invalid, 4159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:52:32,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3563 Valid, 12651 Invalid, 4159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4066 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-18 09:52:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190604 states. [2022-01-18 09:52:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190604 to 148592. [2022-01-18 09:52:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148592 states, 148588 states have (on average 3.081096723826958) internal successors, (457814), 148591 states have internal predecessors, (457814), 0 states have call successors, (0), 0 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-18 09:52:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148592 states to 148592 states and 457814 transitions. [2022-01-18 09:52:36,550 INFO L78 Accepts]: Start accepts. Automaton has 148592 states and 457814 transitions. Word has length 114 [2022-01-18 09:52:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:52:36,551 INFO L470 AbstractCegarLoop]: Abstraction has 148592 states and 457814 transitions. [2022-01-18 09:52:36,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:52:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 148592 states and 457814 transitions. [2022-01-18 09:52:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:52:37,238 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:52:37,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:52:37,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-18 09:52:37,251 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-18 09:52:37,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:52:37,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1941975758, now seen corresponding path program 23 times [2022-01-18 09:52:37,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:52:37,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868320630] [2022-01-18 09:52:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:52:37,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:52:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:52:37,947 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-18 09:52:37,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:52:37,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868320630] [2022-01-18 09:52:37,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868320630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:52:37,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:52:37,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:52:37,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665481935] [2022-01-18 09:52:37,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:52:37,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:52:37,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:52:37,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:52:37,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:52:37,949 INFO L87 Difference]: Start difference. First operand 148592 states and 457814 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:52:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:52:48,564 INFO L93 Difference]: Finished difference Result 184232 states and 566935 transitions. [2022-01-18 09:52:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-18 09:52:48,565 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:52:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:52:49,047 INFO L225 Difference]: With dead ends: 184232 [2022-01-18 09:52:49,047 INFO L226 Difference]: Without dead ends: 184232 [2022-01-18 09:52:49,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2466, Invalid=5906, Unknown=0, NotChecked=0, Total=8372 [2022-01-18 09:52:49,048 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 2895 mSDsluCounter, 12414 mSDsCounter, 0 mSdLazyCounter, 4350 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2895 SdHoareTripleChecker+Valid, 13973 SdHoareTripleChecker+Invalid, 4440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 4350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:52:49,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2895 Valid, 13973 Invalid, 4440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 4350 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-18 09:52:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184232 states. [2022-01-18 09:52:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184232 to 145429. [2022-01-18 09:52:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145429 states, 145425 states have (on average 3.079635550971291) internal successors, (447856), 145428 states have internal predecessors, (447856), 0 states have call successors, (0), 0 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-18 09:52:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145429 states to 145429 states and 447856 transitions. [2022-01-18 09:52:52,935 INFO L78 Accepts]: Start accepts. Automaton has 145429 states and 447856 transitions. Word has length 114 [2022-01-18 09:52:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:52:52,935 INFO L470 AbstractCegarLoop]: Abstraction has 145429 states and 447856 transitions. [2022-01-18 09:52:52,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:52:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 145429 states and 447856 transitions. [2022-01-18 09:52:53,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:52:53,066 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:52:53,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:52:53,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-18 09:52:53,066 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-18 09:52:53,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:52:53,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1860149644, now seen corresponding path program 24 times [2022-01-18 09:52:53,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:52:53,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017695936] [2022-01-18 09:52:53,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:52:53,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:52:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:52:53,547 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-18 09:52:53,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:52:53,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017695936] [2022-01-18 09:52:53,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017695936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:52:53,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:52:53,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 09:52:53,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766947420] [2022-01-18 09:52:53,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:52:53,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 09:52:53,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:52:53,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 09:52:53,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2022-01-18 09:52:53,549 INFO L87 Difference]: Start difference. First operand 145429 states and 447856 transitions. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:52:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:52:58,736 INFO L93 Difference]: Finished difference Result 182356 states and 561013 transitions. [2022-01-18 09:52:58,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-18 09:52:58,737 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:52:58,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:52:59,232 INFO L225 Difference]: With dead ends: 182356 [2022-01-18 09:52:59,233 INFO L226 Difference]: Without dead ends: 182356 [2022-01-18 09:52:59,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-01-18 09:52:59,233 INFO L933 BasicCegarLoop]: 838 mSDtfsCounter, 2452 mSDsluCounter, 8918 mSDsCounter, 0 mSdLazyCounter, 3158 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2452 SdHoareTripleChecker+Valid, 9756 SdHoareTripleChecker+Invalid, 3233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:52:59,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2452 Valid, 9756 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 3158 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-18 09:52:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182356 states. [2022-01-18 09:53:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182356 to 152161. [2022-01-18 09:53:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152161 states, 152157 states have (on average 3.081573637755739) internal successors, (468883), 152160 states have internal predecessors, (468883), 0 states have call successors, (0), 0 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-18 09:53:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152161 states to 152161 states and 468883 transitions. [2022-01-18 09:53:02,987 INFO L78 Accepts]: Start accepts. Automaton has 152161 states and 468883 transitions. Word has length 114 [2022-01-18 09:53:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:53:02,988 INFO L470 AbstractCegarLoop]: Abstraction has 152161 states and 468883 transitions. [2022-01-18 09:53:02,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:53:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 152161 states and 468883 transitions. [2022-01-18 09:53:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:53:03,715 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:53:03,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:53:03,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-18 09:53:03,715 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-18 09:53:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:53:03,716 INFO L85 PathProgramCache]: Analyzing trace with hash 873355068, now seen corresponding path program 25 times [2022-01-18 09:53:03,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:53:03,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235018029] [2022-01-18 09:53:03,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:53:03,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:53:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:53:04,291 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-18 09:53:04,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:53:04,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235018029] [2022-01-18 09:53:04,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235018029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:53:04,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:53:04,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:53:04,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304714189] [2022-01-18 09:53:04,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:53:04,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:53:04,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:53:04,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:53:04,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:53:04,292 INFO L87 Difference]: Start difference. First operand 152161 states and 468883 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:53:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:53:11,679 INFO L93 Difference]: Finished difference Result 189715 states and 583874 transitions. [2022-01-18 09:53:11,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-18 09:53:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:53:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:53:12,196 INFO L225 Difference]: With dead ends: 189715 [2022-01-18 09:53:12,197 INFO L226 Difference]: Without dead ends: 189715 [2022-01-18 09:53:12,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1337, Invalid=3919, Unknown=0, NotChecked=0, Total=5256 [2022-01-18 09:53:12,197 INFO L933 BasicCegarLoop]: 1033 mSDtfsCounter, 3048 mSDsluCounter, 11728 mSDsCounter, 0 mSdLazyCounter, 4272 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 12761 SdHoareTripleChecker+Invalid, 4352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:53:12,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3048 Valid, 12761 Invalid, 4352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4272 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-18 09:53:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189715 states. [2022-01-18 09:53:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189715 to 152326. [2022-01-18 09:53:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152326 states, 152322 states have (on average 3.0815180998148657) internal successors, (469383), 152325 states have internal predecessors, (469383), 0 states have call successors, (0), 0 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-18 09:53:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152326 states to 152326 states and 469383 transitions. [2022-01-18 09:53:15,939 INFO L78 Accepts]: Start accepts. Automaton has 152326 states and 469383 transitions. Word has length 114 [2022-01-18 09:53:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:53:15,939 INFO L470 AbstractCegarLoop]: Abstraction has 152326 states and 469383 transitions. [2022-01-18 09:53:15,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:53:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 152326 states and 469383 transitions. [2022-01-18 09:53:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:53:16,617 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:53:16,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:53:16,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-18 09:53:16,618 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-18 09:53:16,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:53:16,618 INFO L85 PathProgramCache]: Analyzing trace with hash -674775964, now seen corresponding path program 26 times [2022-01-18 09:53:16,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:53:16,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098298087] [2022-01-18 09:53:16,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:53:16,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:53:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:53:17,387 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-18 09:53:17,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:53:17,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098298087] [2022-01-18 09:53:17,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098298087] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:53:17,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:53:17,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:53:17,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894807189] [2022-01-18 09:53:17,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:53:17,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:53:17,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:53:17,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:53:17,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:53:17,388 INFO L87 Difference]: Start difference. First operand 152326 states and 469383 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:53:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:53:29,275 INFO L93 Difference]: Finished difference Result 177835 states and 547323 transitions. [2022-01-18 09:53:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-18 09:53:29,276 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:53:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:53:29,733 INFO L225 Difference]: With dead ends: 177835 [2022-01-18 09:53:29,733 INFO L226 Difference]: Without dead ends: 177835 [2022-01-18 09:53:29,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2581, Invalid=6349, Unknown=0, NotChecked=0, Total=8930 [2022-01-18 09:53:29,734 INFO L933 BasicCegarLoop]: 1618 mSDtfsCounter, 3236 mSDsluCounter, 15515 mSDsCounter, 0 mSdLazyCounter, 5654 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3236 SdHoareTripleChecker+Valid, 17133 SdHoareTripleChecker+Invalid, 5757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 5654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:53:29,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3236 Valid, 17133 Invalid, 5757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 5654 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-18 09:53:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177835 states. [2022-01-18 09:53:32,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177835 to 146518. [2022-01-18 09:53:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146518 states, 146514 states have (on average 3.079944578675075) internal successors, (451255), 146517 states have internal predecessors, (451255), 0 states have call successors, (0), 0 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-18 09:53:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146518 states to 146518 states and 451255 transitions. [2022-01-18 09:53:33,338 INFO L78 Accepts]: Start accepts. Automaton has 146518 states and 451255 transitions. Word has length 114 [2022-01-18 09:53:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:53:33,338 INFO L470 AbstractCegarLoop]: Abstraction has 146518 states and 451255 transitions. [2022-01-18 09:53:33,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:53:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 146518 states and 451255 transitions. [2022-01-18 09:53:33,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:53:33,474 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:53:33,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:53:33,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-18 09:53:33,475 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-18 09:53:33,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:53:33,475 INFO L85 PathProgramCache]: Analyzing trace with hash -939404236, now seen corresponding path program 27 times [2022-01-18 09:53:33,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:53:33,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226702435] [2022-01-18 09:53:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:53:33,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:53:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:53:34,514 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-18 09:53:34,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:53:34,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226702435] [2022-01-18 09:53:34,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226702435] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:53:34,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:53:34,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:53:34,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484476366] [2022-01-18 09:53:34,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:53:34,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:53:34,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:53:34,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:53:34,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:53:34,516 INFO L87 Difference]: Start difference. First operand 146518 states and 451255 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:53:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:53:39,686 INFO L93 Difference]: Finished difference Result 175723 states and 540154 transitions. [2022-01-18 09:53:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-18 09:53:39,686 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:53:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:53:40,152 INFO L225 Difference]: With dead ends: 175723 [2022-01-18 09:53:40,152 INFO L226 Difference]: Without dead ends: 175723 [2022-01-18 09:53:40,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=874, Invalid=3032, Unknown=0, NotChecked=0, Total=3906 [2022-01-18 09:53:40,153 INFO L933 BasicCegarLoop]: 818 mSDtfsCounter, 3052 mSDsluCounter, 11464 mSDsCounter, 0 mSdLazyCounter, 4011 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3052 SdHoareTripleChecker+Valid, 12282 SdHoareTripleChecker+Invalid, 4091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:53:40,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3052 Valid, 12282 Invalid, 4091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4011 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-18 09:53:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175723 states. [2022-01-18 09:53:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175723 to 147112. [2022-01-18 09:53:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147112 states, 147108 states have (on average 3.079744133561737) internal successors, (453055), 147111 states have internal predecessors, (453055), 0 states have call successors, (0), 0 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-18 09:53:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147112 states to 147112 states and 453055 transitions. [2022-01-18 09:53:44,359 INFO L78 Accepts]: Start accepts. Automaton has 147112 states and 453055 transitions. Word has length 114 [2022-01-18 09:53:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:53:44,359 INFO L470 AbstractCegarLoop]: Abstraction has 147112 states and 453055 transitions. [2022-01-18 09:53:44,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:53:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 147112 states and 453055 transitions. [2022-01-18 09:53:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:53:44,517 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:53:44,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:53:44,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-18 09:53:44,518 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-18 09:53:44,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:53:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1807432028, now seen corresponding path program 28 times [2022-01-18 09:53:44,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:53:44,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40374172] [2022-01-18 09:53:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:53:44,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:53:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:53:45,172 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-18 09:53:45,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:53:45,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40374172] [2022-01-18 09:53:45,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40374172] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:53:45,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:53:45,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:53:45,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344085257] [2022-01-18 09:53:45,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:53:45,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:53:45,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:53:45,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:53:45,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:53:45,174 INFO L87 Difference]: Start difference. First operand 147112 states and 453055 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:53:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:53:57,354 INFO L93 Difference]: Finished difference Result 168364 states and 517567 transitions. [2022-01-18 09:53:57,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-01-18 09:53:57,355 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:53:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:53:57,788 INFO L225 Difference]: With dead ends: 168364 [2022-01-18 09:53:57,788 INFO L226 Difference]: Without dead ends: 168364 [2022-01-18 09:53:57,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1405 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2623, Invalid=6497, Unknown=0, NotChecked=0, Total=9120 [2022-01-18 09:53:57,789 INFO L933 BasicCegarLoop]: 1677 mSDtfsCounter, 3415 mSDsluCounter, 16771 mSDsCounter, 0 mSdLazyCounter, 6178 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3415 SdHoareTripleChecker+Valid, 18448 SdHoareTripleChecker+Invalid, 6280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 6178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:53:57,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3415 Valid, 18448 Invalid, 6280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 6178 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-18 09:53:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168364 states. [2022-01-18 09:54:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168364 to 145285. [2022-01-18 09:54:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145285 states, 145281 states have (on average 3.0796387690062708) internal successors, (447413), 145284 states have internal predecessors, (447413), 0 states have call successors, (0), 0 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-18 09:54:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145285 states to 145285 states and 447413 transitions. [2022-01-18 09:54:01,372 INFO L78 Accepts]: Start accepts. Automaton has 145285 states and 447413 transitions. Word has length 114 [2022-01-18 09:54:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:54:01,373 INFO L470 AbstractCegarLoop]: Abstraction has 145285 states and 447413 transitions. [2022-01-18 09:54:01,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:54:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 145285 states and 447413 transitions. [2022-01-18 09:54:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:54:01,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:54:01,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:54:01,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-18 09:54:01,506 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-18 09:54:01,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:54:01,506 INFO L85 PathProgramCache]: Analyzing trace with hash -825115224, now seen corresponding path program 29 times [2022-01-18 09:54:01,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:54:01,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792222477] [2022-01-18 09:54:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:54:01,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:54:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:54:02,583 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-18 09:54:02,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:54:02,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792222477] [2022-01-18 09:54:02,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792222477] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:54:02,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:54:02,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:54:02,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817709697] [2022-01-18 09:54:02,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:54:02,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:54:02,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:54:02,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:54:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:54:02,585 INFO L87 Difference]: Start difference. First operand 145285 states and 447413 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:54:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:54:10,067 INFO L93 Difference]: Finished difference Result 216438 states and 665741 transitions. [2022-01-18 09:54:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-18 09:54:10,075 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:54:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:54:10,730 INFO L225 Difference]: With dead ends: 216438 [2022-01-18 09:54:10,730 INFO L226 Difference]: Without dead ends: 216438 [2022-01-18 09:54:10,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-01-18 09:54:10,731 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 3244 mSDsluCounter, 10416 mSDsCounter, 0 mSdLazyCounter, 3764 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3244 SdHoareTripleChecker+Valid, 11551 SdHoareTripleChecker+Invalid, 3826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-18 09:54:10,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3244 Valid, 11551 Invalid, 3826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3764 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-18 09:54:11,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216438 states. [2022-01-18 09:54:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216438 to 146902. [2022-01-18 09:54:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146902 states, 146898 states have (on average 3.079497338289153) internal successors, (452372), 146901 states have internal predecessors, (452372), 0 states have call successors, (0), 0 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-18 09:54:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146902 states to 146902 states and 452372 transitions. [2022-01-18 09:54:14,617 INFO L78 Accepts]: Start accepts. Automaton has 146902 states and 452372 transitions. Word has length 114 [2022-01-18 09:54:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:54:14,618 INFO L470 AbstractCegarLoop]: Abstraction has 146902 states and 452372 transitions. [2022-01-18 09:54:14,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:54:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 146902 states and 452372 transitions. [2022-01-18 09:54:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:54:15,262 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:54:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:54:15,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-18 09:54:15,262 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-18 09:54:15,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:54:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1488903994, now seen corresponding path program 30 times [2022-01-18 09:54:15,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:54:15,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847483443] [2022-01-18 09:54:15,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:54:15,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:54:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:54:15,890 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-18 09:54:15,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:54:15,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847483443] [2022-01-18 09:54:15,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847483443] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:54:15,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:54:15,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:54:15,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219228117] [2022-01-18 09:54:15,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:54:15,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:54:15,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:54:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:54:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:54:15,891 INFO L87 Difference]: Start difference. First operand 146902 states and 452372 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:54:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:54:24,310 INFO L93 Difference]: Finished difference Result 234522 states and 721482 transitions. [2022-01-18 09:54:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-18 09:54:24,310 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:54:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:54:24,989 INFO L225 Difference]: With dead ends: 234522 [2022-01-18 09:54:24,989 INFO L226 Difference]: Without dead ends: 234522 [2022-01-18 09:54:24,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1587, Invalid=4419, Unknown=0, NotChecked=0, Total=6006 [2022-01-18 09:54:24,990 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 3745 mSDsluCounter, 12178 mSDsCounter, 0 mSdLazyCounter, 4520 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3745 SdHoareTripleChecker+Valid, 13374 SdHoareTripleChecker+Invalid, 4600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:54:24,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3745 Valid, 13374 Invalid, 4600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4520 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-18 09:54:25,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234522 states. [2022-01-18 09:54:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234522 to 146935. [2022-01-18 09:54:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146935 states, 146931 states have (on average 3.0794862894828183) internal successors, (452472), 146934 states have internal predecessors, (452472), 0 states have call successors, (0), 0 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-18 09:54:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146935 states to 146935 states and 452472 transitions. [2022-01-18 09:54:29,692 INFO L78 Accepts]: Start accepts. Automaton has 146935 states and 452472 transitions. Word has length 114 [2022-01-18 09:54:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:54:29,692 INFO L470 AbstractCegarLoop]: Abstraction has 146935 states and 452472 transitions. [2022-01-18 09:54:29,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:54:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 146935 states and 452472 transitions. [2022-01-18 09:54:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:54:29,827 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:54:29,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:54:29,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-18 09:54:29,828 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-18 09:54:29,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:54:29,828 INFO L85 PathProgramCache]: Analyzing trace with hash 535591562, now seen corresponding path program 31 times [2022-01-18 09:54:29,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:54:29,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951950794] [2022-01-18 09:54:29,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:54:29,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:54:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:54:30,383 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-18 09:54:30,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:54:30,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951950794] [2022-01-18 09:54:30,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951950794] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:54:30,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:54:30,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:54:30,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828032978] [2022-01-18 09:54:30,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:54:30,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:54:30,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:54:30,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:54:30,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:54:30,384 INFO L87 Difference]: Start difference. First operand 146935 states and 452472 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:54:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:54:39,128 INFO L93 Difference]: Finished difference Result 233067 states and 717071 transitions. [2022-01-18 09:54:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-01-18 09:54:39,128 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:54:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:54:39,910 INFO L225 Difference]: With dead ends: 233067 [2022-01-18 09:54:39,910 INFO L226 Difference]: Without dead ends: 233067 [2022-01-18 09:54:39,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1708, Invalid=4772, Unknown=0, NotChecked=0, Total=6480 [2022-01-18 09:54:39,911 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 3324 mSDsluCounter, 12798 mSDsCounter, 0 mSdLazyCounter, 4700 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3324 SdHoareTripleChecker+Valid, 14055 SdHoareTripleChecker+Invalid, 4770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:54:39,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3324 Valid, 14055 Invalid, 4770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4700 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-18 09:54:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233067 states. [2022-01-18 09:54:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233067 to 147133. [2022-01-18 09:54:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147133 states, 147129 states have (on average 3.0795968163992145) internal successors, (453098), 147132 states have internal predecessors, (453098), 0 states have call successors, (0), 0 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-18 09:54:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147133 states to 147133 states and 453098 transitions. [2022-01-18 09:54:44,532 INFO L78 Accepts]: Start accepts. Automaton has 147133 states and 453098 transitions. Word has length 114 [2022-01-18 09:54:44,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:54:44,533 INFO L470 AbstractCegarLoop]: Abstraction has 147133 states and 453098 transitions. [2022-01-18 09:54:44,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:54:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 147133 states and 453098 transitions. [2022-01-18 09:54:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:54:44,672 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:54:44,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:54:44,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-18 09:54:44,672 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-18 09:54:44,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:54:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash -819911942, now seen corresponding path program 32 times [2022-01-18 09:54:44,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:54:44,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800428298] [2022-01-18 09:54:44,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:54:44,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:54:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:54:45,144 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-18 09:54:45,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:54:45,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800428298] [2022-01-18 09:54:45,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800428298] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:54:45,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:54:45,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 09:54:45,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849368221] [2022-01-18 09:54:45,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:54:45,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 09:54:45,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:54:45,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 09:54:45,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-18 09:54:45,145 INFO L87 Difference]: Start difference. First operand 147133 states and 453098 transitions. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:54:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:54:53,651 INFO L93 Difference]: Finished difference Result 229602 states and 706248 transitions. [2022-01-18 09:54:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-18 09:54:53,651 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:54:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:54:54,617 INFO L225 Difference]: With dead ends: 229602 [2022-01-18 09:54:54,618 INFO L226 Difference]: Without dead ends: 229602 [2022-01-18 09:54:54,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1587, Invalid=3815, Unknown=0, NotChecked=0, Total=5402 [2022-01-18 09:54:54,618 INFO L933 BasicCegarLoop]: 1292 mSDtfsCounter, 2689 mSDsluCounter, 11509 mSDsCounter, 0 mSdLazyCounter, 4229 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2689 SdHoareTripleChecker+Valid, 12801 SdHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:54:54,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2689 Valid, 12801 Invalid, 4306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4229 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-18 09:54:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229602 states. [2022-01-18 09:54:57,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229602 to 148651. [2022-01-18 09:54:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148651 states, 148647 states have (on average 3.0801092521207964) internal successors, (457849), 148650 states have internal predecessors, (457849), 0 states have call successors, (0), 0 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-18 09:54:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148651 states to 148651 states and 457849 transitions. [2022-01-18 09:54:58,475 INFO L78 Accepts]: Start accepts. Automaton has 148651 states and 457849 transitions. Word has length 114 [2022-01-18 09:54:58,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:54:58,476 INFO L470 AbstractCegarLoop]: Abstraction has 148651 states and 457849 transitions. [2022-01-18 09:54:58,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:54:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 148651 states and 457849 transitions. [2022-01-18 09:54:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:54:58,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:54:58,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:54:58,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-18 09:54:58,612 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-18 09:54:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:54:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1913592770, now seen corresponding path program 33 times [2022-01-18 09:54:58,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:54:58,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34323420] [2022-01-18 09:54:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:54:58,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:54:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:54:59,619 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-18 09:54:59,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:54:59,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34323420] [2022-01-18 09:54:59,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34323420] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:54:59,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:54:59,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:54:59,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852691970] [2022-01-18 09:54:59,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:54:59,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:54:59,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:54:59,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:54:59,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:54:59,620 INFO L87 Difference]: Start difference. First operand 148651 states and 457849 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:55:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:55:09,902 INFO L93 Difference]: Finished difference Result 230097 states and 707814 transitions. [2022-01-18 09:55:09,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-18 09:55:09,902 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:55:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:55:10,554 INFO L225 Difference]: With dead ends: 230097 [2022-01-18 09:55:10,554 INFO L226 Difference]: Without dead ends: 230097 [2022-01-18 09:55:10,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2261, Invalid=6295, Unknown=0, NotChecked=0, Total=8556 [2022-01-18 09:55:10,555 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 2857 mSDsluCounter, 14659 mSDsCounter, 0 mSdLazyCounter, 5383 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2857 SdHoareTripleChecker+Valid, 16146 SdHoareTripleChecker+Invalid, 5455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 5383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:55:10,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2857 Valid, 16146 Invalid, 5455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 5383 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-18 09:55:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230097 states. [2022-01-18 09:55:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230097 to 148816. [2022-01-18 09:55:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148816 states, 148812 states have (on average 3.080054027900976) internal successors, (458349), 148815 states have internal predecessors, (458349), 0 states have call successors, (0), 0 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-18 09:55:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148816 states to 148816 states and 458349 transitions. [2022-01-18 09:55:14,915 INFO L78 Accepts]: Start accepts. Automaton has 148816 states and 458349 transitions. Word has length 114 [2022-01-18 09:55:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:55:14,915 INFO L470 AbstractCegarLoop]: Abstraction has 148816 states and 458349 transitions. [2022-01-18 09:55:14,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:55:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 148816 states and 458349 transitions. [2022-01-18 09:55:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:55:15,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:55:15,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:55:15,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-18 09:55:15,050 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-18 09:55:15,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:55:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash 365461738, now seen corresponding path program 34 times [2022-01-18 09:55:15,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:55:15,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241411863] [2022-01-18 09:55:15,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:55:15,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:55:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:55:15,651 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-18 09:55:15,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:55:15,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241411863] [2022-01-18 09:55:15,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241411863] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:55:15,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:55:15,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:55:15,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116457593] [2022-01-18 09:55:15,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:55:15,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:55:15,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:55:15,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:55:15,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:55:15,652 INFO L87 Difference]: Start difference. First operand 148816 states and 458349 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:55:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:55:25,764 INFO L93 Difference]: Finished difference Result 229305 states and 705315 transitions. [2022-01-18 09:55:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-18 09:55:25,764 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:55:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:55:26,437 INFO L225 Difference]: With dead ends: 229305 [2022-01-18 09:55:26,437 INFO L226 Difference]: Without dead ends: 229305 [2022-01-18 09:55:26,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-01-18 09:55:26,438 INFO L933 BasicCegarLoop]: 1491 mSDtfsCounter, 2956 mSDsluCounter, 10662 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2956 SdHoareTripleChecker+Valid, 12153 SdHoareTripleChecker+Invalid, 3887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:55:26,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2956 Valid, 12153 Invalid, 3887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-18 09:55:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229305 states. [2022-01-18 09:55:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229305 to 155119. [2022-01-18 09:55:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155119 states, 155115 states have (on average 3.081836057118912) internal successors, (478039), 155118 states have internal predecessors, (478039), 0 states have call successors, (0), 0 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-18 09:55:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155119 states to 155119 states and 478039 transitions. [2022-01-18 09:55:31,150 INFO L78 Accepts]: Start accepts. Automaton has 155119 states and 478039 transitions. Word has length 114 [2022-01-18 09:55:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:55:31,150 INFO L470 AbstractCegarLoop]: Abstraction has 155119 states and 478039 transitions. [2022-01-18 09:55:31,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:55:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 155119 states and 478039 transitions. [2022-01-18 09:55:31,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:55:31,302 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:55:31,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:55:31,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-18 09:55:31,302 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-18 09:55:31,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:55:31,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1568859766, now seen corresponding path program 35 times [2022-01-18 09:55:31,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:55:31,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623928445] [2022-01-18 09:55:31,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:55:31,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:55:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:55:31,780 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-18 09:55:31,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:55:31,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623928445] [2022-01-18 09:55:31,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623928445] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:55:31,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:55:31,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 09:55:31,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318990072] [2022-01-18 09:55:31,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:55:31,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 09:55:31,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:55:31,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 09:55:31,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-18 09:55:31,782 INFO L87 Difference]: Start difference. First operand 155119 states and 478039 transitions. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:55:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:55:37,987 INFO L93 Difference]: Finished difference Result 249206 states and 767289 transitions. [2022-01-18 09:55:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-18 09:55:37,988 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:55:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:55:38,713 INFO L225 Difference]: With dead ends: 249206 [2022-01-18 09:55:38,713 INFO L226 Difference]: Without dead ends: 249206 [2022-01-18 09:55:38,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1013, Invalid=2527, Unknown=0, NotChecked=0, Total=3540 [2022-01-18 09:55:38,714 INFO L933 BasicCegarLoop]: 1006 mSDtfsCounter, 2867 mSDsluCounter, 8803 mSDsCounter, 0 mSdLazyCounter, 3184 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2867 SdHoareTripleChecker+Valid, 9809 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 09:55:38,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2867 Valid, 9809 Invalid, 3262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3184 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-18 09:55:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249206 states. [2022-01-18 09:55:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249206 to 157396. [2022-01-18 09:55:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157396 states, 157392 states have (on average 3.082215106231575) internal successors, (485116), 157395 states have internal predecessors, (485116), 0 states have call successors, (0), 0 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-18 09:55:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157396 states to 157396 states and 485116 transitions. [2022-01-18 09:55:43,453 INFO L78 Accepts]: Start accepts. Automaton has 157396 states and 485116 transitions. Word has length 114 [2022-01-18 09:55:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:55:43,453 INFO L470 AbstractCegarLoop]: Abstraction has 157396 states and 485116 transitions. [2022-01-18 09:55:43,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:55:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 157396 states and 485116 transitions. [2022-01-18 09:55:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:55:43,606 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:55:43,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:55:43,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-18 09:55:43,606 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-18 09:55:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:55:43,606 INFO L85 PathProgramCache]: Analyzing trace with hash 455635790, now seen corresponding path program 36 times [2022-01-18 09:55:43,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:55:43,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975779381] [2022-01-18 09:55:43,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:55:43,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:55:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:55:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:55:44,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:55:44,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975779381] [2022-01-18 09:55:44,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975779381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:55:44,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:55:44,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:55:44,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405276004] [2022-01-18 09:55:44,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:55:44,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:55:44,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:55:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:55:44,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:55:44,181 INFO L87 Difference]: Start difference. First operand 157396 states and 485116 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:55:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:55:51,845 INFO L93 Difference]: Finished difference Result 270255 states and 832562 transitions. [2022-01-18 09:55:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-18 09:55:51,846 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:55:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:55:53,053 INFO L225 Difference]: With dead ends: 270255 [2022-01-18 09:55:53,053 INFO L226 Difference]: Without dead ends: 270255 [2022-01-18 09:55:53,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1495, Invalid=4205, Unknown=0, NotChecked=0, Total=5700 [2022-01-18 09:55:53,054 INFO L933 BasicCegarLoop]: 1156 mSDtfsCounter, 3518 mSDsluCounter, 8985 mSDsCounter, 0 mSdLazyCounter, 3191 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3518 SdHoareTripleChecker+Valid, 10141 SdHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 3191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 09:55:53,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3518 Valid, 10141 Invalid, 3263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 3191 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-18 09:55:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270255 states. [2022-01-18 09:55:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270255 to 158287. [2022-01-18 09:55:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158287 states, 158283 states have (on average 3.0824598977780306) internal successors, (487901), 158286 states have internal predecessors, (487901), 0 states have call successors, (0), 0 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-18 09:55:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158287 states to 158287 states and 487901 transitions. [2022-01-18 09:55:57,939 INFO L78 Accepts]: Start accepts. Automaton has 158287 states and 487901 transitions. Word has length 114 [2022-01-18 09:55:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:55:57,940 INFO L470 AbstractCegarLoop]: Abstraction has 158287 states and 487901 transitions. [2022-01-18 09:55:57,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:55:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 158287 states and 487901 transitions. [2022-01-18 09:55:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:55:58,095 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:55:58,095 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:55:58,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-18 09:55:58,096 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:55:58,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:55:58,096 INFO L85 PathProgramCache]: Analyzing trace with hash -899867714, now seen corresponding path program 37 times [2022-01-18 09:55:58,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:55:58,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452366444] [2022-01-18 09:55:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:55:58,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:55:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:55:58,672 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-18 09:55:58,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:55:58,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452366444] [2022-01-18 09:55:58,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452366444] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:55:58,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:55:58,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:55:58,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142814108] [2022-01-18 09:55:58,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:55:58,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:55:58,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:55:58,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:55:58,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:55:58,673 INFO L87 Difference]: Start difference. First operand 158287 states and 487901 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:56:07,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:56:07,973 INFO L93 Difference]: Finished difference Result 269364 states and 829895 transitions. [2022-01-18 09:56:07,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-01-18 09:56:07,973 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:56:07,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:56:09,213 INFO L225 Difference]: With dead ends: 269364 [2022-01-18 09:56:09,213 INFO L226 Difference]: Without dead ends: 269364 [2022-01-18 09:56:09,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1746, Invalid=4896, Unknown=0, NotChecked=0, Total=6642 [2022-01-18 09:56:09,214 INFO L933 BasicCegarLoop]: 1280 mSDtfsCounter, 3095 mSDsluCounter, 14700 mSDsCounter, 0 mSdLazyCounter, 5416 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3095 SdHoareTripleChecker+Valid, 15980 SdHoareTripleChecker+Invalid, 5488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 5416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:56:09,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3095 Valid, 15980 Invalid, 5488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 5416 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-18 09:56:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269364 states. [2022-01-18 09:56:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269364 to 158650. [2022-01-18 09:56:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158650 states, 158646 states have (on average 3.082548567250356) internal successors, (489034), 158649 states have internal predecessors, (489034), 0 states have call successors, (0), 0 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-18 09:56:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158650 states to 158650 states and 489034 transitions. [2022-01-18 09:56:14,055 INFO L78 Accepts]: Start accepts. Automaton has 158650 states and 489034 transitions. Word has length 114 [2022-01-18 09:56:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:56:14,056 INFO L470 AbstractCegarLoop]: Abstraction has 158650 states and 489034 transitions. [2022-01-18 09:56:14,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:56:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 158650 states and 489034 transitions. [2022-01-18 09:56:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:56:14,239 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:56:14,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:56:14,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-18 09:56:14,239 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:56:14,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:56:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1833636998, now seen corresponding path program 38 times [2022-01-18 09:56:14,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:56:14,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669475782] [2022-01-18 09:56:14,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:56:14,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:56:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:56:14,804 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-18 09:56:14,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:56:14,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669475782] [2022-01-18 09:56:14,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669475782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:56:14,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:56:14,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:56:14,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417064225] [2022-01-18 09:56:14,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:56:14,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:56:14,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:56:14,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:56:14,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:56:14,805 INFO L87 Difference]: Start difference. First operand 158650 states and 489034 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:56:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:56:24,569 INFO L93 Difference]: Finished difference Result 268011 states and 825564 transitions. [2022-01-18 09:56:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-18 09:56:24,570 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:56:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:56:25,767 INFO L225 Difference]: With dead ends: 268011 [2022-01-18 09:56:25,768 INFO L226 Difference]: Without dead ends: 268011 [2022-01-18 09:56:25,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2030, Invalid=5626, Unknown=0, NotChecked=0, Total=7656 [2022-01-18 09:56:25,768 INFO L933 BasicCegarLoop]: 1386 mSDtfsCounter, 3487 mSDsluCounter, 12154 mSDsCounter, 0 mSdLazyCounter, 4464 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3487 SdHoareTripleChecker+Valid, 13540 SdHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:56:25,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3487 Valid, 13540 Invalid, 4550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4464 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-18 09:56:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268011 states. [2022-01-18 09:56:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268011 to 158683. [2022-01-18 09:56:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158683 states, 158679 states have (on average 3.0825377019013227) internal successors, (489134), 158682 states have internal predecessors, (489134), 0 states have call successors, (0), 0 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-18 09:56:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158683 states to 158683 states and 489134 transitions. [2022-01-18 09:56:30,846 INFO L78 Accepts]: Start accepts. Automaton has 158683 states and 489134 transitions. Word has length 114 [2022-01-18 09:56:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:56:30,846 INFO L470 AbstractCegarLoop]: Abstraction has 158683 states and 489134 transitions. [2022-01-18 09:56:30,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:56:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 158683 states and 489134 transitions. [2022-01-18 09:56:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:56:31,063 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:56:31,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:56:31,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-18 09:56:31,063 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:56:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:56:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash 285505966, now seen corresponding path program 39 times [2022-01-18 09:56:31,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:56:31,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099646503] [2022-01-18 09:56:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:56:31,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:56:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:56:31,827 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-18 09:56:31,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:56:31,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099646503] [2022-01-18 09:56:31,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099646503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:56:31,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:56:31,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:56:31,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685318796] [2022-01-18 09:56:31,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:56:31,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:56:31,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:56:31,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:56:31,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:56:31,829 INFO L87 Difference]: Start difference. First operand 158683 states and 489134 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:56:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:56:42,472 INFO L93 Difference]: Finished difference Result 263610 states and 812337 transitions. [2022-01-18 09:56:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-18 09:56:42,472 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:56:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:56:43,305 INFO L225 Difference]: With dead ends: 263610 [2022-01-18 09:56:43,305 INFO L226 Difference]: Without dead ends: 263610 [2022-01-18 09:56:43,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2126, Invalid=5014, Unknown=0, NotChecked=0, Total=7140 [2022-01-18 09:56:43,306 INFO L933 BasicCegarLoop]: 1511 mSDtfsCounter, 2814 mSDsluCounter, 10648 mSDsCounter, 0 mSdLazyCounter, 3696 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 12159 SdHoareTripleChecker+Invalid, 3776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:56:43,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2814 Valid, 12159 Invalid, 3776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3696 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-18 09:56:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263610 states. [2022-01-18 09:56:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263610 to 168595. [2022-01-18 09:56:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168595 states, 168591 states have (on average 3.083925001927742) internal successors, (519922), 168594 states have internal predecessors, (519922), 0 states have call successors, (0), 0 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-18 09:56:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168595 states to 168595 states and 519922 transitions. [2022-01-18 09:56:48,187 INFO L78 Accepts]: Start accepts. Automaton has 168595 states and 519922 transitions. Word has length 114 [2022-01-18 09:56:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:56:48,187 INFO L470 AbstractCegarLoop]: Abstraction has 168595 states and 519922 transitions. [2022-01-18 09:56:48,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:56:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 168595 states and 519922 transitions. [2022-01-18 09:56:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:56:48,385 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:56:48,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:56:48,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-18 09:56:48,385 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:56:48,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:56:48,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2084097448, now seen corresponding path program 40 times [2022-01-18 09:56:48,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:56:48,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007658909] [2022-01-18 09:56:48,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:56:48,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:56:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:56:48,905 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-18 09:56:48,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:56:48,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007658909] [2022-01-18 09:56:48,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007658909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:56:48,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:56:48,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:56:48,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924866216] [2022-01-18 09:56:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:56:48,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:56:48,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:56:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:56:48,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:56:48,907 INFO L87 Difference]: Start difference. First operand 168595 states and 519922 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:56:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:56:56,726 INFO L93 Difference]: Finished difference Result 263775 states and 812854 transitions. [2022-01-18 09:56:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-18 09:56:56,727 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:56:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:56:57,922 INFO L225 Difference]: With dead ends: 263775 [2022-01-18 09:56:57,923 INFO L226 Difference]: Without dead ends: 263775 [2022-01-18 09:56:57,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1282, Invalid=3688, Unknown=0, NotChecked=0, Total=4970 [2022-01-18 09:56:57,923 INFO L933 BasicCegarLoop]: 1046 mSDtfsCounter, 3171 mSDsluCounter, 13427 mSDsCounter, 0 mSdLazyCounter, 5073 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3171 SdHoareTripleChecker+Valid, 14473 SdHoareTripleChecker+Invalid, 5145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 5073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:56:57,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3171 Valid, 14473 Invalid, 5145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 5073 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-18 09:56:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263775 states. [2022-01-18 09:57:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263775 to 172060. [2022-01-18 09:57:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172060 states, 172056 states have (on average 3.085303622076533) internal successors, (530845), 172059 states have internal predecessors, (530845), 0 states have call successors, (0), 0 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-18 09:57:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172060 states to 172060 states and 530845 transitions. [2022-01-18 09:57:02,923 INFO L78 Accepts]: Start accepts. Automaton has 172060 states and 530845 transitions. Word has length 114 [2022-01-18 09:57:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:57:02,925 INFO L470 AbstractCegarLoop]: Abstraction has 172060 states and 530845 transitions. [2022-01-18 09:57:02,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:57:02,925 INFO L276 IsEmpty]: Start isEmpty. Operand 172060 states and 530845 transitions. [2022-01-18 09:57:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:57:03,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:57:03,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:57:03,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-18 09:57:03,133 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:57:03,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:57:03,133 INFO L85 PathProgramCache]: Analyzing trace with hash 728593944, now seen corresponding path program 41 times [2022-01-18 09:57:03,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:57:03,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019585093] [2022-01-18 09:57:03,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:57:03,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:57:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:57:03,686 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-18 09:57:03,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:57:03,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019585093] [2022-01-18 09:57:03,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019585093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:57:03,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:57:03,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:57:03,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791902146] [2022-01-18 09:57:03,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:57:03,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:57:03,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:57:03,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:57:03,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:57:03,687 INFO L87 Difference]: Start difference. First operand 172060 states and 530845 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:57:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:57:12,095 INFO L93 Difference]: Finished difference Result 273972 states and 844711 transitions. [2022-01-18 09:57:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-18 09:57:12,095 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:57:12,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:57:13,307 INFO L225 Difference]: With dead ends: 273972 [2022-01-18 09:57:13,307 INFO L226 Difference]: Without dead ends: 273972 [2022-01-18 09:57:13,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1527, Invalid=4325, Unknown=0, NotChecked=0, Total=5852 [2022-01-18 09:57:13,308 INFO L933 BasicCegarLoop]: 1170 mSDtfsCounter, 3128 mSDsluCounter, 12672 mSDsCounter, 0 mSdLazyCounter, 4619 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3128 SdHoareTripleChecker+Valid, 13842 SdHoareTripleChecker+Invalid, 4696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:57:13,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3128 Valid, 13842 Invalid, 4696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4619 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-18 09:57:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273972 states. [2022-01-18 09:57:17,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273972 to 172423. [2022-01-18 09:57:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172423 states, 172419 states have (on average 3.0853792215475093) internal successors, (531978), 172422 states have internal predecessors, (531978), 0 states have call successors, (0), 0 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-18 09:57:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172423 states to 172423 states and 531978 transitions. [2022-01-18 09:57:18,355 INFO L78 Accepts]: Start accepts. Automaton has 172423 states and 531978 transitions. Word has length 114 [2022-01-18 09:57:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:57:18,356 INFO L470 AbstractCegarLoop]: Abstraction has 172423 states and 531978 transitions. [2022-01-18 09:57:18,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:57:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 172423 states and 531978 transitions. [2022-01-18 09:57:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:57:18,553 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:57:18,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:57:18,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-18 09:57:18,553 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:57:18,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:57:18,553 INFO L85 PathProgramCache]: Analyzing trace with hash -832868640, now seen corresponding path program 42 times [2022-01-18 09:57:18,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:57:18,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82413581] [2022-01-18 09:57:18,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:57:18,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:57:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:57:19,076 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-18 09:57:19,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:57:19,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82413581] [2022-01-18 09:57:19,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82413581] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:57:19,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:57:19,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:57:19,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061589831] [2022-01-18 09:57:19,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:57:19,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:57:19,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:57:19,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:57:19,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:57:19,077 INFO L87 Difference]: Start difference. First operand 172423 states and 531978 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:57:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:57:28,369 INFO L93 Difference]: Finished difference Result 272619 states and 840380 transitions. [2022-01-18 09:57:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-18 09:57:28,370 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:57:28,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:57:29,604 INFO L225 Difference]: With dead ends: 272619 [2022-01-18 09:57:29,605 INFO L226 Difference]: Without dead ends: 272619 [2022-01-18 09:57:29,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1799, Invalid=5007, Unknown=0, NotChecked=0, Total=6806 [2022-01-18 09:57:29,605 INFO L933 BasicCegarLoop]: 1276 mSDtfsCounter, 3476 mSDsluCounter, 13077 mSDsCounter, 0 mSdLazyCounter, 4820 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3476 SdHoareTripleChecker+Valid, 14353 SdHoareTripleChecker+Invalid, 4914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 4820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-18 09:57:29,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3476 Valid, 14353 Invalid, 4914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 4820 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-18 09:57:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272619 states. [2022-01-18 09:57:33,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272619 to 172456. [2022-01-18 09:57:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172456 states, 172452 states have (on average 3.085368682300002) internal successors, (532078), 172455 states have internal predecessors, (532078), 0 states have call successors, (0), 0 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-18 09:57:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172456 states to 172456 states and 532078 transitions. [2022-01-18 09:57:34,526 INFO L78 Accepts]: Start accepts. Automaton has 172456 states and 532078 transitions. Word has length 114 [2022-01-18 09:57:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:57:34,526 INFO L470 AbstractCegarLoop]: Abstraction has 172456 states and 532078 transitions. [2022-01-18 09:57:34,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:57:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 172456 states and 532078 transitions. [2022-01-18 09:57:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:57:34,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:57:34,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:57:34,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-18 09:57:34,733 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:57:34,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:57:34,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1913967624, now seen corresponding path program 43 times [2022-01-18 09:57:34,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:57:34,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801602279] [2022-01-18 09:57:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:57:34,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:57:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:57:35,345 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-18 09:57:35,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:57:35,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801602279] [2022-01-18 09:57:35,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801602279] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:57:35,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:57:35,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:57:35,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140931600] [2022-01-18 09:57:35,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:57:35,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:57:35,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:57:35,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:57:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:57:35,347 INFO L87 Difference]: Start difference. First operand 172456 states and 532078 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:57:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:57:46,031 INFO L93 Difference]: Finished difference Result 269300 states and 830081 transitions. [2022-01-18 09:57:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-18 09:57:46,031 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:57:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:57:46,875 INFO L225 Difference]: With dead ends: 269300 [2022-01-18 09:57:46,875 INFO L226 Difference]: Without dead ends: 269300 [2022-01-18 09:57:46,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2178, Invalid=5132, Unknown=0, NotChecked=0, Total=7310 [2022-01-18 09:57:46,876 INFO L933 BasicCegarLoop]: 1540 mSDtfsCounter, 2899 mSDsluCounter, 13338 mSDsCounter, 0 mSdLazyCounter, 4975 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2899 SdHoareTripleChecker+Valid, 14878 SdHoareTripleChecker+Invalid, 5060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:57:46,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2899 Valid, 14878 Invalid, 5060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 4975 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-18 09:57:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269300 states. [2022-01-18 09:57:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269300 to 169189. [2022-01-18 09:57:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169189 states, 169185 states have (on average 3.0841977716700653) internal successors, (521800), 169188 states have internal predecessors, (521800), 0 states have call successors, (0), 0 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-18 09:57:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169189 states to 169189 states and 521800 transitions. [2022-01-18 09:57:52,010 INFO L78 Accepts]: Start accepts. Automaton has 169189 states and 521800 transitions. Word has length 114 [2022-01-18 09:57:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:57:52,010 INFO L470 AbstractCegarLoop]: Abstraction has 169189 states and 521800 transitions. [2022-01-18 09:57:52,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:57:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 169189 states and 521800 transitions. [2022-01-18 09:57:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:57:52,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:57:52,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:57:52,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-18 09:57:52,201 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:57:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:57:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1995793738, now seen corresponding path program 44 times [2022-01-18 09:57:52,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:57:52,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564016217] [2022-01-18 09:57:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:57:52,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:57:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:57:53,344 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-18 09:57:53,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:57:53,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564016217] [2022-01-18 09:57:53,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564016217] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:57:53,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:57:53,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 09:57:53,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197849263] [2022-01-18 09:57:53,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:57:53,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 09:57:53,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:57:53,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 09:57:53,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-18 09:57:53,345 INFO L87 Difference]: Start difference. First operand 169189 states and 521800 transitions. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:57:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:57:58,517 INFO L93 Difference]: Finished difference Result 254141 states and 783391 transitions. [2022-01-18 09:57:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-18 09:57:58,517 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:57:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:57:59,274 INFO L225 Difference]: With dead ends: 254141 [2022-01-18 09:57:59,275 INFO L226 Difference]: Without dead ends: 254141 [2022-01-18 09:57:59,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-01-18 09:57:59,275 INFO L933 BasicCegarLoop]: 847 mSDtfsCounter, 2939 mSDsluCounter, 8689 mSDsCounter, 0 mSdLazyCounter, 3200 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2939 SdHoareTripleChecker+Valid, 9536 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:57:59,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2939 Valid, 9536 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3200 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-18 09:58:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254141 states. [2022-01-18 09:58:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254141 to 175921. [2022-01-18 09:58:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175921 states, 175917 states have (on average 3.085699506017042) internal successors, (542827), 175920 states have internal predecessors, (542827), 0 states have call successors, (0), 0 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-18 09:58:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175921 states to 175921 states and 542827 transitions. [2022-01-18 09:58:04,914 INFO L78 Accepts]: Start accepts. Automaton has 175921 states and 542827 transitions. Word has length 114 [2022-01-18 09:58:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:58:04,914 INFO L470 AbstractCegarLoop]: Abstraction has 175921 states and 542827 transitions. [2022-01-18 09:58:04,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:58:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 175921 states and 542827 transitions. [2022-01-18 09:58:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-18 09:58:05,158 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:58:05,158 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:58:05,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-18 09:58:05,159 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:58:05,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:58:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash 434331154, now seen corresponding path program 45 times [2022-01-18 09:58:05,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:58:05,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349961476] [2022-01-18 09:58:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:58:05,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:58:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:58:05,761 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-18 09:58:05,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:58:05,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349961476] [2022-01-18 09:58:05,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349961476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:58:05,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:58:05,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:58:05,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678367352] [2022-01-18 09:58:05,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:58:05,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:58:05,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:58:05,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:58:05,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:58:05,763 INFO L87 Difference]: Start difference. First operand 175921 states and 542827 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:58:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:58:13,558 INFO L93 Difference]: Finished difference Result 262127 states and 808614 transitions. [2022-01-18 09:58:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-18 09:58:13,558 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-01-18 09:58:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:58:14,351 INFO L225 Difference]: With dead ends: 262127 [2022-01-18 09:58:14,351 INFO L226 Difference]: Without dead ends: 262127 [2022-01-18 09:58:14,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1337, Invalid=3919, Unknown=0, NotChecked=0, Total=5256 [2022-01-18 09:58:14,352 INFO L933 BasicCegarLoop]: 1042 mSDtfsCounter, 3102 mSDsluCounter, 12003 mSDsCounter, 0 mSdLazyCounter, 4528 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3102 SdHoareTripleChecker+Valid, 13045 SdHoareTripleChecker+Invalid, 4614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:58:14,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3102 Valid, 13045 Invalid, 4614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4528 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-18 09:58:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262127 states. Received shutdown request... [2022-01-18 09:58:15,913 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2022-01-18 09:58:15,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-18 09:58:15,914 WARN L594 AbstractCegarLoop]: Verification canceled: while executing MinimizeSevpa. [2022-01-18 09:58:15,915 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2022-01-18 09:58:15,915 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2022-01-18 09:58:15,915 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2022-01-18 09:58:15,915 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2022-01-18 09:58:15,915 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 10 remaining) [2022-01-18 09:58:15,915 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 10 remaining) [2022-01-18 09:58:15,916 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2022-01-18 09:58:15,916 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2022-01-18 09:58:15,916 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2022-01-18 09:58:15,916 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 [2022-01-18 09:58:15,918 INFO L732 BasicCegarLoop]: Path program histogram: [45, 2, 1] [2022-01-18 09:58:15,921 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 09:58:15,921 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 09:58:15,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 09:58:15 BasicIcfg [2022-01-18 09:58:15,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 09:58:15,923 INFO L158 Benchmark]: Toolchain (without parser) took 682670.85ms. Allocated memory was 371.2MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 317.2MB in the beginning and 12.7GB in the end (delta: -12.4GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. [2022-01-18 09:58:15,923 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 371.2MB. Free memory is still 335.6MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 09:58:15,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.92ms. Allocated memory was 371.2MB in the beginning and 545.3MB in the end (delta: 174.1MB). Free memory was 317.1MB in the beginning and 496.6MB in the end (delta: -179.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. [2022-01-18 09:58:15,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.27ms. Allocated memory is still 545.3MB. Free memory was 496.6MB in the beginning and 493.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 09:58:15,923 INFO L158 Benchmark]: Boogie Preprocessor took 36.54ms. Allocated memory is still 545.3MB. Free memory was 493.4MB in the beginning and 491.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 09:58:15,923 INFO L158 Benchmark]: RCFGBuilder took 425.43ms. Allocated memory is still 545.3MB. Free memory was 491.3MB in the beginning and 470.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2022-01-18 09:58:15,923 INFO L158 Benchmark]: TraceAbstraction took 681638.94ms. Allocated memory was 545.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 470.4MB in the beginning and 12.7GB in the end (delta: -12.2GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. [2022-01-18 09:58:15,924 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.11ms. Allocated memory is still 371.2MB. Free memory is still 335.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 505.92ms. Allocated memory was 371.2MB in the beginning and 545.3MB in the end (delta: 174.1MB). Free memory was 317.1MB in the beginning and 496.6MB in the end (delta: -179.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.27ms. Allocated memory is still 545.3MB. Free memory was 496.6MB in the beginning and 493.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.54ms. Allocated memory is still 545.3MB. Free memory was 493.4MB in the beginning and 491.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 425.43ms. Allocated memory is still 545.3MB. Free memory was 491.3MB in the beginning and 470.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 681638.94ms. Allocated memory was 545.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 470.4MB in the beginning and 12.7GB in the end (delta: -12.2GB). Peak memory consumption was 3.3GB. Max. memory is 16.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 executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing MinimizeSevpa. - 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 executing MinimizeSevpa. - 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 executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 334 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 681.4s, OverallIterations: 48, TraceHistogramMax: 1, PathProgramHistogramMax: 45, EmptinessCheckTime: 10.5s, AutomataDifference: 440.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148567 SdHoareTripleChecker+Valid, 88.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148567 mSDsluCounter, 622562 SdHoareTripleChecker+Invalid, 74.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 564166 mSDsCounter, 3727 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 202684 IncrementalHoareTripleChecker+Invalid, 206411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3727 mSolverCounterUnsat, 58396 mSDtfsCounter, 202684 mSolverCounterSat, 1.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3780 GetRequests, 120 SyntacticMatches, 8 SemanticMatches, 3652 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47920 ImplicationChecksByTransitivity, 276.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175921occurred in iteration=47, InterpolantAutomatonStates: 2589, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 195.0s AutomataMinimizationTime, 48 MinimizatonAttempts, 2597611 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 31.6s InterpolantComputationTime, 5410 NumberOfCodeBlocks, 5410 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 5362 ConstructedInterpolants, 0 QuantifiedInterpolants, 82448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown