/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:05:34,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:05:34,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:05:34,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:05:34,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:05:34,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:05:34,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:05:34,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:05:34,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:05:34,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:05:34,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:05:34,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:05:34,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:05:34,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:05:34,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:05:34,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:05:34,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:05:34,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:05:34,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:05:34,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:05:34,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:05:34,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:05:34,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:05:34,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:05:34,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:05:34,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:05:34,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:05:34,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:05:34,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:05:34,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:05:34,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:05:34,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:05:34,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:05:34,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:05:34,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:05:34,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:05:34,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:05:34,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:05:34,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:05:34,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:05:34,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:05:34,890 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 18:05:34,914 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:05:34,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:05:34,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:05:34,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:05:34,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:05:34,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:05:34,916 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:05:34,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:05:34,916 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:05:34,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:05:34,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:05:34,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:05:34,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:05:34,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:05:34,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:05:34,917 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:05:34,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:05:34,917 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:05:34,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:05:34,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:05:34,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:05:34,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:05:34,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:05:34,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:05:34,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:05:34,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:05:34,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:05:34,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:05:34,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:05:34,918 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:05:34,918 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:05:34,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:05:34,918 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 18:05:35,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:05:35,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:05:35,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:05:35,105 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:05:35,107 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:05:35,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-03-15 18:05:35,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19909038d/eec4629e1f504e4da9aa39b81f4cc2c2/FLAG7e5ef386e [2022-03-15 18:05:35,552 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:05:35,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-03-15 18:05:35,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19909038d/eec4629e1f504e4da9aa39b81f4cc2c2/FLAG7e5ef386e [2022-03-15 18:05:35,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19909038d/eec4629e1f504e4da9aa39b81f4cc2c2 [2022-03-15 18:05:35,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:05:35,573 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:05:35,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:05:35,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:05:35,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:05:35,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:05:35" (1/1) ... [2022-03-15 18:05:35,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0cfc15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:35, skipping insertion in model container [2022-03-15 18:05:35,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:05:35" (1/1) ... [2022-03-15 18:05:35,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:05:35,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:05:35,750 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-15 18:05:35,908 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_1w1r-2.i[39095,39108] [2022-03-15 18:05:35,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39180,39193] [2022-03-15 18:05:35,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39232,39245] [2022-03-15 18:05:35,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:05:35,926 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:05:35,940 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-15 18:05:35,966 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_1w1r-2.i[39095,39108] [2022-03-15 18:05:35,967 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_1w1r-2.i[39180,39193] [2022-03-15 18:05:35,968 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_1w1r-2.i[39232,39245] [2022-03-15 18:05:35,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:05:36,009 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:05:36,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36 WrapperNode [2022-03-15 18:05:36,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:05:36,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:05:36,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:05:36,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:05:36,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36" (1/1) ... [2022-03-15 18:05:36,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36" (1/1) ... [2022-03-15 18:05:36,062 INFO L137 Inliner]: procedures = 224, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2022-03-15 18:05:36,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:05:36,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:05:36,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:05:36,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:05:36,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36" (1/1) ... [2022-03-15 18:05:36,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36" (1/1) ... [2022-03-15 18:05:36,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36" (1/1) ... [2022-03-15 18:05:36,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36" (1/1) ... [2022-03-15 18:05:36,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36" (1/1) ... [2022-03-15 18:05:36,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36" (1/1) ... [2022-03-15 18:05:36,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36" (1/1) ... [2022-03-15 18:05:36,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:05:36,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:05:36,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:05:36,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:05:36,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36" (1/1) ... [2022-03-15 18:05:36,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:05:36,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:05:36,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 18:05:36,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 18:05:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2022-03-15 18:05:36,157 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2022-03-15 18:05:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:05:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:05:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:05:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:05:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:05:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:05:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:05:36,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:05:36,160 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 18:05:36,255 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:05:36,256 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:05:36,465 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:05:36,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:05:36,472 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 18:05:36,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:05:36 BoogieIcfgContainer [2022-03-15 18:05:36,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:05:36,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:05:36,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:05:36,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:05:36,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:05:35" (1/3) ... [2022-03-15 18:05:36,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b76580f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:05:36, skipping insertion in model container [2022-03-15 18:05:36,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:05:36" (2/3) ... [2022-03-15 18:05:36,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b76580f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:05:36, skipping insertion in model container [2022-03-15 18:05:36,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:05:36" (3/3) ... [2022-03-15 18:05:36,481 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2022-03-15 18:05:36,485 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:05:36,485 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:05:36,485 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-03-15 18:05:36,485 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:05:36,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,541 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,541 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,541 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,541 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,541 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,542 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,542 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,542 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,542 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,543 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,544 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,544 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,544 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,547 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,547 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,548 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,548 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,548 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,548 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,554 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,554 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,556 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,556 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,556 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,556 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,556 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,557 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,562 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,562 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,562 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,563 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,563 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,563 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,564 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,566 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,568 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,568 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,568 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,568 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,569 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,569 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,569 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,569 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,569 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,569 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,569 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,570 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,570 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,570 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,570 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,570 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,570 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,570 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,570 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,570 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,571 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,571 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,571 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,571 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,571 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,571 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,571 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,571 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,571 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,571 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,572 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,572 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,572 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,572 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,572 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,572 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,572 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,572 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,572 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,572 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,573 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,573 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,573 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,573 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,573 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,573 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,573 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,573 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,574 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,574 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,574 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,574 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,574 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,574 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,574 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,574 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,575 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,575 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,575 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,575 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,575 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,575 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,575 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,575 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,575 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,575 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,575 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,576 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,577 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,578 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,578 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,578 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,578 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,578 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,578 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,578 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,578 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,578 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,578 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,578 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,579 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,579 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,583 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,583 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,583 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,583 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,583 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,583 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,583 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,583 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,583 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,583 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,584 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,584 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,584 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,584 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,584 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,584 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,587 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,587 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,587 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,590 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,590 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,592 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,592 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,592 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,592 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,592 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,592 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,593 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,593 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,593 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,593 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,594 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,594 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,594 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,594 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,594 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,594 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,594 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,599 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,600 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,600 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,600 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,600 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,600 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,600 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,600 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,600 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,600 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,601 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,601 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,601 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,601 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,601 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,601 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,601 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,601 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,602 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,602 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,602 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,608 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,608 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,608 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,608 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,608 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,608 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,608 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,609 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,609 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,609 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,609 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,609 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,609 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,609 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,609 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,609 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,609 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,610 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,610 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,610 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,610 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,610 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,610 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,610 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,610 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,611 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,611 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,611 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,612 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:05:36,617 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-03-15 18:05:36,647 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:05:36,655 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 18:05:36,655 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-15 18:05:36,664 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:05:36,669 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 158 transitions, 324 flow [2022-03-15 18:05:36,671 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 158 transitions, 324 flow [2022-03-15 18:05:36,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 152 places, 158 transitions, 324 flow [2022-03-15 18:05:36,707 INFO L129 PetriNetUnfolder]: 10/157 cut-off events. [2022-03-15 18:05:36,708 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-03-15 18:05:36,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 157 events. 10/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 270 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-03-15 18:05:36,715 INFO L116 LiptonReduction]: Number of co-enabled transitions 6150 [2022-03-15 18:05:39,338 INFO L131 LiptonReduction]: Checked pairs total: 7583 [2022-03-15 18:05:39,338 INFO L133 LiptonReduction]: Total number of compositions: 150 [2022-03-15 18:05:39,344 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 32 transitions, 72 flow [2022-03-15 18:05:39,360 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 119 states, 116 states have (on average 2.413793103448276) internal successors, (280), 118 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 116 states have (on average 2.413793103448276) internal successors, (280), 118 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-03-15 18:05:39,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:05:39,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-03-15 18:05:39,365 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:05:39,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:05:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash 587139661, now seen corresponding path program 1 times [2022-03-15 18:05:39,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:05:39,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858635730] [2022-03-15 18:05:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:05:39,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:05:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:05:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:39,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:05:39,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858635730] [2022-03-15 18:05:39,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858635730] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:05:39,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:05:39,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 18:05:39,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [11237232] [2022-03-15 18:05:39,510 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:05:39,511 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:05:39,517 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2022-03-15 18:05:39,517 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:05:39,519 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:05:39,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 18:05:39,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:05:39,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 18:05:39,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 18:05:39,534 INFO L87 Difference]: Start difference. First operand has 119 states, 116 states have (on average 2.413793103448276) internal successors, (280), 118 states have internal predecessors, (280), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:05:39,566 INFO L93 Difference]: Finished difference Result 119 states and 258 transitions. [2022-03-15 18:05:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 18:05:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-03-15 18:05:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:05:39,573 INFO L225 Difference]: With dead ends: 119 [2022-03-15 18:05:39,574 INFO L226 Difference]: Without dead ends: 119 [2022-03-15 18:05:39,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 18:05:39,576 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:05:39,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:05:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-03-15 18:05:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-03-15 18:05:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 116 states have (on average 2.2241379310344827) internal successors, (258), 118 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 258 transitions. [2022-03-15 18:05:39,602 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 258 transitions. Word has length 5 [2022-03-15 18:05:39,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:05:39,603 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 258 transitions. [2022-03-15 18:05:39,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 258 transitions. [2022-03-15 18:05:39,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-03-15 18:05:39,603 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:05:39,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-03-15 18:05:39,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:05:39,604 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:05:39,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:05:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1021456806, now seen corresponding path program 1 times [2022-03-15 18:05:39,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:05:39,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720102225] [2022-03-15 18:05:39,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:05:39,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:05:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:05:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:39,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:05:39,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720102225] [2022-03-15 18:05:39,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720102225] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:05:39,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:05:39,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:05:39,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360142185] [2022-03-15 18:05:39,645 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:05:39,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:05:39,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2022-03-15 18:05:39,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:05:39,646 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:05:39,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 18:05:39,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:05:39,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 18:05:39,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:05:39,647 INFO L87 Difference]: Start difference. First operand 119 states and 258 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:05:39,685 INFO L93 Difference]: Finished difference Result 191 states and 419 transitions. [2022-03-15 18:05:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:05:39,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-03-15 18:05:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:05:39,687 INFO L225 Difference]: With dead ends: 191 [2022-03-15 18:05:39,687 INFO L226 Difference]: Without dead ends: 191 [2022-03-15 18:05:39,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:05:39,688 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:05:39,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:05:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-03-15 18:05:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 146. [2022-03-15 18:05:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 143 states have (on average 2.265734265734266) internal successors, (324), 145 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 324 transitions. [2022-03-15 18:05:39,697 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 324 transitions. Word has length 6 [2022-03-15 18:05:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:05:39,697 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 324 transitions. [2022-03-15 18:05:39,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 324 transitions. [2022-03-15 18:05:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 18:05:39,697 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:05:39,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:05:39,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:05:39,698 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:05:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:05:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash 111305017, now seen corresponding path program 1 times [2022-03-15 18:05:39,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:05:39,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777451761] [2022-03-15 18:05:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:05:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:05:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:05:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:39,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:05:39,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777451761] [2022-03-15 18:05:39,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777451761] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:05:39,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:05:39,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 18:05:39,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1563656925] [2022-03-15 18:05:39,810 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:05:39,810 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:05:39,811 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 18:05:39,812 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:05:39,812 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:05:39,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 18:05:39,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:05:39,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 18:05:39,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-15 18:05:39,813 INFO L87 Difference]: Start difference. First operand 146 states and 324 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:05:40,016 INFO L93 Difference]: Finished difference Result 173 states and 374 transitions. [2022-03-15 18:05:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 18:05:40,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-03-15 18:05:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:05:40,019 INFO L225 Difference]: With dead ends: 173 [2022-03-15 18:05:40,019 INFO L226 Difference]: Without dead ends: 154 [2022-03-15 18:05:40,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-03-15 18:05:40,020 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 52 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:05:40,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 12 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:05:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-03-15 18:05:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-03-15 18:05:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 151 states have (on average 2.2649006622516556) internal successors, (342), 153 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 342 transitions. [2022-03-15 18:05:40,026 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 342 transitions. Word has length 10 [2022-03-15 18:05:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:05:40,026 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 342 transitions. [2022-03-15 18:05:40,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 342 transitions. [2022-03-15 18:05:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 18:05:40,027 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:05:40,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:05:40,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 18:05:40,028 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:05:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:05:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash 145815624, now seen corresponding path program 1 times [2022-03-15 18:05:40,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:05:40,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977375699] [2022-03-15 18:05:40,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:05:40,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:05:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:05:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:40,343 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:05:40,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977375699] [2022-03-15 18:05:40,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977375699] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:05:40,344 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:05:40,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 18:05:40,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1654701351] [2022-03-15 18:05:40,344 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:05:40,346 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:05:40,349 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 46 transitions. [2022-03-15 18:05:40,349 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:05:40,959 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [1750#(and (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ 20 |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (not (= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) (+ 20 |reader_fnThread1of1ForFork0_#in~arg#1.offset|)))), 1747#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| 20))) (not (= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| 20) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4))) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0)), 1755#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| 20)) (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0)), 1749#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| 20))) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0)), 1756#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ 20 |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|)), 1753#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| 20))) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0)), 1752#(and (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ 20 |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0)), 1754#(and (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ 20 |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0)), 1748#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| 20))) (<= (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4) |reader_fnThread1of1ForFork0_~r~0#1.offset|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0)), 1751#(and (<= (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ 20 |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0))] [2022-03-15 18:05:40,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 18:05:40,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:05:40,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 18:05:40,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:05:40,960 INFO L87 Difference]: Start difference. First operand 154 states and 342 transitions. Second operand has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:05:42,159 INFO L93 Difference]: Finished difference Result 164 states and 353 transitions. [2022-03-15 18:05:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:05:42,160 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 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 16 [2022-03-15 18:05:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:05:42,161 INFO L225 Difference]: With dead ends: 164 [2022-03-15 18:05:42,161 INFO L226 Difference]: Without dead ends: 156 [2022-03-15 18:05:42,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=283, Invalid=1199, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 18:05:42,162 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 64 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:05:42,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 84 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:05:42,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-03-15 18:05:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-03-15 18:05:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 153 states have (on average 2.235294117647059) internal successors, (342), 155 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 342 transitions. [2022-03-15 18:05:42,168 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 342 transitions. Word has length 16 [2022-03-15 18:05:42,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:05:42,168 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 342 transitions. [2022-03-15 18:05:42,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 342 transitions. [2022-03-15 18:05:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 18:05:42,169 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:05:42,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:05:42,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 18:05:42,169 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:05:42,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:05:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1220528438, now seen corresponding path program 2 times [2022-03-15 18:05:42,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:05:42,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210900431] [2022-03-15 18:05:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:05:42,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:05:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:05:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:42,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:05:42,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210900431] [2022-03-15 18:05:42,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210900431] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:05:42,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:05:42,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 18:05:42,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1819380890] [2022-03-15 18:05:42,407 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:05:42,409 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:05:42,412 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 40 transitions. [2022-03-15 18:05:42,412 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:05:42,685 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2279#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 2277#(= (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (+ 20 |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 2280#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 2278#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|))] [2022-03-15 18:05:42,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:05:42,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:05:42,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:05:42,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:05:42,686 INFO L87 Difference]: Start difference. First operand 156 states and 342 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:05:43,580 INFO L93 Difference]: Finished difference Result 177 states and 377 transitions. [2022-03-15 18:05:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 18:05:43,580 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 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 16 [2022-03-15 18:05:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:05:43,581 INFO L225 Difference]: With dead ends: 177 [2022-03-15 18:05:43,581 INFO L226 Difference]: Without dead ends: 167 [2022-03-15 18:05:43,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:05:43,582 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 66 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:05:43,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 50 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:05:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-03-15 18:05:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-03-15 18:05:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 162 states have (on average 2.2222222222222223) internal successors, (360), 164 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 360 transitions. [2022-03-15 18:05:43,590 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 360 transitions. Word has length 16 [2022-03-15 18:05:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:05:43,590 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 360 transitions. [2022-03-15 18:05:43,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 360 transitions. [2022-03-15 18:05:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 18:05:43,591 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:05:43,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:05:43,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 18:05:43,591 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:05:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:05:43,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1865939254, now seen corresponding path program 3 times [2022-03-15 18:05:43,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:05:43,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69795695] [2022-03-15 18:05:43,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:05:43,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:05:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:05:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:43,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:05:43,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69795695] [2022-03-15 18:05:43,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69795695] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:05:43,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:05:43,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 18:05:43,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1707509067] [2022-03-15 18:05:43,867 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:05:43,869 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:05:43,872 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 40 transitions. [2022-03-15 18:05:43,872 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:05:43,897 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:05:43,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:05:43,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:05:43,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:05:43,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:05:43,898 INFO L87 Difference]: Start difference. First operand 165 states and 360 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:05:44,602 INFO L93 Difference]: Finished difference Result 183 states and 389 transitions. [2022-03-15 18:05:44,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:05:44,602 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-03-15 18:05:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:05:44,603 INFO L225 Difference]: With dead ends: 183 [2022-03-15 18:05:44,603 INFO L226 Difference]: Without dead ends: 173 [2022-03-15 18:05:44,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:05:44,605 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:05:44,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 37 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:05:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-03-15 18:05:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2022-03-15 18:05:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 159 states have (on average 2.2264150943396226) internal successors, (354), 161 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 354 transitions. [2022-03-15 18:05:44,615 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 354 transitions. Word has length 16 [2022-03-15 18:05:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:05:44,615 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 354 transitions. [2022-03-15 18:05:44,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 354 transitions. [2022-03-15 18:05:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 18:05:44,616 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:05:44,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:05:44,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 18:05:44,616 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:05:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:05:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash 891793415, now seen corresponding path program 1 times [2022-03-15 18:05:44,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:05:44,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574532150] [2022-03-15 18:05:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:05:44,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:05:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:05:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:45,025 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:05:45,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574532150] [2022-03-15 18:05:45,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574532150] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:05:45,026 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:05:45,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 18:05:45,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [942860067] [2022-03-15 18:05:45,026 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:05:45,028 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:05:45,045 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2022-03-15 18:05:45,045 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:05:45,946 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [3389#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (<= (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)) 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (< 0 (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4) 1)) (= |ULTIMATE.start_ring_enqueue_~x#1| 1)), 3386#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (<= (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)) 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (< 0 (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4) 1)) (= |ULTIMATE.start_ring_enqueue_~x#1| 1)), 3388#(and (< 0 (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 1)) (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (<= (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0)), 3390#(and (< 0 (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 1)) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|)), 3387#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (<= (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)) 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (< 0 (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4) 1)) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) 0)), 3385#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (<= (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)) 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (< 0 (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4) 1)) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) 0)), 3383#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (< 0 (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 1)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) 0) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0)), 3384#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (< 0 (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 1)) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0))] [2022-03-15 18:05:45,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 18:05:45,946 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:05:45,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 18:05:45,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-03-15 18:05:45,947 INFO L87 Difference]: Start difference. First operand 162 states and 354 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:05:47,579 INFO L93 Difference]: Finished difference Result 236 states and 517 transitions. [2022-03-15 18:05:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 18:05:47,580 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 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 18 [2022-03-15 18:05:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:05:47,581 INFO L225 Difference]: With dead ends: 236 [2022-03-15 18:05:47,581 INFO L226 Difference]: Without dead ends: 236 [2022-03-15 18:05:47,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=338, Invalid=1468, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 18:05:47,582 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 110 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:05:47,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 100 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:05:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-03-15 18:05:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 214. [2022-03-15 18:05:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 211 states have (on average 2.2322274881516586) internal successors, (471), 213 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 471 transitions. [2022-03-15 18:05:47,588 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 471 transitions. Word has length 18 [2022-03-15 18:05:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:05:47,599 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 471 transitions. [2022-03-15 18:05:47,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 471 transitions. [2022-03-15 18:05:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 18:05:47,600 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:05:47,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:05:47,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 18:05:47,601 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:05:47,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:05:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash -69084245, now seen corresponding path program 2 times [2022-03-15 18:05:47,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:05:47,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042376692] [2022-03-15 18:05:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:05:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:05:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:05:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:47,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:05:47,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042376692] [2022-03-15 18:05:47,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042376692] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:05:47,939 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:05:47,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 18:05:47,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1648774143] [2022-03-15 18:05:47,940 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:05:47,941 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:05:47,945 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2022-03-15 18:05:47,945 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:05:48,233 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:05:48,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:05:48,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:05:48,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:05:48,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-03-15 18:05:48,233 INFO L87 Difference]: Start difference. First operand 214 states and 471 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:05:49,023 INFO L93 Difference]: Finished difference Result 290 states and 641 transitions. [2022-03-15 18:05:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 18:05:49,023 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-03-15 18:05:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:05:49,024 INFO L225 Difference]: With dead ends: 290 [2022-03-15 18:05:49,025 INFO L226 Difference]: Without dead ends: 290 [2022-03-15 18:05:49,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:05:49,025 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 99 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:05:49,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 71 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:05:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-03-15 18:05:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 214. [2022-03-15 18:05:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 211 states have (on average 2.2369668246445498) internal successors, (472), 213 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 472 transitions. [2022-03-15 18:05:49,030 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 472 transitions. Word has length 18 [2022-03-15 18:05:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:05:49,030 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 472 transitions. [2022-03-15 18:05:49,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 472 transitions. [2022-03-15 18:05:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 18:05:49,031 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:05:49,031 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:05:49,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 18:05:49,031 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:05:49,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:05:49,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1249641624, now seen corresponding path program 1 times [2022-03-15 18:05:49,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:05:49,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627661893] [2022-03-15 18:05:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:05:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:05:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:05:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:49,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:05:49,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627661893] [2022-03-15 18:05:49,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627661893] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:05:49,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511314397] [2022-03-15 18:05:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:05:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:05:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:05:49,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:05:49,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 18:05:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:05:49,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 18:05:49,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:05:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:49,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:05:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:49,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511314397] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:05:49,221 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:05:49,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-03-15 18:05:49,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [389320354] [2022-03-15 18:05:49,221 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:05:49,223 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:05:49,227 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 51 transitions. [2022-03-15 18:05:49,227 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:05:49,369 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [4979#(or (<= 8 |reader_fnThread1of1ForFork0_~i~0#1|) (= |reader_fnThread1of1ForFork0_~i~0#1| 0))] [2022-03-15 18:05:49,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 18:05:49,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:05:49,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 18:05:49,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 18:05:49,370 INFO L87 Difference]: Start difference. First operand 214 states and 472 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:05:49,441 INFO L93 Difference]: Finished difference Result 318 states and 701 transitions. [2022-03-15 18:05:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:05:49,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 21 [2022-03-15 18:05:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:05:49,442 INFO L225 Difference]: With dead ends: 318 [2022-03-15 18:05:49,442 INFO L226 Difference]: Without dead ends: 318 [2022-03-15 18:05:49,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 18:05:49,443 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 57 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:05:49,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 16 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:05:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-03-15 18:05:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 270. [2022-03-15 18:05:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 267 states have (on average 2.2734082397003745) internal successors, (607), 269 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 607 transitions. [2022-03-15 18:05:49,449 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 607 transitions. Word has length 21 [2022-03-15 18:05:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:05:49,449 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 607 transitions. [2022-03-15 18:05:49,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:05:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 607 transitions. [2022-03-15 18:05:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 18:05:49,449 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:05:49,449 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:05:49,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 18:05:49,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:05:49,666 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:05:49,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:05:49,666 INFO L85 PathProgramCache]: Analyzing trace with hash -898685161, now seen corresponding path program 3 times [2022-03-15 18:05:49,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:05:49,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064215808] [2022-03-15 18:05:49,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:05:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:05:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:05:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:50,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:05:50,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064215808] [2022-03-15 18:05:50,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064215808] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:05:50,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444693530] [2022-03-15 18:05:50,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:05:50,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:05:50,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:05:50,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:05:50,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 18:05:50,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 18:05:50,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:05:50,494 WARN L261 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 122 conjunts are in the unsatisfiable core [2022-03-15 18:05:50,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:05:50,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:05:50,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-03-15 18:05:50,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:05:50,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 18:05:50,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 18:05:50,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:05:50,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 18:05:50,844 INFO L353 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-03-15 18:05:50,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-03-15 18:05:50,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:05:50,980 INFO L353 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-03-15 18:05:50,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 48 [2022-03-15 18:05:51,202 INFO L353 Elim1Store]: treesize reduction 97, result has 24.2 percent of original size [2022-03-15 18:05:51,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 59 [2022-03-15 18:05:51,252 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-15 18:05:51,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-03-15 18:05:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:05:51,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:05:53,359 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| Int)) (or (forall ((v_ArrVal_224 Int)) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| 4) 4) v_ArrVal_224)) |c_reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) (+ (* |c_reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| 4) |c_reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| 4)))) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40|)))) is different from false [2022-03-15 18:05:53,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| Int) (v_ArrVal_224 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (or (not (<= (select .cse0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| 4) 4) v_ArrVal_224)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ (* (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4)) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1))))) is different from false [2022-03-15 18:05:54,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| Int) (v_ArrVal_224 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| 4) 4) v_ArrVal_224)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ (* (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4)) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1)) (not (<= (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40|))))) is different from false [2022-03-15 18:05:56,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| Int) (v_ArrVal_224 Int) (v_ArrVal_222 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) v_ArrVal_222)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (not (<= (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40|)) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| 4) 4) v_ArrVal_224)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select .cse1 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))) (let ((.cse2 (+ |c_ULTIMATE.start_ring_enqueue_#t~mem7#1| 1))) (let ((.cse3 (mod .cse2 4))) (and (or (not (< .cse2 0)) (= .cse3 0) (not (<= .cse3 (+ v_ArrVal_222 4)))) (not (<= .cse3 v_ArrVal_222))))))))) is different from false [2022-03-15 18:05:58,601 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| Int) (v_ArrVal_224 Int) (v_ArrVal_222 Int)) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse5 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse4 .cse5 v_ArrVal_222)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (not (<= (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40|)) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| 4) 4) v_ArrVal_224)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select .cse1 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))) (let ((.cse3 (+ (select .cse4 .cse5) 1))) (let ((.cse2 (mod .cse3 4))) (and (or (not (<= .cse2 (+ v_ArrVal_222 4))) (not (< .cse3 0)) (= .cse2 0)) (not (<= .cse2 v_ArrVal_222)))))))))) is different from false [2022-03-15 18:06:00,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| Int) (v_ArrVal_224 Int) (v_ArrVal_222 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) |c_ULTIMATE.start_ring_enqueue_~x#1|)) (.cse5 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse4 .cse5 v_ArrVal_222)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (not (<= (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40|)) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_40| 4) 4) v_ArrVal_224)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select .cse1 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))) (let ((.cse3 (+ (select .cse4 .cse5) 1))) (let ((.cse2 (mod .cse3 4))) (and (not (<= .cse2 v_ArrVal_222)) (or (not (< .cse3 0)) (not (<= .cse2 (+ v_ArrVal_222 4))) (= .cse2 0)))))))))) is different from false [2022-03-15 18:06:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-03-15 18:06:23,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444693530] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:06:23,449 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:06:23,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 42 [2022-03-15 18:06:23,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1565550547] [2022-03-15 18:06:23,449 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:06:23,451 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:06:23,458 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 69 transitions. [2022-03-15 18:06:23,458 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:06:25,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [6018#(and (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) 0)), 6021#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (< 0 (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 1)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0)), 6014#(and (or (= (+ |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| 4 (* |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| 4)) 4) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (<= (+ |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| 4 (* |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| 4)) (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| 4 (* |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| 4))) 1) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|))), 6016#(and (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (< 0 (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 1)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) 0) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0)), 6017#(and (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) 0)), 6020#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4)) 1) (<= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4) (* |ULTIMATE.start_ring_enqueue_#t~mem4#1| 4)) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|))) 0)), 6024#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 0) (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|)), 6019#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (<= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4) (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4)) 1) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|))) 0)), 6023#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|)), 5875#(and (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) 20) 0)), 6015#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4)) 1) (= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4) 4) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4)))), 6022#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|)), 6025#(and (or (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 4) 1) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (<= 4 (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)))] [2022-03-15 18:06:25,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 18:06:25,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:06:25,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 18:06:25,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2236, Unknown=13, NotChecked=606, Total=3080 [2022-03-15 18:06:25,340 INFO L87 Difference]: Start difference. First operand 270 states and 607 transitions. Second operand has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:06:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:06:28,756 INFO L93 Difference]: Finished difference Result 391 states and 837 transitions. [2022-03-15 18:06:28,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 18:06:28,756 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 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 23 [2022-03-15 18:06:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:06:28,758 INFO L225 Difference]: With dead ends: 391 [2022-03-15 18:06:28,758 INFO L226 Difference]: Without dead ends: 391 [2022-03-15 18:06:28,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2027 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=787, Invalid=6364, Unknown=13, NotChecked=1026, Total=8190 [2022-03-15 18:06:28,760 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 155 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:06:28,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 153 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 18:06:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-03-15 18:06:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 302. [2022-03-15 18:06:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 299 states have (on average 2.2876254180602005) internal successors, (684), 301 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:06:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 684 transitions. [2022-03-15 18:06:28,765 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 684 transitions. Word has length 23 [2022-03-15 18:06:28,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:06:28,765 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 684 transitions. [2022-03-15 18:06:28,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:06:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 684 transitions. [2022-03-15 18:06:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 18:06:28,766 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:06:28,766 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:06:28,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 18:06:28,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 18:06:28,970 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:06:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:06:28,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1087722999, now seen corresponding path program 4 times [2022-03-15 18:06:28,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:06:28,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809946097] [2022-03-15 18:06:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:06:28,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:06:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:06:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:06:29,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:06:29,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809946097] [2022-03-15 18:06:29,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809946097] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:06:29,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760148550] [2022-03-15 18:06:29,692 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:06:29,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:06:29,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:06:29,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:06:29,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 18:06:29,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:06:29,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:06:29,765 WARN L261 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 124 conjunts are in the unsatisfiable core [2022-03-15 18:06:29,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:06:29,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:06:29,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-03-15 18:06:29,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:06:29,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 18:06:29,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 18:06:30,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:06:30,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 18:06:30,100 INFO L353 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-03-15 18:06:30,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-03-15 18:06:30,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:06:30,208 INFO L353 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2022-03-15 18:06:30,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 45 [2022-03-15 18:06:30,462 INFO L353 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-03-15 18:06:30,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 51 [2022-03-15 18:06:30,562 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-15 18:06:30,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-03-15 18:06:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:06:30,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:06:33,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_55| Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_55|)) (forall ((v_ArrVal_279 Int)) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_55| 4) 4) v_ArrVal_279)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse0 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4))) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1))))) is different from false [2022-03-15 18:06:46,498 WARN L228 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:07:20,549 WARN L228 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:07:37,920 WARN L228 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:07:52,792 WARN L228 SmtUtils]: Spent 12.56s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:08:05,903 WARN L228 SmtUtils]: Spent 11.04s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:08:23,817 WARN L228 SmtUtils]: Spent 11.41s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:08:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-15 18:08:23,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760148550] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:08:23,819 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:08:23,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2022-03-15 18:08:23,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [346581941] [2022-03-15 18:08:23,819 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:08:23,821 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:08:23,827 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 61 transitions. [2022-03-15 18:08:23,827 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:08:25,300 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [7276#(and (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) |ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 7273#(and (or (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 4) 1) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (<= 4 (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) |ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|))), 7275#(and (= (+ |ULTIMATE.start_writer_fn_~i~1#1| 1) |ULTIMATE.start_ring_enqueue_~x#1|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 7274#(and (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (= (+ |ULTIMATE.start_writer_fn_~i~1#1| 1) |ULTIMATE.start_ring_enqueue_~x#1|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_~r~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|)), 7269#(and (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (= (+ |ULTIMATE.start_writer_fn_~i~1#1| 1) |ULTIMATE.start_ring_enqueue_~x#1|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (< 0 (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 1)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_~r~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0)), 7271#(and (= (+ |ULTIMATE.start_writer_fn_~i~1#1| 1) |ULTIMATE.start_ring_enqueue_~x#1|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (< 0 (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 1)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0)), 7270#(and (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (= (+ |ULTIMATE.start_writer_fn_~i~1#1| 1) |ULTIMATE.start_ring_enqueue_~x#1|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_~r~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|)), 7272#(and (= (+ |ULTIMATE.start_writer_fn_~i~1#1| 1) |ULTIMATE.start_ring_enqueue_~x#1|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 7128#(and (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) 0) 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) 20) 0))] [2022-03-15 18:08:25,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 18:08:25,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:08:25,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 18:08:25,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2499, Unknown=17, NotChecked=102, Total=2862 [2022-03-15 18:08:25,302 INFO L87 Difference]: Start difference. First operand 302 states and 684 transitions. Second operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:08:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:08:29,520 INFO L93 Difference]: Finished difference Result 463 states and 1008 transitions. [2022-03-15 18:08:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 18:08:29,521 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 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 23 [2022-03-15 18:08:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:08:29,522 INFO L225 Difference]: With dead ends: 463 [2022-03-15 18:08:29,522 INFO L226 Difference]: Without dead ends: 463 [2022-03-15 18:08:29,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 116.9s TimeCoverageRelationStatistics Valid=1007, Invalid=7910, Unknown=17, NotChecked=186, Total=9120 [2022-03-15 18:08:29,525 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 170 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 18:08:29,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 127 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 18:08:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-03-15 18:08:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 312. [2022-03-15 18:08:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 309 states have (on average 2.2718446601941746) internal successors, (702), 311 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:08:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 702 transitions. [2022-03-15 18:08:29,534 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 702 transitions. Word has length 23 [2022-03-15 18:08:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:08:29,534 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 702 transitions. [2022-03-15 18:08:29,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:08:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 702 transitions. [2022-03-15 18:08:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 18:08:29,535 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:08:29,535 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:08:29,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 18:08:29,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:08:29,746 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:08:29,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:08:29,747 INFO L85 PathProgramCache]: Analyzing trace with hash -824296019, now seen corresponding path program 5 times [2022-03-15 18:08:29,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:08:29,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221460449] [2022-03-15 18:08:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:08:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:08:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:08:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:08:30,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:08:30,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221460449] [2022-03-15 18:08:30,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221460449] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:08:30,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924576892] [2022-03-15 18:08:30,431 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:08:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:08:30,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:08:30,432 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:08:30,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 18:08:30,511 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:08:30,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:08:30,513 WARN L261 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 110 conjunts are in the unsatisfiable core [2022-03-15 18:08:30,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:08:30,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:08:30,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-03-15 18:08:30,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:08:30,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 18:08:30,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 18:08:30,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:08:30,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 18:08:30,817 INFO L353 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-03-15 18:08:30,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2022-03-15 18:08:30,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:08:30,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:08:30,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:08:30,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-03-15 18:08:31,164 INFO L353 Elim1Store]: treesize reduction 93, result has 27.3 percent of original size [2022-03-15 18:08:31,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 63 [2022-03-15 18:08:31,213 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-15 18:08:31,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-03-15 18:08:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:08:31,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:08:33,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_68| Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_68|)) (forall ((v_ArrVal_334 Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_68| 4)) v_ArrVal_334)) |c_reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) (+ (* |c_reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| 4) |c_reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| 4)) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1))))) is different from false [2022-03-15 18:08:36,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_68| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4 (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_68| 4)) v_ArrVal_334)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ (* (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4))) (not (<= (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_68|))))) is different from false [2022-03-15 18:09:01,699 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 Int) (v_ArrVal_333 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_68| Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) |c_ULTIMATE.start_ring_enqueue_~x#1|)) (.cse5 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse4 .cse5 v_ArrVal_333)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4 (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_68| 4)) v_ArrVal_334)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4 (* 4 (select (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|)))) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1)) (let ((.cse3 (+ (select .cse4 .cse5) 1))) (let ((.cse2 (mod .cse3 4))) (and (not (<= .cse2 v_ArrVal_333)) (or (not (< .cse3 0)) (not (<= .cse2 (+ v_ArrVal_333 4))) (= .cse2 0))))) (not (<= (select .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_68|))))))) is different from false [2022-03-15 18:09:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-03-15 18:09:28,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924576892] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:09:28,702 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:09:28,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 40 [2022-03-15 18:09:28,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1592969234] [2022-03-15 18:09:28,702 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:09:28,704 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:09:28,712 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 95 transitions. [2022-03-15 18:09:28,712 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:09:31,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [8633#(and (or (= (+ |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| 4 (* |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| 4)) 4) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (<= (+ |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| 4 (* |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| 4)) (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| 4 (* |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| 4))) 1) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|))), 8637#(and (or (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 4) 1) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (<= 4 (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|) 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|))), 8623#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (<= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4) (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4)) 1) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|))) 0)), 8631#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 4) 1) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|)), 8635#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (+ |ULTIMATE.start_writer_fn_~i~1#1| 1) |ULTIMATE.start_ring_enqueue_~x#1|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|)), 8636#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 0) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|)), 8634#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|)), 8622#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4)) 1) (= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4) 4) (not (= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4)))), 8632#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (< 0 (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 1)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~x#1| 1) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|)), 8626#(and (<= (+ (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) 4 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (+ (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) 4 |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) 1)), 8627#(and (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (+ (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) 4 |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) 1) (<= (+ (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) 4 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (* |ULTIMATE.start_ring_enqueue_#t~mem4#1| 4))), 8625#(and (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (+ (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (not (= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset|) (+ (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) |reader_fnThread1of1ForFork0_#in~arg#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) 4 |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) 1)), 8624#(and (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4)) 1) (<= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|)) 4) (* |ULTIMATE.start_ring_enqueue_#t~mem4#1| 4)) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (+ |reader_fnThread1of1ForFork0_~r~0#1.offset| (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_~r~0#1.base|) |reader_fnThread1of1ForFork0_~r~0#1.offset|))) 0)), 8630#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem7#1| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 4) 1) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|)), 8629#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 4) 1) (<= 4 (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|)), 8628#(and (<= 4 (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (+ (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* 4 (select (select |#memory_int| |reader_fnThread1of1ForFork0_#in~arg#1.base|) |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) 4 |reader_fnThread1of1ForFork0_#in~arg#1.offset|)) 1))] [2022-03-15 18:09:31,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 18:09:31,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:09:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 18:09:31,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2757, Unknown=22, NotChecked=324, Total=3306 [2022-03-15 18:09:31,519 INFO L87 Difference]: Start difference. First operand 312 states and 702 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 33 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:09:35,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:09:35,726 INFO L93 Difference]: Finished difference Result 392 states and 846 transitions. [2022-03-15 18:09:35,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 18:09:35,727 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 33 states have internal predecessors, (74), 0 states have call successors, (0), 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 23 [2022-03-15 18:09:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:09:35,732 INFO L225 Difference]: With dead ends: 392 [2022-03-15 18:09:35,733 INFO L226 Difference]: Without dead ends: 392 [2022-03-15 18:09:35,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 28 SyntacticMatches, 13 SemanticMatches, 92 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2333 ImplicationChecksByTransitivity, 60.9s TimeCoverageRelationStatistics Valid=784, Invalid=7396, Unknown=22, NotChecked=540, Total=8742 [2022-03-15 18:09:35,734 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 197 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:09:35,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 229 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 18:09:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-03-15 18:09:35,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 308. [2022-03-15 18:09:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 305 states have (on average 2.2721311475409838) internal successors, (693), 307 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:09:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 693 transitions. [2022-03-15 18:09:35,740 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 693 transitions. Word has length 23 [2022-03-15 18:09:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:09:35,740 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 693 transitions. [2022-03-15 18:09:35,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 33 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:09:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 693 transitions. [2022-03-15 18:09:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 18:09:35,741 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:09:35,741 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:09:35,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 18:09:35,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:09:35,958 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:09:35,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:09:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1162112141, now seen corresponding path program 6 times [2022-03-15 18:09:35,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:09:35,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546510075] [2022-03-15 18:09:35,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:09:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:09:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:09:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:09:36,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:09:36,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546510075] [2022-03-15 18:09:36,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546510075] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:09:36,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182956034] [2022-03-15 18:09:36,602 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:09:36,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:09:36,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:09:36,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:09:36,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 18:09:36,784 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 18:09:36,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:09:36,786 WARN L261 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 112 conjunts are in the unsatisfiable core [2022-03-15 18:09:36,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:09:36,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:09:36,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-03-15 18:09:36,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:09:36,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 18:09:36,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 18:09:37,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:09:37,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 18:09:37,103 INFO L353 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-03-15 18:09:37,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-03-15 18:09:37,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:09:37,215 INFO L353 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-03-15 18:09:37,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 48 [2022-03-15 18:09:37,438 INFO L353 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-03-15 18:09:37,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 56 [2022-03-15 18:09:37,522 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-15 18:09:37,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 23 [2022-03-15 18:09:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:09:37,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:09:43,502 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_390 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_89| Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_89| 4) 4) v_ArrVal_390)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse0 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4 (* 4 (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|)))))) (not (<= (select .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_89|))))) is different from false [2022-03-15 18:10:28,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 Int) (v_ArrVal_390 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_89| Int)) (let ((.cse6 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse5 (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse7 .cse6) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse5 .cse6 v_ArrVal_388)))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (not (<= (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_89|)) (= (let ((.cse1 (select (store .cse2 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_89| 4) 4) v_ArrVal_390)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse1 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select .cse1 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1)) (let ((.cse4 (+ (select .cse5 .cse6) 1))) (let ((.cse3 (mod .cse4 4))) (and (or (not (<= .cse3 (+ v_ArrVal_388 4))) (not (< .cse4 0)) (= .cse3 0)) (not (<= .cse3 v_ArrVal_388))))))))))) is different from false [2022-03-15 18:10:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 18:10:39,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182956034] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:10:39,849 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:10:39,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 39 [2022-03-15 18:10:39,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [913067091] [2022-03-15 18:10:39,850 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:10:39,852 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:10:39,859 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 87 transitions. [2022-03-15 18:10:39,859 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:10:42,106 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [9898#(and (= (+ |ULTIMATE.start_writer_fn_~i~1#1| 1) |ULTIMATE.start_ring_enqueue_~x#1|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 9900#(and (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) |ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 9899#(and (= (+ |ULTIMATE.start_writer_fn_~i~1#1| 1) |ULTIMATE.start_ring_enqueue_~x#1|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 9897#(and (= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= (+ |ULTIMATE.start_writer_fn_~i~1#1| 1) |ULTIMATE.start_ring_enqueue_~x#1|) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 9891#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 4)) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (not (= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 4) 1) (not (= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) 0))), 9893#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 4)) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 4) 1) (<= 1 |ULTIMATE.start_ring_enqueue_#t~mem4#1|)), 9901#(and (or (<= 1 (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 4)) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 4) 1) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |reader_fnThread1of1ForFork0_~r~0#1.base| |ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (<= 4 (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) |ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= 0 |reader_fnThread1of1ForFork0_~last~0#1|) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|)) (or (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 8 |ULTIMATE.start_writer_fn_~i~1#1|))), 9896#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 4) (+ |ULTIMATE.start_writer_fn_~i~1#1| 1)) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 9895#(and (= |ULTIMATE.start_ring_enqueue_#t~mem7#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 4) (+ |ULTIMATE.start_writer_fn_~i~1#1| 1)) (= |ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |ULTIMATE.start_ring_enqueue_~r#1.base|) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|)), 9892#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 4)) (<= 4 (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= |ULTIMATE.start_ring_enqueue_~r#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) |ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 4) 1)), 9894#(and (<= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 4) 1) (<= 1 (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 4)) (= 0 |reader_fnThread1of1ForFork0_#in~arg#1.offset|) (<= 4 (* (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 4)) (= |ULTIMATE.start_writer_fn_~r~1#1.base| |reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) |ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| |reader_fnThread1of1ForFork0_#in~arg#1.offset|))] [2022-03-15 18:10:42,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 18:10:42,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:10:42,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 18:10:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2248, Unknown=24, NotChecked=194, Total=2652 [2022-03-15 18:10:42,108 INFO L87 Difference]: Start difference. First operand 308 states and 693 transitions. Second operand has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:10:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:10:46,215 INFO L93 Difference]: Finished difference Result 401 states and 869 transitions. [2022-03-15 18:10:46,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 18:10:46,215 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 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 23 [2022-03-15 18:10:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:10:46,217 INFO L225 Difference]: With dead ends: 401 [2022-03-15 18:10:46,217 INFO L226 Difference]: Without dead ends: 401 [2022-03-15 18:10:46,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 31 SyntacticMatches, 12 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1972 ImplicationChecksByTransitivity, 65.1s TimeCoverageRelationStatistics Valid=761, Invalid=6705, Unknown=24, NotChecked=342, Total=7832 [2022-03-15 18:10:46,219 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 208 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:10:46,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 189 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 18:10:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-03-15 18:10:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 299. [2022-03-15 18:10:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 296 states have (on average 2.2567567567567566) internal successors, (668), 298 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:10:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 668 transitions. [2022-03-15 18:10:46,225 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 668 transitions. Word has length 23 [2022-03-15 18:10:46,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:10:46,225 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 668 transitions. [2022-03-15 18:10:46,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:10:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 668 transitions. [2022-03-15 18:10:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:10:46,226 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:10:46,226 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:10:46,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 18:10:46,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 18:10:46,442 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 18:10:46,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:10:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash 339940476, now seen corresponding path program 7 times [2022-03-15 18:10:46,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:10:46,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606862742] [2022-03-15 18:10:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:10:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:10:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:10:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:10:47,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:10:47,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606862742] [2022-03-15 18:10:47,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606862742] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:10:47,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054379828] [2022-03-15 18:10:47,080 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:10:47,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:10:47,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:10:47,081 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:10:47,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 18:10:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:10:47,158 WARN L261 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 112 conjunts are in the unsatisfiable core [2022-03-15 18:10:47,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:10:47,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:10:47,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-03-15 18:10:47,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:10:47,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 18:10:47,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 18:10:47,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:10:47,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 18:10:47,424 INFO L353 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-03-15 18:10:47,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-03-15 18:10:47,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:10:47,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:10:47,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:10:47,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-03-15 18:10:47,664 INFO L353 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-03-15 18:10:47,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 51 [2022-03-15 18:10:47,782 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-15 18:10:47,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-03-15 18:10:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:10:47,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:10:50,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_109| Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_109|)) (forall ((v_ArrVal_446 Int)) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_109| 4) 4) v_ArrVal_446)) |c_reader_fnThread1of1ForFork0_#in~arg#1.base|))) (select .cse0 (+ (* 4 (select .cse0 |c_reader_fnThread1of1ForFork0_#in~arg#1.offset|)) 4 |c_reader_fnThread1of1ForFork0_#in~arg#1.offset|))) 1)))) is different from false [2022-03-15 18:10:59,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_109| Int) (v_ArrVal_446 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) v_ArrVal_445)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_109| 4) 4) v_ArrVal_446)) |c_reader_fnThread1of1ForFork0_#in~arg#1.base|))) (select .cse0 (+ (* (select .cse0 |c_reader_fnThread1of1ForFork0_#in~arg#1.offset|) 4) 4 |c_reader_fnThread1of1ForFork0_#in~arg#1.offset|))) 1) (not (<= (select .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_109|)) (let ((.cse3 (+ |c_ULTIMATE.start_ring_enqueue_#t~mem7#1| 1))) (let ((.cse4 (mod .cse3 4))) (and (or (not (< .cse3 0)) (= .cse4 0) (not (<= .cse4 (+ v_ArrVal_445 4)))) (not (<= .cse4 v_ArrVal_445))))))))) is different from false [2022-03-15 18:11:01,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_109| Int) (v_ArrVal_446 Int)) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse6 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse5 .cse6 v_ArrVal_445)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_109| 4) 4) v_ArrVal_446)) |c_reader_fnThread1of1ForFork0_#in~arg#1.base|))) (select .cse0 (+ (* (select .cse0 |c_reader_fnThread1of1ForFork0_#in~arg#1.offset|) 4) 4 |c_reader_fnThread1of1ForFork0_#in~arg#1.offset|))) 1) (let ((.cse4 (+ (select .cse5 .cse6) 1))) (let ((.cse3 (mod .cse4 4))) (and (not (<= .cse3 v_ArrVal_445)) (or (not (<= .cse3 (+ v_ArrVal_445 4))) (not (< .cse4 0)) (= .cse3 0))))) (not (<= (select .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_109|))))))) is different from false [2022-03-15 18:11:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-03-15 18:11:28,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054379828] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:11:28,663 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:11:28,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 40 [2022-03-15 18:11:28,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [347495788] [2022-03-15 18:11:28,663 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:11:28,666 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:11:28,675 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 90 transitions. [2022-03-15 18:11:28,675 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:12:01,081 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:12:01,091 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:12:01,112 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:12:01,120 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:12:01,146 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:12:01,148 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:12:01,149 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:12:01,153 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:13:40,376 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:13:40,381 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:13:40,392 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:13:40,399 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:13:40,403 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:13:40,414 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:14:48,283 WARN L228 SmtUtils]: Spent 8.41s on a formula simplification. DAG size of input: 248 DAG size of output: 238 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:15:36,051 WARN L228 SmtUtils]: Spent 17.57s on a formula simplification. DAG size of input: 380 DAG size of output: 364 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:16:37,050 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:16:37,053 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2022-03-15 18:16:37,094 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:16:37,098 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2022-03-15 18:16:37,183 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2022-03-15 18:16:37,186 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:16:37,187 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2022-03-15 18:16:37,397 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:16:37,399 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2022-03-15 18:16:37,404 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:16:37,405 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2022-03-15 18:16:37,408 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:16:37,408 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:16:37,408 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:16:37,411 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2022-03-15 18:16:37,416 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:16:37,418 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2022-03-15 18:16:37,462 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:16:37,464 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2022-03-15 18:16:37,465 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2022-03-15 18:16:37,466 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2022-03-15 18:16:37,466 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:16:37,467 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2022-03-15 18:16:37,481 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:16:37,482 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2022-03-15 18:16:37,529 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2022-03-15 18:16:37,584 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2022-03-15 18:16:37,587 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:16:37,588 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2022-03-15 18:16:37,603 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:16:37,605 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:16:37,606 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-03-15 18:16:37,607 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2022-03-15 18:16:37,612 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:16:37,617 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2022-03-15 18:16:37,789 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:16:37,791 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-03-15 18:16:37,792 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2022-03-15 18:16:37,812 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 Received shutdown request... [2022-03-15 18:19:52,606 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-03-15 18:19:52,607 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 18:19:52,625 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-03-15 18:19:52,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 18:19:52,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:19:52,856 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2,while PolyPacSimplificationTermWalker was simplifying a ∧-2619-16-1 term,while PolyPacSimplificationTermWalker was simplifying 11 xjuncts wrt. a ∧-2618-16-1 context. [2022-03-15 18:19:52,858 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-03-15 18:19:52,858 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-03-15 18:19:52,858 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-03-15 18:19:52,858 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 7 remaining) [2022-03-15 18:19:52,858 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-03-15 18:19:52,858 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-03-15 18:19:52,860 INFO L732 BasicCegarLoop]: Path program histogram: [7, 3, 1, 1, 1, 1] [2022-03-15 18:19:52,863 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 18:19:52,863 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 18:19:52,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 06:19:52 BasicIcfg [2022-03-15 18:19:52,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 18:19:52,864 INFO L158 Benchmark]: Toolchain (without parser) took 857291.47ms. Allocated memory was 185.6MB in the beginning and 488.6MB in the end (delta: 303.0MB). Free memory was 127.1MB in the beginning and 403.5MB in the end (delta: -276.4MB). Peak memory consumption was 286.5MB. Max. memory is 8.0GB. [2022-03-15 18:19:52,865 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 18:19:52,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.84ms. Allocated memory was 185.6MB in the beginning and 234.9MB in the end (delta: 49.3MB). Free memory was 126.9MB in the beginning and 190.5MB in the end (delta: -63.5MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-03-15 18:19:52,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.25ms. Allocated memory is still 234.9MB. Free memory was 190.5MB in the beginning and 187.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:19:52,865 INFO L158 Benchmark]: Boogie Preprocessor took 38.71ms. Allocated memory is still 234.9MB. Free memory was 187.8MB in the beginning and 186.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:19:52,865 INFO L158 Benchmark]: RCFGBuilder took 370.85ms. Allocated memory is still 234.9MB. Free memory was 186.3MB in the beginning and 170.5MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 18:19:52,865 INFO L158 Benchmark]: TraceAbstraction took 856388.16ms. Allocated memory was 234.9MB in the beginning and 488.6MB in the end (delta: 253.8MB). Free memory was 170.0MB in the beginning and 403.5MB in the end (delta: -233.5MB). Peak memory consumption was 281.9MB. Max. memory is 8.0GB. [2022-03-15 18:19:52,866 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.09ms. Allocated memory is still 185.6MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 435.84ms. Allocated memory was 185.6MB in the beginning and 234.9MB in the end (delta: 49.3MB). Free memory was 126.9MB in the beginning and 190.5MB in the end (delta: -63.5MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.25ms. Allocated memory is still 234.9MB. Free memory was 190.5MB in the beginning and 187.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.71ms. Allocated memory is still 234.9MB. Free memory was 187.8MB in the beginning and 186.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 370.85ms. Allocated memory is still 234.9MB. Free memory was 186.3MB in the beginning and 170.5MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 856388.16ms. Allocated memory was 234.9MB in the beginning and 488.6MB in the end (delta: 253.8MB). Free memory was 170.0MB in the beginning and 403.5MB in the end (delta: -233.5MB). Peak memory consumption was 281.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 152 PlacesBefore, 30 PlacesAfterwards, 158 TransitionsBefore, 32 TransitionsAfterwards, 6150 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 96 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 150 TotalNumberOfCompositions, 7583 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5631, positive: 5471, positive conditional: 0, positive unconditional: 5471, negative: 160, negative conditional: 0, negative unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3407, positive: 3356, positive conditional: 0, positive unconditional: 3356, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5631, positive: 2115, positive conditional: 0, positive unconditional: 2115, negative: 109, negative conditional: 0, negative unconditional: 109, unknown: 3407, unknown conditional: 0, unknown unconditional: 3407] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - 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: 832]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2,while PolyPacSimplificationTermWalker was simplifying a ∧-2619-16-1 term,while PolyPacSimplificationTermWalker was simplifying 11 xjuncts wrt. a ∧-2618-16-1 context. - TimeoutResultAtElement [Line: 836]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2,while PolyPacSimplificationTermWalker was simplifying a ∧-2619-16-1 term,while PolyPacSimplificationTermWalker was simplifying 11 xjuncts wrt. a ∧-2618-16-1 context. - TimeoutResultAtElement [Line: 837]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2,while PolyPacSimplificationTermWalker was simplifying a ∧-2619-16-1 term,while PolyPacSimplificationTermWalker was simplifying 11 xjuncts wrt. a ∧-2618-16-1 context. - TimeoutResultAtElement [Line: 854]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2,while PolyPacSimplificationTermWalker was simplifying a ∧-2619-16-1 term,while PolyPacSimplificationTermWalker was simplifying 11 xjuncts wrt. a ∧-2618-16-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 220 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 856.2s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1238 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1238 mSDsluCounter, 1081 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1257 mSDsCounter, 504 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11582 IncrementalHoareTripleChecker+Invalid, 12086 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 504 mSolverCounterUnsat, 99 mSDtfsCounter, 11582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 786 GetRequests, 205 SyntacticMatches, 47 SemanticMatches, 534 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 9623 ImplicationChecksByTransitivity, 281.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=11, InterpolantAutomatonStates: 309, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 630 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 272.5s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 421 ConstructedInterpolants, 74 QuantifiedInterpolants, 25330 SizeOfPredicates, 175 NumberOfNonLiveVariables, 1084 ConjunctsInSsa, 471 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 0/66 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