./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:17:57,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:17:57,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:17:57,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:17:57,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:17:57,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:17:57,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:17:57,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:17:57,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:17:57,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:17:57,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:17:57,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:17:57,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:17:57,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:17:57,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:17:57,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:17:57,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:17:57,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:17:57,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:17:57,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:17:57,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:17:57,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:17:57,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:17:57,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:17:57,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:17:57,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:17:57,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:17:57,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:17:57,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:17:57,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:17:57,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:17:57,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:17:57,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:17:57,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:17:57,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:17:57,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:17:57,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:17:57,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:17:57,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:17:57,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:17:57,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:17:57,719 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 05:17:57,763 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:17:57,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:17:57,764 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:17:57,765 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:17:57,765 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:17:57,765 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:17:57,765 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:17:57,766 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:17:57,766 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:17:57,766 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:17:57,766 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:17:57,766 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:17:57,767 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:17:57,767 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:17:57,767 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:17:57,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:17:57,768 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:17:57,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:17:57,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:17:57,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:17:57,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 05:17:57,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:17:57,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 05:17:57,770 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:17:57,770 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:17:57,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 05:17:57,771 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:17:57,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 05:17:57,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:17:57,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:17:57,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:17:57,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:17:57,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:17:57,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 05:17:57,773 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:17:57,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:17:57,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 05:17:57,774 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:17:57,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:17:57,774 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b [2021-11-03 05:17:58,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:17:58,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:17:58,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:17:58,081 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:17:58,082 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:17:58,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2021-11-03 05:17:58,192 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/data/c1550b839/8a19c4af2156494683b3ab77645d7cfb/FLAG82279a07f [2021-11-03 05:17:58,930 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:17:58,930 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2021-11-03 05:17:58,945 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/data/c1550b839/8a19c4af2156494683b3ab77645d7cfb/FLAG82279a07f [2021-11-03 05:17:59,185 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/data/c1550b839/8a19c4af2156494683b3ab77645d7cfb [2021-11-03 05:17:59,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:17:59,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:17:59,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:17:59,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:17:59,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:17:59,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:17:59,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aaf9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59, skipping insertion in model container [2021-11-03 05:17:59,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:17:59,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:17:59,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:17:59,478 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-03 05:17:59,769 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39095,39108] [2021-11-03 05:17:59,774 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39180,39193] [2021-11-03 05:17:59,775 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39232,39245] [2021-11-03 05:17:59,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:17:59,797 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:17:59,810 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-03 05:17:59,841 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39095,39108] [2021-11-03 05:17:59,842 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39180,39193] [2021-11-03 05:17:59,843 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39232,39245] [2021-11-03 05:17:59,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:17:59,908 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:17:59,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59 WrapperNode [2021-11-03 05:17:59,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:17:59,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:17:59,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:17:59,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:17:59,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:17:59,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:17:59,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:17:59,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:17:59,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:17:59,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:17:59,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:17:59,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:17:59,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:17:59,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:17:59,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:17:59,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:17:59,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:18:00,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:18:00,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:18:00,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:18:00,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:18:00,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59" (1/1) ... [2021-11-03 05:18:00,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:18:00,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:18:00,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:18:00,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:18:00,094 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2021-11-03 05:18:00,095 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2021-11-03 05:18:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:18:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:18:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 05:18:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 05:18:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 05:18:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:18:00,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:18:00,098 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-03 05:18:00,641 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:18:00,642 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-11-03 05:18:00,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:18:00 BoogieIcfgContainer [2021-11-03 05:18:00,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:18:00,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:18:00,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:18:00,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:18:00,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:17:59" (1/3) ... [2021-11-03 05:18:00,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13830d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:18:00, skipping insertion in model container [2021-11-03 05:18:00,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:17:59" (2/3) ... [2021-11-03 05:18:00,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13830d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:18:00, skipping insertion in model container [2021-11-03 05:18:00,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:18:00" (3/3) ... [2021-11-03 05:18:00,669 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2021-11-03 05:18:00,678 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-03 05:18:00,678 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:18:00,678 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-11-03 05:18:00,679 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-03 05:18:00,736 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,737 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,739 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,739 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,741 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,742 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,743 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,743 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,744 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,744 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,744 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,744 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,744 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,745 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,745 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,745 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,745 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,746 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,747 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,747 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,748 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,748 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,749 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,749 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,749 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,750 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,750 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,750 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,750 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,751 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,751 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,751 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,751 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,752 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,752 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,752 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,752 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,754 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,754 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,754 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,755 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,755 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,755 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,755 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,756 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,756 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,756 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,757 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,757 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,757 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,757 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,757 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,758 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,758 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,758 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,758 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,758 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,759 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,759 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,759 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,760 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,760 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,760 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,760 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,760 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,761 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,761 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,761 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,762 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,762 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,762 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,762 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,762 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,763 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,763 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,763 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,764 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,764 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,765 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,768 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,768 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,768 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,769 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,769 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,770 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,770 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,770 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,770 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,776 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,776 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,777 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,777 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,777 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,777 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,777 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,778 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,778 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,778 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,778 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,779 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,779 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,779 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,779 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,779 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,779 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,780 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,780 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,780 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,780 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,780 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,781 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,781 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,781 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,781 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,781 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,782 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,782 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,782 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,783 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,784 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,784 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,784 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,784 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,784 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,785 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,785 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,785 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,785 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,785 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,786 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,786 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,787 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,787 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,787 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,787 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,787 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,788 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,788 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,788 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,788 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,789 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,789 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,789 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,789 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,789 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,790 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,790 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,791 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,791 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,791 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,791 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,791 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,793 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,794 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,794 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,794 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,794 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,794 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,795 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,795 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,795 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,795 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,796 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,796 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,797 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,797 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,798 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,798 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,798 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,798 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,798 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,799 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,799 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,799 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,799 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,799 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,800 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,800 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,800 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,800 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,801 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,801 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,801 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,801 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,801 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,802 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,802 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,802 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,802 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,802 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,803 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,803 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,803 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,807 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,808 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,808 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,808 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,808 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,809 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,809 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,809 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,809 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,810 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,810 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,810 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,811 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,816 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,816 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,816 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,816 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,817 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,817 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,817 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,818 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,818 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,820 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,820 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,821 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,821 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,821 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,821 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,822 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,822 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,822 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,822 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,822 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,823 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,824 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,824 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,824 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,824 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,825 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,825 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,825 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,826 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,834 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,835 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,835 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,835 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,835 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,836 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,836 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,836 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,837 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,837 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,837 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,838 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,838 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,838 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,838 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,838 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,839 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,839 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,839 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,839 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,839 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,845 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,845 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,846 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,846 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,846 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,846 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,847 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,847 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,847 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,847 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,848 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,848 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,848 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,848 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,849 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,849 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,849 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,849 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,849 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,850 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,850 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,850 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,850 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,851 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,851 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,851 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,851 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,852 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,852 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:18:00,862 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-11-03 05:18:00,927 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:18:00,934 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:18:00,934 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-03 05:18:00,952 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-03 05:18:00,965 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 142 transitions, 292 flow [2021-11-03 05:18:00,969 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 142 transitions, 292 flow [2021-11-03 05:18:00,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 136 places, 142 transitions, 292 flow [2021-11-03 05:18:01,035 INFO L129 PetriNetUnfolder]: 10/141 cut-off events. [2021-11-03 05:18:01,036 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-11-03 05:18:01,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 141 events. 10/141 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 250 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2021-11-03 05:18:01,052 INFO L116 LiptonReduction]: Number of co-enabled transitions 5106 [2021-11-03 05:18:06,465 INFO L131 LiptonReduction]: Checked pairs total: 6548 [2021-11-03 05:18:06,465 INFO L133 LiptonReduction]: Total number of compositions: 133 [2021-11-03 05:18:06,475 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 32 transitions, 72 flow [2021-11-03 05:18:06,497 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) [2021-11-03 05:18:06,500 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) [2021-11-03 05:18:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 05:18:06,506 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:06,507 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 05:18:06,507 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)] === [2021-11-03 05:18:06,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash 535163888, now seen corresponding path program 1 times [2021-11-03 05:18:06,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:06,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805190736] [2021-11-03 05:18:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:06,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:06,730 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:06,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805190736] [2021-11-03 05:18:06,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805190736] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:06,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:06,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:18:06,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445568416] [2021-11-03 05:18:06,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 05:18:06,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:06,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 05:18:06,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 05:18:06,759 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) [2021-11-03 05:18:06,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:06,780 INFO L93 Difference]: Finished difference Result 119 states and 258 transitions. [2021-11-03 05:18:06,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 05:18:06,782 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 [2021-11-03 05:18:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:06,794 INFO L225 Difference]: With dead ends: 119 [2021-11-03 05:18:06,795 INFO L226 Difference]: Without dead ends: 119 [2021-11-03 05:18:06,796 INFO L786 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 [2021-11-03 05:18:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-03 05:18:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-11-03 05:18:06,842 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) [2021-11-03 05:18:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 258 transitions. [2021-11-03 05:18:06,848 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 258 transitions. Word has length 5 [2021-11-03 05:18:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:06,848 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 258 transitions. [2021-11-03 05:18:06,849 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) [2021-11-03 05:18:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 258 transitions. [2021-11-03 05:18:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:18:06,850 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:06,850 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:18:06,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:18:06,851 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)] === [2021-11-03 05:18:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash -589791439, now seen corresponding path program 1 times [2021-11-03 05:18:06,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:06,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309149731] [2021-11-03 05:18:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:06,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:06,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:06,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309149731] [2021-11-03 05:18:06,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309149731] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:06,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:06,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:18:06,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715060004] [2021-11-03 05:18:06,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:18:06,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:18:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:18:06,935 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) [2021-11-03 05:18:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:06,957 INFO L93 Difference]: Finished difference Result 191 states and 419 transitions. [2021-11-03 05:18:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:18:06,958 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 [2021-11-03 05:18:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:06,961 INFO L225 Difference]: With dead ends: 191 [2021-11-03 05:18:06,962 INFO L226 Difference]: Without dead ends: 191 [2021-11-03 05:18:06,963 INFO L786 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 [2021-11-03 05:18:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-03 05:18:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 146. [2021-11-03 05:18:06,992 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) [2021-11-03 05:18:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 324 transitions. [2021-11-03 05:18:06,996 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 324 transitions. Word has length 6 [2021-11-03 05:18:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:06,996 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 324 transitions. [2021-11-03 05:18:06,996 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) [2021-11-03 05:18:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 324 transitions. [2021-11-03 05:18:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 05:18:06,998 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:06,998 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:06,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:18:06,999 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)] === [2021-11-03 05:18:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:06,999 INFO L85 PathProgramCache]: Analyzing trace with hash -129604502, now seen corresponding path program 1 times [2021-11-03 05:18:07,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:07,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117049507] [2021-11-03 05:18:07,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:07,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:07,283 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:07,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117049507] [2021-11-03 05:18:07,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117049507] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:07,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:07,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:18:07,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036520057] [2021-11-03 05:18:07,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:18:07,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:07,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:18:07,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:18:07,287 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) [2021-11-03 05:18:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:07,627 INFO L93 Difference]: Finished difference Result 173 states and 374 transitions. [2021-11-03 05:18:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:18:07,628 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 [2021-11-03 05:18:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:07,633 INFO L225 Difference]: With dead ends: 173 [2021-11-03 05:18:07,633 INFO L226 Difference]: Without dead ends: 154 [2021-11-03 05:18:07,634 INFO L786 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 [2021-11-03 05:18:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-11-03 05:18:07,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-11-03 05:18:07,659 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) [2021-11-03 05:18:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 342 transitions. [2021-11-03 05:18:07,661 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 342 transitions. Word has length 10 [2021-11-03 05:18:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:07,661 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 342 transitions. [2021-11-03 05:18:07,662 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) [2021-11-03 05:18:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 342 transitions. [2021-11-03 05:18:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 05:18:07,663 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:07,670 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:07,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 05:18:07,671 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)] === [2021-11-03 05:18:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash 283947636, now seen corresponding path program 1 times [2021-11-03 05:18:07,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:07,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575465152] [2021-11-03 05:18:07,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:07,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:08,435 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:08,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575465152] [2021-11-03 05:18:08,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575465152] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:08,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:08,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-03 05:18:08,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413908470] [2021-11-03 05:18:08,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:18:08,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:08,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:18:08,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:18:08,438 INFO L87 Difference]: Start difference. First operand 154 states and 342 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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) [2021-11-03 05:18:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:09,648 INFO L93 Difference]: Finished difference Result 185 states and 397 transitions. [2021-11-03 05:18:09,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:18:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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 [2021-11-03 05:18:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:09,651 INFO L225 Difference]: With dead ends: 185 [2021-11-03 05:18:09,651 INFO L226 Difference]: Without dead ends: 175 [2021-11-03 05:18:09,652 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2021-11-03 05:18:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-03 05:18:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-11-03 05:18:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 172 states have (on average 2.2325581395348837) internal successors, (384), 174 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:18:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 384 transitions. [2021-11-03 05:18:09,681 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 384 transitions. Word has length 16 [2021-11-03 05:18:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:09,682 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 384 transitions. [2021-11-03 05:18:09,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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) [2021-11-03 05:18:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 384 transitions. [2021-11-03 05:18:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 05:18:09,685 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:09,685 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:09,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 05:18:09,686 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)] === [2021-11-03 05:18:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2051589672, now seen corresponding path program 2 times [2021-11-03 05:18:09,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:09,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105928984] [2021-11-03 05:18:09,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:09,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:10,232 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:10,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105928984] [2021-11-03 05:18:10,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105928984] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:10,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:10,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-03 05:18:10,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050999027] [2021-11-03 05:18:10,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:18:10,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:10,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:18:10,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:18:10,234 INFO L87 Difference]: Start difference. First operand 175 states and 384 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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) [2021-11-03 05:18:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:11,561 INFO L93 Difference]: Finished difference Result 203 states and 433 transitions. [2021-11-03 05:18:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-03 05:18:11,562 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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 [2021-11-03 05:18:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:11,563 INFO L225 Difference]: With dead ends: 203 [2021-11-03 05:18:11,564 INFO L226 Difference]: Without dead ends: 193 [2021-11-03 05:18:11,564 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2021-11-03 05:18:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-03 05:18:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2021-11-03 05:18:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 169 states have (on average 2.2366863905325443) internal successors, (378), 171 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:18:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 378 transitions. [2021-11-03 05:18:11,586 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 378 transitions. Word has length 16 [2021-11-03 05:18:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:11,587 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 378 transitions. [2021-11-03 05:18:11,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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) [2021-11-03 05:18:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 378 transitions. [2021-11-03 05:18:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 05:18:11,595 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:11,595 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:11,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 05:18:11,596 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)] === [2021-11-03 05:18:11,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash 192189236, now seen corresponding path program 3 times [2021-11-03 05:18:11,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:11,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318179140] [2021-11-03 05:18:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:11,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:12,086 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:12,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318179140] [2021-11-03 05:18:12,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318179140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:12,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:12,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-03 05:18:12,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551261625] [2021-11-03 05:18:12,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:18:12,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:18:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:18:12,089 INFO L87 Difference]: Start difference. First operand 172 states and 378 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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) [2021-11-03 05:18:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:13,388 INFO L93 Difference]: Finished difference Result 194 states and 415 transitions. [2021-11-03 05:18:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-03 05:18:13,392 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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 [2021-11-03 05:18:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:13,393 INFO L225 Difference]: With dead ends: 194 [2021-11-03 05:18:13,393 INFO L226 Difference]: Without dead ends: 184 [2021-11-03 05:18:13,394 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2021-11-03 05:18:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-03 05:18:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2021-11-03 05:18:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 163 states have (on average 2.245398773006135) internal successors, (366), 165 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:18:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 366 transitions. [2021-11-03 05:18:13,402 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 366 transitions. Word has length 16 [2021-11-03 05:18:13,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:13,402 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 366 transitions. [2021-11-03 05:18:13,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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) [2021-11-03 05:18:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 366 transitions. [2021-11-03 05:18:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 05:18:13,403 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:13,404 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:13,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 05:18:13,404 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)] === [2021-11-03 05:18:13,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1998749784, now seen corresponding path program 4 times [2021-11-03 05:18:13,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:13,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930295816] [2021-11-03 05:18:13,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:13,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:13,734 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:13,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930295816] [2021-11-03 05:18:13,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930295816] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:13,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:13,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-03 05:18:13,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145339427] [2021-11-03 05:18:13,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-03 05:18:13,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-03 05:18:13,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:18:13,737 INFO L87 Difference]: Start difference. First operand 166 states and 366 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) [2021-11-03 05:18:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:15,115 INFO L93 Difference]: Finished difference Result 184 states and 391 transitions. [2021-11-03 05:18:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-03 05:18:15,115 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 [2021-11-03 05:18:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:15,117 INFO L225 Difference]: With dead ends: 184 [2021-11-03 05:18:15,118 INFO L226 Difference]: Without dead ends: 174 [2021-11-03 05:18:15,119 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2021-11-03 05:18:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-11-03 05:18:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 162. [2021-11-03 05:18:15,137 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) [2021-11-03 05:18:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 354 transitions. [2021-11-03 05:18:15,139 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 354 transitions. Word has length 16 [2021-11-03 05:18:15,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:15,139 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 354 transitions. [2021-11-03 05:18:15,140 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) [2021-11-03 05:18:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 354 transitions. [2021-11-03 05:18:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 05:18:15,144 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:15,144 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:15,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 05:18:15,145 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)] === [2021-11-03 05:18:15,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2061745837, now seen corresponding path program 1 times [2021-11-03 05:18:15,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:15,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984420738] [2021-11-03 05:18:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:15,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:15,819 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:15,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984420738] [2021-11-03 05:18:15,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984420738] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:15,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:15,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-03 05:18:15,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691883460] [2021-11-03 05:18:15,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:18:15,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:15,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:18:15,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:18:15,821 INFO L87 Difference]: Start difference. First operand 162 states and 354 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) [2021-11-03 05:18:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:16,668 INFO L93 Difference]: Finished difference Result 241 states and 527 transitions. [2021-11-03 05:18:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:18:16,669 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 [2021-11-03 05:18:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:16,671 INFO L225 Difference]: With dead ends: 241 [2021-11-03 05:18:16,671 INFO L226 Difference]: Without dead ends: 241 [2021-11-03 05:18:16,672 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2021-11-03 05:18:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-03 05:18:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 229. [2021-11-03 05:18:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 226 states have (on average 2.2168141592920354) internal successors, (501), 228 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:18:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 501 transitions. [2021-11-03 05:18:16,683 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 501 transitions. Word has length 18 [2021-11-03 05:18:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:16,684 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 501 transitions. [2021-11-03 05:18:16,685 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) [2021-11-03 05:18:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 501 transitions. [2021-11-03 05:18:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 05:18:16,686 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:16,686 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:16,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 05:18:16,687 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 05:18:16,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash -245203017, now seen corresponding path program 2 times [2021-11-03 05:18:16,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:16,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065415072] [2021-11-03 05:18:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:16,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:17,330 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:17,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065415072] [2021-11-03 05:18:17,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065415072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:17,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:17,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-03 05:18:17,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699383151] [2021-11-03 05:18:17,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:18:17,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:18:17,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:18:17,332 INFO L87 Difference]: Start difference. First operand 229 states and 501 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) [2021-11-03 05:18:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:18,192 INFO L93 Difference]: Finished difference Result 305 states and 668 transitions. [2021-11-03 05:18:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:18:18,192 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 [2021-11-03 05:18:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:18,195 INFO L225 Difference]: With dead ends: 305 [2021-11-03 05:18:18,195 INFO L226 Difference]: Without dead ends: 305 [2021-11-03 05:18:18,196 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2021-11-03 05:18:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-11-03 05:18:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 226. [2021-11-03 05:18:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 223 states have (on average 2.219730941704036) internal successors, (495), 225 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:18:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 495 transitions. [2021-11-03 05:18:18,207 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 495 transitions. Word has length 18 [2021-11-03 05:18:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:18,207 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 495 transitions. [2021-11-03 05:18:18,207 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) [2021-11-03 05:18:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 495 transitions. [2021-11-03 05:18:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 05:18:18,209 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:18,209 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:18,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 05:18:18,209 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)] === [2021-11-03 05:18:18,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash -47255021, now seen corresponding path program 3 times [2021-11-03 05:18:18,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:18,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683663994] [2021-11-03 05:18:18,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:18,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:18,823 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:18,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683663994] [2021-11-03 05:18:18,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683663994] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:18,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:18,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-03 05:18:18,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923147194] [2021-11-03 05:18:18,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:18:18,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:18,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:18:18,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:18:18,825 INFO L87 Difference]: Start difference. First operand 226 states and 495 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) [2021-11-03 05:18:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:19,962 INFO L93 Difference]: Finished difference Result 296 states and 650 transitions. [2021-11-03 05:18:19,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:18:19,963 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 [2021-11-03 05:18:19,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:19,966 INFO L225 Difference]: With dead ends: 296 [2021-11-03 05:18:19,966 INFO L226 Difference]: Without dead ends: 296 [2021-11-03 05:18:19,968 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2021-11-03 05:18:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-11-03 05:18:19,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 217. [2021-11-03 05:18:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 214 states have (on average 2.2289719626168223) internal successors, (477), 216 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:18:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 477 transitions. [2021-11-03 05:18:19,983 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 477 transitions. Word has length 18 [2021-11-03 05:18:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:19,985 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 477 transitions. [2021-11-03 05:18:19,986 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) [2021-11-03 05:18:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 477 transitions. [2021-11-03 05:18:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 05:18:19,987 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:19,987 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:19,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 05:18:19,987 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)] === [2021-11-03 05:18:19,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash 890644023, now seen corresponding path program 4 times [2021-11-03 05:18:19,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:19,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584645181] [2021-11-03 05:18:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:19,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:20,685 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:20,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584645181] [2021-11-03 05:18:20,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584645181] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:20,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:20,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-03 05:18:20,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022585049] [2021-11-03 05:18:20,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:18:20,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:20,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:18:20,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:18:20,688 INFO L87 Difference]: Start difference. First operand 217 states and 477 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) [2021-11-03 05:18:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:21,519 INFO L93 Difference]: Finished difference Result 281 states and 620 transitions. [2021-11-03 05:18:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:18:21,519 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 [2021-11-03 05:18:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:21,522 INFO L225 Difference]: With dead ends: 281 [2021-11-03 05:18:21,522 INFO L226 Difference]: Without dead ends: 281 [2021-11-03 05:18:21,523 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-11-03 05:18:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-11-03 05:18:21,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 214. [2021-11-03 05:18:21,530 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) [2021-11-03 05:18:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 471 transitions. [2021-11-03 05:18:21,532 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 471 transitions. Word has length 18 [2021-11-03 05:18:21,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:21,533 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 471 transitions. [2021-11-03 05:18:21,533 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) [2021-11-03 05:18:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 471 transitions. [2021-11-03 05:18:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 05:18:21,534 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:21,534 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:21,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 05:18:21,535 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)] === [2021-11-03 05:18:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1555020115, now seen corresponding path program 5 times [2021-11-03 05:18:21,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:21,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136633881] [2021-11-03 05:18:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:21,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:22,063 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:22,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136633881] [2021-11-03 05:18:22,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136633881] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:22,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:22,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-03 05:18:22,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226147954] [2021-11-03 05:18:22,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:18:22,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:18:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:18:22,064 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) [2021-11-03 05:18:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:22,831 INFO L93 Difference]: Finished difference Result 272 states and 602 transitions. [2021-11-03 05:18:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:18:22,831 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 [2021-11-03 05:18:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:22,833 INFO L225 Difference]: With dead ends: 272 [2021-11-03 05:18:22,833 INFO L226 Difference]: Without dead ends: 272 [2021-11-03 05:18:22,834 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2021-11-03 05:18:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-03 05:18:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 208. [2021-11-03 05:18:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 205 states have (on average 2.2390243902439027) internal successors, (459), 207 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:18:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 459 transitions. [2021-11-03 05:18:22,843 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 459 transitions. Word has length 18 [2021-11-03 05:18:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:22,844 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 459 transitions. [2021-11-03 05:18:22,844 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) [2021-11-03 05:18:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 459 transitions. [2021-11-03 05:18:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 05:18:22,845 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:22,845 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:22,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 05:18:22,846 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)] === [2021-11-03 05:18:22,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:22,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1059235565, now seen corresponding path program 6 times [2021-11-03 05:18:22,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:22,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23730334] [2021-11-03 05:18:22,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:22,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:23,369 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:23,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23730334] [2021-11-03 05:18:23,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23730334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:18:23,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:18:23,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-03 05:18:23,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104840721] [2021-11-03 05:18:23,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:18:23,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:23,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:18:23,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:18:23,371 INFO L87 Difference]: Start difference. First operand 208 states and 459 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) [2021-11-03 05:18:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:24,395 INFO L93 Difference]: Finished difference Result 348 states and 772 transitions. [2021-11-03 05:18:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-03 05:18:24,396 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 [2021-11-03 05:18:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:24,399 INFO L225 Difference]: With dead ends: 348 [2021-11-03 05:18:24,399 INFO L226 Difference]: Without dead ends: 348 [2021-11-03 05:18:24,399 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2021-11-03 05:18:24,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-11-03 05:18:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 214. [2021-11-03 05:18:24,408 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) [2021-11-03 05:18:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 472 transitions. [2021-11-03 05:18:24,410 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 472 transitions. Word has length 18 [2021-11-03 05:18:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:24,411 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 472 transitions. [2021-11-03 05:18:24,411 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) [2021-11-03 05:18:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 472 transitions. [2021-11-03 05:18:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-03 05:18:24,412 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:24,412 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:24,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 05:18:24,413 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 05:18:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:24,414 INFO L85 PathProgramCache]: Analyzing trace with hash 857612350, now seen corresponding path program 1 times [2021-11-03 05:18:24,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:24,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290445881] [2021-11-03 05:18:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:24,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:24,452 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:24,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290445881] [2021-11-03 05:18:24,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290445881] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:18:24,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495810940] [2021-11-03 05:18:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:24,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:18:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:18:24,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:18:24,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 05:18:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:24,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-03 05:18:24,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:18:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:24,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:18:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:24,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495810940] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:18:24,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1293587788] [2021-11-03 05:18:24,859 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:18:24,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:18:24,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-03 05:18:24,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344186306] [2021-11-03 05:18:24,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:18:24,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:18:24,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:18:24,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:18:24,874 INFO L87 Difference]: Start difference. First operand 214 states and 472 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:18:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:24,900 INFO L93 Difference]: Finished difference Result 398 states and 879 transitions. [2021-11-03 05:18:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:18:24,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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 [2021-11-03 05:18:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:24,907 INFO L225 Difference]: With dead ends: 398 [2021-11-03 05:18:24,907 INFO L226 Difference]: Without dead ends: 398 [2021-11-03 05:18:24,907 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:18:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-03 05:18:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 374. [2021-11-03 05:18:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 371 states have (on average 2.2964959568733154) internal successors, (852), 373 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:18:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 852 transitions. [2021-11-03 05:18:24,924 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 852 transitions. Word has length 21 [2021-11-03 05:18:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:24,924 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 852 transitions. [2021-11-03 05:18:24,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:18:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 852 transitions. [2021-11-03 05:18:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-03 05:18:24,927 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:24,928 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:18:24,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 05:18:25,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:18:25,141 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 05:18:25,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash -4688670, now seen corresponding path program 7 times [2021-11-03 05:18:25,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:25,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552551274] [2021-11-03 05:18:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:25,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:26,479 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:26,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552551274] [2021-11-03 05:18:26,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552551274] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:18:26,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902584881] [2021-11-03 05:18:26,480 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 05:18:26,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:18:26,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:18:26,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:18:26,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_802de202-c129-4ba5-944a-205df042e6fa/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-03 05:18:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:26,660 WARN L261 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 100 conjunts are in the unsatisfiable core [2021-11-03 05:18:26,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:18:26,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:18:26,742 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-03 05:18:26,743 INFO L388 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 41 [2021-11-03 05:18:26,763 INFO L388 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 79 treesize of output 75 [2021-11-03 05:18:27,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:18:27,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:18:27,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-03 05:18:27,414 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-03 05:18:27,415 INFO L388 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 [2021-11-03 05:18:27,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:18:27,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:18:27,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:18:27,636 INFO L388 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 49 treesize of output 39 [2021-11-03 05:18:27,983 INFO L354 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2021-11-03 05:18:27,984 INFO L388 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 [2021-11-03 05:18:28,176 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-03 05:18:28,176 INFO L388 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 [2021-11-03 05:18:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:18:28,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:18:36,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ring_enqueue_~x Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int)) (let ((.cse0 (select |c_#memory_int| c_ULTIMATE.start_writer_fn_~r~1.base))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| (select .cse0 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 20))) (= (let ((.cse1 (select (store |c_#memory_int| c_ULTIMATE.start_writer_fn_~r~1.base (store .cse0 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) c_ULTIMATE.start_writer_fn_~r~1.offset 4) ULTIMATE.start_ring_enqueue_~x)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse1 (+ c_reader_fnThread1of1ForFork0_~r~0.offset (* (select .cse1 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) 4))) (+ c_reader_fnThread1of1ForFork0_~last~0 1))))) is different from false [2021-11-03 05:19:04,630 WARN L207 SmtUtils]: Spent 11.62 s on a formula simplification that was a NOOP. DAG size: 63 [2021-11-03 05:19:42,019 WARN L207 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 69 [2021-11-03 05:20:02,788 WARN L207 SmtUtils]: Spent 10.17 s on a formula simplification that was a NOOP. DAG size: 76 [2021-11-03 05:20:15,474 WARN L207 SmtUtils]: Spent 12.15 s on a formula simplification that was a NOOP. DAG size: 74 [2021-11-03 05:20:32,085 WARN L207 SmtUtils]: Spent 14.16 s on a formula simplification that was a NOOP. DAG size: 72 [2021-11-03 05:20:57,973 WARN L207 SmtUtils]: Spent 14.96 s on a formula simplification that was a NOOP. DAG size: 66 [2021-11-03 05:20:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-03 05:20:57,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902584881] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:20:57,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1796877935] [2021-11-03 05:20:57,975 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:20:57,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:20:57,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 42 [2021-11-03 05:20:57,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669122828] [2021-11-03 05:20:57,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-03 05:20:57,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:57,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-03 05:20:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1603, Unknown=27, NotChecked=82, Total=1892 [2021-11-03 05:20:57,978 INFO L87 Difference]: Start difference. First operand 374 states and 852 transitions. Second operand has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 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) [2021-11-03 05:21:01,918 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse72 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~2.base|)) (.cse74 (+ |c_ULTIMATE.start_main_~#r~2.offset| 20))) (let ((.cse73 (select .cse72 .cse74))) (let ((.cse68 (+ .cse73 1)) (.cse25 (select |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base)) (.cse71 (+ c_ULTIMATE.start_ring_enqueue_~r.offset 20))) (let ((.cse70 (select .cse25 .cse71)) (.cse69 (+ (select (store .cse72 (+ |c_ULTIMATE.start_main_~#r~2.offset| (* .cse73 4) 4) 1) .cse74) 1)) (.cse66 (mod .cse68 4))) (let ((.cse67 (= .cse66 0)) (.cse65 (select .cse72 |c_ULTIMATE.start_main_~#r~2.offset|)) (.cse2 (= (mod .cse69 4) 0)) (.cse42 (+ (select (store .cse25 (+ (* .cse70 4) c_ULTIMATE.start_ring_enqueue_~r.offset 4) c_ULTIMATE.start_ring_enqueue_~x) .cse71) 1)) (.cse16 (+ .cse70 1))) (let ((.cse15 (select |c_#memory_int| c_ULTIMATE.start_writer_fn_~r~1.base)) (.cse17 (= (mod .cse16 4) 0)) (.cse41 (= (mod .cse42 4) 0)) (.cse9 (and (not .cse2) (< .cse69 0))) (.cse3 (<= 0 .cse69)) (.cse0 (and (< .cse68 0) (not .cse67) (= .cse66 (+ .cse65 4)))) (.cse1 (and (= .cse65 .cse66) (or .cse67 (<= 0 .cse68))))) (and (or .cse0 .cse1 (and (or .cse2 .cse3 (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int) (v_subst_2 Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~#r~2.offset| 20))) (let ((.cse5 (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~2.base|))) (store .cse8 (+ |c_ULTIMATE.start_main_~#r~2.offset| (* (select .cse8 .cse6) 4) 4) 1)))) (let ((.cse7 (mod (+ (select .cse5 .cse6) 1) 4))) (or (= (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~2.base| (store (store .cse5 .cse6 (+ (- 4) .cse7)) (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) |c_ULTIMATE.start_main_~#r~2.offset| 4) v_subst_2)) |c_reader_fnThread1of1ForFork0_#in~arg.base|))) (select .cse4 (+ (* (select .cse4 |c_reader_fnThread1of1ForFork0_#in~arg.offset|) 4) |c_reader_fnThread1of1ForFork0_#in~arg.offset| 4))) 1) (< (+ |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) .cse7))))))) (or .cse9 (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int) (v_subst_1 Int)) (let ((.cse13 (+ |c_ULTIMATE.start_main_~#r~2.offset| 20))) (let ((.cse12 (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~2.base|))) (store .cse14 (+ |c_ULTIMATE.start_main_~#r~2.offset| (* (select .cse14 .cse13) 4) 4) 1)))) (let ((.cse10 (mod (+ (select .cse12 .cse13) 1) 4))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| .cse10) (= (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~2.base| (store (store .cse12 .cse13 .cse10) (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) |c_ULTIMATE.start_main_~#r~2.offset| 4) v_subst_1)) |c_reader_fnThread1of1ForFork0_#in~arg.base|))) (select .cse11 (+ (* (select .cse11 |c_reader_fnThread1of1ForFork0_#in~arg.offset|) 4) |c_reader_fnThread1of1ForFork0_#in~arg.offset| 4))) 1))))))))) (= (select .cse15 c_ULTIMATE.start_writer_fn_~r~1.offset) 0) (or (and (< .cse16 0) (not .cse17)) (forall ((ULTIMATE.start_ring_enqueue_~x Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int)) (let ((.cse19 (store |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base (let ((.cse21 (select |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base)) (.cse22 (+ c_ULTIMATE.start_ring_enqueue_~r.offset 20))) (store .cse21 .cse22 (mod (+ (select .cse21 .cse22) 1) 4)))))) (let ((.cse20 (select .cse19 c_ULTIMATE.start_writer_fn_~r~1.base))) (or (= (+ c_reader_fnThread1of1ForFork0_~last~0 1) (let ((.cse18 (select (store .cse19 c_ULTIMATE.start_writer_fn_~r~1.base (store .cse20 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) c_ULTIMATE.start_writer_fn_~r~1.offset 4) ULTIMATE.start_ring_enqueue_~x)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse18 (+ (* (select .cse18 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) c_reader_fnThread1of1ForFork0_~r~0.offset 4)))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| (select .cse20 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 20)))))))) (forall ((ULTIMATE.start_ring_enqueue_~x Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int)) (let ((.cse23 (select |c_#memory_int| c_ULTIMATE.start_writer_fn_~r~1.base))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| (select .cse23 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 20))) (= (let ((.cse24 (select (store |c_#memory_int| c_ULTIMATE.start_writer_fn_~r~1.base (store .cse23 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) c_ULTIMATE.start_writer_fn_~r~1.offset 4) ULTIMATE.start_ring_enqueue_~x)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse24 (+ c_reader_fnThread1of1ForFork0_~r~0.offset (* (select .cse24 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) 4))) (+ c_reader_fnThread1of1ForFork0_~last~0 1))))) (= c_ULTIMATE.start_ring_enqueue_~r.base c_reader_fnThread1of1ForFork0_~r~0.base) (= (select .cse25 4) 1) (= c_reader_fnThread1of1ForFork0_~r~0.offset 0) (= (select .cse25 20) 1) (= (select .cse15 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 4)) 1) (or (and (or .cse9 (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int) (v_subst_1 Int)) (let ((.cse29 (+ |c_ULTIMATE.start_main_~#r~2.offset| 20))) (let ((.cse28 (let ((.cse30 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~2.base|))) (store .cse30 (+ |c_ULTIMATE.start_main_~#r~2.offset| (* (select .cse30 .cse29) 4) 4) 1)))) (let ((.cse26 (mod (+ (select .cse28 .cse29) 1) 4))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| .cse26) (= (let ((.cse27 (store (store .cse28 .cse29 .cse26) (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) |c_ULTIMATE.start_main_~#r~2.offset| 4) v_subst_1))) (select .cse27 (+ (* (select .cse27 |c_ULTIMATE.start_main_~#r~2.offset|) 4) |c_ULTIMATE.start_main_~#r~2.offset| 4))) 1))))))) (or .cse2 .cse3 (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int) (v_subst_2 Int)) (let ((.cse34 (+ |c_ULTIMATE.start_main_~#r~2.offset| 20))) (let ((.cse33 (let ((.cse35 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~2.base|))) (store .cse35 (+ |c_ULTIMATE.start_main_~#r~2.offset| (* (select .cse35 .cse34) 4) 4) 1)))) (let ((.cse31 (mod (+ (select .cse33 .cse34) 1) 4))) (or (< (+ |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) .cse31) (= (let ((.cse32 (store (store .cse33 .cse34 (+ (- 4) .cse31)) (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) |c_ULTIMATE.start_main_~#r~2.offset| 4) v_subst_2))) (select .cse32 (+ (* (select .cse32 |c_ULTIMATE.start_main_~#r~2.offset|) 4) |c_ULTIMATE.start_main_~#r~2.offset| 4))) 1)))))))) .cse0 .cse1) (= c_ULTIMATE.start_writer_fn_~r~1.offset 0) (= (select .cse15 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 20)) 1) (= c_ULTIMATE.start_writer_fn_~r~1.base c_reader_fnThread1of1ForFork0_~r~0.base) (= c_ULTIMATE.start_ring_enqueue_~r.offset 0) (or (<= 0 .cse16) .cse17 (forall ((ULTIMATE.start_ring_enqueue_~x Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int)) (let ((.cse38 (store |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base (let ((.cse39 (select |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base)) (.cse40 (+ c_ULTIMATE.start_ring_enqueue_~r.offset 20))) (store .cse39 .cse40 (+ (mod (+ (select .cse39 .cse40) 1) 4) (- 4))))))) (let ((.cse36 (select .cse38 c_ULTIMATE.start_writer_fn_~r~1.base))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| (select .cse36 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 20))) (= (+ c_reader_fnThread1of1ForFork0_~last~0 1) (let ((.cse37 (select (store .cse38 c_ULTIMATE.start_writer_fn_~r~1.base (store .cse36 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) c_ULTIMATE.start_writer_fn_~r~1.offset 4) ULTIMATE.start_ring_enqueue_~x)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse37 (+ c_reader_fnThread1of1ForFork0_~r~0.offset (* (select .cse37 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) 4))))))))) (or .cse41 (<= 0 .cse42) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int) (v_subst_2 Int)) (let ((.cse45 (store |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base (let ((.cse47 (+ c_ULTIMATE.start_ring_enqueue_~r.offset 20))) (let ((.cse46 (let ((.cse48 (select |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base))) (store .cse48 (+ (* (select .cse48 .cse47) 4) c_ULTIMATE.start_ring_enqueue_~r.offset 4) c_ULTIMATE.start_ring_enqueue_~x)))) (store .cse46 .cse47 (+ (mod (+ (select .cse46 .cse47) 1) 4) (- 4)))))))) (let ((.cse43 (select .cse45 c_ULTIMATE.start_writer_fn_~r~1.base))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| (select .cse43 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 20))) (= (let ((.cse44 (select (store .cse45 c_ULTIMATE.start_writer_fn_~r~1.base (store .cse43 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) c_ULTIMATE.start_writer_fn_~r~1.offset 4) v_subst_2)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse44 (+ c_reader_fnThread1of1ForFork0_~r~0.offset (* (select .cse44 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) 4))) (+ c_reader_fnThread1of1ForFork0_~last~0 1))))))) (= c_reader_fnThread1of1ForFork0_~last~0 0) (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int) (v_subst_1 Int)) (let ((.cse50 (store |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base (let ((.cse53 (+ c_ULTIMATE.start_ring_enqueue_~r.offset 20))) (let ((.cse52 (let ((.cse54 (select |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base))) (store .cse54 (+ (* (select .cse54 .cse53) 4) c_ULTIMATE.start_ring_enqueue_~r.offset 4) c_ULTIMATE.start_ring_enqueue_~x)))) (store .cse52 .cse53 (mod (+ (select .cse52 .cse53) 1) 4))))))) (let ((.cse51 (select .cse50 c_ULTIMATE.start_writer_fn_~r~1.base))) (or (= (+ c_reader_fnThread1of1ForFork0_~last~0 1) (let ((.cse49 (select (store .cse50 c_ULTIMATE.start_writer_fn_~r~1.base (store .cse51 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) c_ULTIMATE.start_writer_fn_~r~1.offset 4) v_subst_1)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse49 (+ (* (select .cse49 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) c_reader_fnThread1of1ForFork0_~r~0.offset 4)))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| (select .cse51 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 20))))))) (and (not .cse41) (< .cse42 0))) (or (and (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int) (v_subst_1 Int)) (let ((.cse58 (+ |c_ULTIMATE.start_main_~#r~2.offset| 20))) (let ((.cse57 (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~2.base|))) (store .cse59 (+ |c_ULTIMATE.start_main_~#r~2.offset| (* (select .cse59 .cse58) 4) 4) 1)))) (let ((.cse55 (mod (+ (select .cse57 .cse58) 1) 4))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| .cse55) (= (+ c_reader_fnThread1of1ForFork0_~last~0 1) (let ((.cse56 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~2.base| (store (store .cse57 .cse58 .cse55) (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) |c_ULTIMATE.start_main_~#r~2.offset| 4) v_subst_1)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse56 (+ (* (select .cse56 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) c_reader_fnThread1of1ForFork0_~r~0.offset 4))))))))) .cse9) (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int) (v_subst_2 Int)) (let ((.cse62 (+ |c_ULTIMATE.start_main_~#r~2.offset| 20))) (let ((.cse61 (let ((.cse64 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~2.base|))) (store .cse64 (+ |c_ULTIMATE.start_main_~#r~2.offset| (* (select .cse64 .cse62) 4) 4) 1)))) (let ((.cse63 (mod (+ (select .cse61 .cse62) 1) 4))) (or (= (+ c_reader_fnThread1of1ForFork0_~last~0 1) (let ((.cse60 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~2.base| (store (store .cse61 .cse62 (+ (- 4) .cse63)) (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) |c_ULTIMATE.start_main_~#r~2.offset| 4) v_subst_2)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse60 (+ c_reader_fnThread1of1ForFork0_~r~0.offset (* (select .cse60 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) 4)))) (< (+ |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) .cse63)))))) .cse2 .cse3)) .cse0 .cse1) (= (select .cse25 0) 0)))))))) is different from false [2021-11-03 05:21:22,987 WARN L207 SmtUtils]: Spent 10.85 s on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2021-11-03 05:22:13,017 WARN L207 SmtUtils]: Spent 9.66 s on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2021-11-03 05:25:04,580 WARN L207 SmtUtils]: Spent 1.68 m on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2021-11-03 05:25:50,927 WARN L207 SmtUtils]: Spent 15.90 s on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-11-03 05:26:08,982 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base))) (let ((.cse29 (store .cse28 (+ c_ULTIMATE.start_ring_enqueue_~r.offset 4 (* |c_ULTIMATE.start_ring_enqueue_#t~mem8| 4)) c_ULTIMATE.start_ring_enqueue_~x)) (.cse30 (+ c_ULTIMATE.start_ring_enqueue_~r.offset 20))) (let ((.cse7 (+ (select .cse28 .cse30) 1)) (.cse14 (select |c_#memory_int| c_reader_fnThread1of1ForFork0_~r~0.base)) (.cse0 (+ (select .cse29 .cse30) 1))) (let ((.cse6 (= (mod .cse0 4) 0)) (.cse21 (select .cse14 4)) (.cse8 (= (mod .cse7 4) 0)) (.cse22 (select .cse29 4))) (and (or (<= 0 .cse0) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int) (v_subst_2 Int)) (let ((.cse3 (store |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base (let ((.cse4 (store (select |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base) (+ c_ULTIMATE.start_ring_enqueue_~r.offset 4 (* |c_ULTIMATE.start_ring_enqueue_#t~mem8| 4)) c_ULTIMATE.start_ring_enqueue_~x)) (.cse5 (+ c_ULTIMATE.start_ring_enqueue_~r.offset 20))) (store .cse4 .cse5 (+ (- 4) (mod (+ (select .cse4 .cse5) 1) 4))))))) (let ((.cse1 (select .cse3 c_ULTIMATE.start_writer_fn_~r~1.base))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| (select .cse1 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 20))) (= (+ c_reader_fnThread1of1ForFork0_~last~0 1) (let ((.cse2 (select (store .cse3 c_ULTIMATE.start_writer_fn_~r~1.base (store .cse1 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) c_ULTIMATE.start_writer_fn_~r~1.offset 4) v_subst_2)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse2 (+ (* (select .cse2 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) c_reader_fnThread1of1ForFork0_~r~0.offset 4)))))))) .cse6) (or (and (< .cse7 0) (not .cse8)) (forall ((ULTIMATE.start_ring_enqueue_~x Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int)) (let ((.cse10 (store |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base (let ((.cse12 (select |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base)) (.cse13 (+ c_ULTIMATE.start_ring_enqueue_~r.offset 20))) (store .cse12 .cse13 (mod (+ (select .cse12 .cse13) 1) 4)))))) (let ((.cse11 (select .cse10 c_ULTIMATE.start_writer_fn_~r~1.base))) (or (= (+ c_reader_fnThread1of1ForFork0_~last~0 1) (let ((.cse9 (select (store .cse10 c_ULTIMATE.start_writer_fn_~r~1.base (store .cse11 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) c_ULTIMATE.start_writer_fn_~r~1.offset 4) ULTIMATE.start_ring_enqueue_~x)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse9 (+ (* (select .cse9 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) c_reader_fnThread1of1ForFork0_~r~0.offset 4)))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| (select .cse11 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 20)))))))) (= (select .cse14 c_reader_fnThread1of1ForFork0_~r~0.offset) 0) (= c_ULTIMATE.start_ring_enqueue_~r.base c_reader_fnThread1of1ForFork0_~r~0.base) (= c_reader_fnThread1of1ForFork0_~r~0.offset 0) (forall ((ULTIMATE.start_ring_enqueue_~x Int)) (= (+ c_reader_fnThread1of1ForFork0_~last~0 1) (let ((.cse15 (select (store |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base (store (select |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base) (+ c_ULTIMATE.start_ring_enqueue_~r.offset 4 (* |c_ULTIMATE.start_ring_enqueue_#t~mem8| 4)) ULTIMATE.start_ring_enqueue_~x)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse15 (+ c_reader_fnThread1of1ForFork0_~r~0.offset (* (select .cse15 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) 4))))) (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int) (v_subst_1 Int)) (let ((.cse18 (store |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base (let ((.cse19 (store (select |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base) (+ c_ULTIMATE.start_ring_enqueue_~r.offset 4 (* |c_ULTIMATE.start_ring_enqueue_#t~mem8| 4)) c_ULTIMATE.start_ring_enqueue_~x)) (.cse20 (+ c_ULTIMATE.start_ring_enqueue_~r.offset 20))) (store .cse19 .cse20 (mod (+ (select .cse19 .cse20) 1) 4)))))) (let ((.cse16 (select .cse18 c_ULTIMATE.start_writer_fn_~r~1.base))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| (select .cse16 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 20))) (= (let ((.cse17 (select (store .cse18 c_ULTIMATE.start_writer_fn_~r~1.base (store .cse16 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) c_ULTIMATE.start_writer_fn_~r~1.offset 4) v_subst_1)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse17 (+ c_reader_fnThread1of1ForFork0_~r~0.offset 4 (* (select .cse17 c_reader_fnThread1of1ForFork0_~r~0.offset) 4)))) (+ c_reader_fnThread1of1ForFork0_~last~0 1)))))) (and (< .cse0 0) (not .cse6))) (<= .cse21 1) (<= 1 .cse21) (<= .cse22 1) (= c_ULTIMATE.start_ring_enqueue_~r.offset 0) (or (<= 0 .cse7) .cse8 (forall ((ULTIMATE.start_ring_enqueue_~x Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem8_152| Int)) (let ((.cse25 (store |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base (let ((.cse26 (select |c_#memory_int| c_ULTIMATE.start_ring_enqueue_~r.base)) (.cse27 (+ c_ULTIMATE.start_ring_enqueue_~r.offset 20))) (store .cse26 .cse27 (+ (mod (+ (select .cse26 .cse27) 1) 4) (- 4))))))) (let ((.cse23 (select .cse25 c_ULTIMATE.start_writer_fn_~r~1.base))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| (select .cse23 (+ c_ULTIMATE.start_writer_fn_~r~1.offset 20))) (= (+ c_reader_fnThread1of1ForFork0_~last~0 1) (let ((.cse24 (select (store .cse25 c_ULTIMATE.start_writer_fn_~r~1.base (store .cse23 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8_152| 4) c_ULTIMATE.start_writer_fn_~r~1.offset 4) ULTIMATE.start_ring_enqueue_~x)) c_reader_fnThread1of1ForFork0_~r~0.base))) (select .cse24 (+ c_reader_fnThread1of1ForFork0_~r~0.offset (* (select .cse24 c_reader_fnThread1of1ForFork0_~r~0.offset) 4) 4))))))))) (<= 1 .cse22) (= (select .cse28 c_ULTIMATE.start_ring_enqueue_~r.offset) 0) (= c_reader_fnThread1of1ForFork0_~last~0 0) (not (= (+ (* 4 |c_ULTIMATE.start_ring_enqueue_#t~mem8|) 4) 0))))))) is different from false [2021-11-03 05:26:45,723 WARN L207 SmtUtils]: Spent 16.19 s on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2021-11-03 05:27:20,616 WARN L207 SmtUtils]: Spent 12.21 s on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2021-11-03 05:28:02,441 WARN L207 SmtUtils]: Spent 14.23 s on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2021-11-03 05:28:46,171 WARN L207 SmtUtils]: Spent 18.17 s on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2021-11-03 05:30:26,009 WARN L207 SmtUtils]: Spent 1.12 m on a formula simplification. DAG size of input: 137 DAG size of output: 110 [2021-11-03 05:31:00,622 WARN L207 SmtUtils]: Spent 14.11 s on a formula simplification. DAG size of input: 92 DAG size of output: 61