./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix020_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix020_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI --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 ec8273750a38458a3fd6a790970740e99307b12e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:22:43,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:22:43,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:22:43,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:22:43,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:22:43,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:22:43,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:22:43,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:22:43,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:22:43,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:22:43,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:22:43,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:22:43,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:22:43,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:22:43,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:22:43,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:22:43,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:22:43,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:22:43,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:22:43,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:22:43,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:22:43,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:22:43,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:22:43,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:22:43,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:22:43,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:22:43,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:22:43,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:22:43,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:22:43,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:22:43,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:22:43,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:22:43,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:22:43,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:22:43,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:22:43,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:22:43,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:22:43,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:22:43,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:22:43,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:22:43,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:22:43,965 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:22:43,989 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:22:43,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:22:43,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:22:43,990 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:22:43,990 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:22:43,990 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:22:43,991 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:22:43,991 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:22:43,991 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:22:43,991 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:22:43,991 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:22:43,992 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:22:43,992 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:22:43,992 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:22:43,992 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:22:43,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:22:43,993 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:22:43,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:22:43,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:22:43,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:22:43,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:22:43,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:22:43,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:22:43,995 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:22:43,995 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:22:43,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:22:43,995 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:22:43,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:22:43,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:22:43,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:22:43,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:22:43,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:22:43,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:22:43,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:22:43,997 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:22:43,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:22:43,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:22:43,998 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:22:43,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:22:43,998 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_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/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_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI 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 -> ec8273750a38458a3fd6a790970740e99307b12e [2021-10-11 02:22:44,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:22:44,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:22:44,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:22:44,256 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:22:44,257 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:22:44,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/pthread-wmm/mix020_tso.oepc.i [2021-10-11 02:22:44,320 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/data/72426315d/976674946b1946da9f6c778ea8da78bd/FLAG4d3ae3d4c [2021-10-11 02:22:44,912 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:22:44,912 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/sv-benchmarks/c/pthread-wmm/mix020_tso.oepc.i [2021-10-11 02:22:44,942 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/data/72426315d/976674946b1946da9f6c778ea8da78bd/FLAG4d3ae3d4c [2021-10-11 02:22:45,180 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/data/72426315d/976674946b1946da9f6c778ea8da78bd [2021-10-11 02:22:45,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:22:45,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:22:45,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:22:45,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:22:45,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:22:45,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:22:45" (1/1) ... [2021-10-11 02:22:45,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f7cdef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45, skipping insertion in model container [2021-10-11 02:22:45,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:22:45" (1/1) ... [2021-10-11 02:22:45,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:22:45,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:22:45,521 WARN L226 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_e6087692-64c8-4590-a763-0177b4b481b9/sv-benchmarks/c/pthread-wmm/mix020_tso.oepc.i[949,962] [2021-10-11 02:22:45,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:22:45,808 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:22:45,820 WARN L226 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_e6087692-64c8-4590-a763-0177b4b481b9/sv-benchmarks/c/pthread-wmm/mix020_tso.oepc.i[949,962] [2021-10-11 02:22:45,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:22:45,976 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:22:45,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45 WrapperNode [2021-10-11 02:22:45,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:22:45,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:22:45,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:22:45,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:22:45,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45" (1/1) ... [2021-10-11 02:22:46,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45" (1/1) ... [2021-10-11 02:22:46,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:22:46,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:22:46,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:22:46,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:22:46,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45" (1/1) ... [2021-10-11 02:22:46,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45" (1/1) ... [2021-10-11 02:22:46,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45" (1/1) ... [2021-10-11 02:22:46,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45" (1/1) ... [2021-10-11 02:22:46,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45" (1/1) ... [2021-10-11 02:22:46,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45" (1/1) ... [2021-10-11 02:22:46,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45" (1/1) ... [2021-10-11 02:22:46,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:22:46,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:22:46,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:22:46,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:22:46,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:22:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 02:22:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 02:22:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:22:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:22:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-11 02:22:46,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-11 02:22:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-11 02:22:46,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-11 02:22:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-11 02:22:46,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-11 02:22:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-10-11 02:22:46,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-10-11 02:22:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:22:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 02:22:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:22:46,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:22:46,238 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 02:22:48,619 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:22:48,620 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-11 02:22:48,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:22:48 BoogieIcfgContainer [2021-10-11 02:22:48,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:22:48,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:22:48,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:22:48,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:22:48,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:22:45" (1/3) ... [2021-10-11 02:22:48,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2789eef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:22:48, skipping insertion in model container [2021-10-11 02:22:48,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:45" (2/3) ... [2021-10-11 02:22:48,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2789eef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:22:48, skipping insertion in model container [2021-10-11 02:22:48,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:22:48" (3/3) ... [2021-10-11 02:22:48,633 INFO L111 eAbstractionObserver]: Analyzing ICFG mix020_tso.oepc.i [2021-10-11 02:22:48,650 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 02:22:48,650 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:22:48,654 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 02:22:48,655 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 02:22:48,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,710 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,711 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,711 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,711 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,712 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,712 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,713 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,721 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,728 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,728 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,729 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,729 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,739 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,739 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,746 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,746 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,769 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,769 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,769 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,769 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,774 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,775 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,775 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,780 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,780 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,789 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,789 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,792 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,792 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,794 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,795 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,796 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,796 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,796 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,796 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,797 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,797 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:48,815 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 02:22:48,827 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-10-11 02:22:48,852 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:22:48,852 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:22:48,852 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:22:48,852 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:22:48,852 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:22:48,853 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:22:48,853 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:22:48,853 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:22:48,865 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 02:22:48,867 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 118 transitions, 256 flow [2021-10-11 02:22:48,870 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 118 transitions, 256 flow [2021-10-11 02:22:48,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow [2021-10-11 02:22:48,948 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-10-11 02:22:48,948 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 02:22:48,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-10-11 02:22:48,957 INFO L116 LiptonReduction]: Number of co-enabled transitions 2774 [2021-10-11 02:22:49,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:49,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:49,075 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:49,075 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:49,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:49,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:49,094 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:49,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:49,165 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:49,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:49,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:49,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:49,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:49,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:49,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:49,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:49,673 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-10-11 02:22:49,789 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-10-11 02:22:50,430 WARN L197 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-10-11 02:22:50,680 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-10-11 02:22:50,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:50,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:50,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:50,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:50,727 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:50,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:50,731 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:50,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:50,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:50,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:50,762 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:50,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:50,765 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:50,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:50,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:50,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:50,998 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-10-11 02:22:50,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:51,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:51,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:22:51,201 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:51,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:51,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:51,264 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:51,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:51,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:22:51,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:51,268 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:51,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:51,271 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:51,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:51,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:51,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:51,276 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:51,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:51,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:51,387 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:51,389 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:51,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:51,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:51,419 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:51,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:51,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:51,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:51,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:51,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:51,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:51,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:51,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:51,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:51,653 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:51,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,248 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:52,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:52,256 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:22:52,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:52,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:52,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:52,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:52,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:52,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:52,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:52,265 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:52,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:52,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:52,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:22:52,357 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:52,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:52,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,472 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,478 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,501 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,504 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,507 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,692 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,791 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,794 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,797 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,819 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,822 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,825 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:52,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,978 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:52,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:52,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:53,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:53,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:53,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:53,087 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:53,090 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:53,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:53,091 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:22:53,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:53,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:53,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:53,095 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:53,096 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:53,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:53,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:53,099 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:53,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:53,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:53,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:22:53,163 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:53,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:53,194 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:53,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:53,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:53,200 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:53,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:53,221 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:53,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:53,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:53,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-10-11 02:22:53,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:53,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:53,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:22:53,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:53,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:53,552 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:53,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:53,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:53,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:53,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:22:53,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:53,563 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:53,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:53,566 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:53,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:53,568 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:53,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:53,570 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:53,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:54,013 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:54,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:54,017 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:54,019 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:54,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:54,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:54,043 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:54,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:54,183 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-10-11 02:22:54,286 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-10-11 02:22:54,510 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-10-11 02:22:54,740 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-10-11 02:22:54,943 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:54,944 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:54,946 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:54,949 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:54,967 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:54,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:54,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:54,981 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:54,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:55,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:55,046 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:55,096 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,096 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,099 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:55,101 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:55,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:55,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:55,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,452 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,454 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:55,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:55,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,625 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:55,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:55,627 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:22:55,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:55,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:55,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:55,633 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:55,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:55,635 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:55,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:55,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:55,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:55,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:55,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:22:55,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:55,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:55,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:55,743 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,744 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:55,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:55,867 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:55,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:22:55,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:55,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,916 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:55,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:55,919 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:55,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:55,921 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:22:55,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:55,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:22:55,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:55,924 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:55,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:55,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:55,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:55,927 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:55,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:56,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,085 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:56,087 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:56,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,105 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:56,107 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:56,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,218 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:56,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:56,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:56,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:56,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,276 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,278 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,279 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:56,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:56,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:56,304 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:56,353 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,357 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:56,359 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:56,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:56,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:56,431 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,435 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:56,437 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:56,455 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,456 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:56,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:56,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:56,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:57,620 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-10-11 02:22:57,729 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-10-11 02:22:57,845 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-10-11 02:22:57,960 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-10-11 02:22:58,485 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-10-11 02:22:58,671 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-10-11 02:22:59,063 WARN L197 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-10-11 02:22:59,248 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-10-11 02:22:59,307 INFO L131 LiptonReduction]: Checked pairs total: 8591 [2021-10-11 02:22:59,307 INFO L133 LiptonReduction]: Total number of compositions: 92 [2021-10-11 02:22:59,318 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2021-10-11 02:22:59,703 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4874 states. [2021-10-11 02:22:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states. [2021-10-11 02:22:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-11 02:22:59,710 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:59,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-11 02:22:59,711 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:59,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:59,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1211336, now seen corresponding path program 1 times [2021-10-11 02:22:59,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:59,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869993232] [2021-10-11 02:22:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:00,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869993232] [2021-10-11 02:23:00,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:00,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 02:23:00,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550509511] [2021-10-11 02:23:00,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:00,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:00,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:00,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:00,045 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 3 states. [2021-10-11 02:23:00,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:00,234 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2021-10-11 02:23:00,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:00,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-10-11 02:23:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:00,307 INFO L225 Difference]: With dead ends: 4062 [2021-10-11 02:23:00,307 INFO L226 Difference]: Without dead ends: 3312 [2021-10-11 02:23:00,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 02:23:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2021-10-11 02:23:00,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2021-10-11 02:23:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2021-10-11 02:23:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2021-10-11 02:23:00,557 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 3 [2021-10-11 02:23:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:00,557 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2021-10-11 02:23:00,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2021-10-11 02:23:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:23:00,563 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:00,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:00,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:23:00,563 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1427630332, now seen corresponding path program 1 times [2021-10-11 02:23:00,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:00,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671211051] [2021-10-11 02:23:00,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:00,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671211051] [2021-10-11 02:23:00,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:00,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 02:23:00,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375353054] [2021-10-11 02:23:00,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:00,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:00,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:00,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:00,751 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2021-10-11 02:23:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:00,851 INFO L93 Difference]: Finished difference Result 5200 states and 19622 transitions. [2021-10-11 02:23:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:00,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-10-11 02:23:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:00,902 INFO L225 Difference]: With dead ends: 5200 [2021-10-11 02:23:00,902 INFO L226 Difference]: Without dead ends: 4957 [2021-10-11 02:23:00,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 02:23:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4957 states. [2021-10-11 02:23:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4957 to 4519. [2021-10-11 02:23:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4519 states. [2021-10-11 02:23:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4519 states to 4519 states and 17380 transitions. [2021-10-11 02:23:01,248 INFO L78 Accepts]: Start accepts. Automaton has 4519 states and 17380 transitions. Word has length 11 [2021-10-11 02:23:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:01,249 INFO L481 AbstractCegarLoop]: Abstraction has 4519 states and 17380 transitions. [2021-10-11 02:23:01,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 4519 states and 17380 transitions. [2021-10-11 02:23:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:23:01,252 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:01,253 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:01,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:23:01,253 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:01,254 INFO L82 PathProgramCache]: Analyzing trace with hash 756877090, now seen corresponding path program 1 times [2021-10-11 02:23:01,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:01,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682285397] [2021-10-11 02:23:01,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:01,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682285397] [2021-10-11 02:23:01,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:01,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:23:01,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420755442] [2021-10-11 02:23:01,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:01,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:01,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:01,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:01,363 INFO L87 Difference]: Start difference. First operand 4519 states and 17380 transitions. Second operand 4 states. [2021-10-11 02:23:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:01,465 INFO L93 Difference]: Finished difference Result 4589 states and 17281 transitions. [2021-10-11 02:23:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:01,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-10-11 02:23:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:01,530 INFO L225 Difference]: With dead ends: 4589 [2021-10-11 02:23:01,531 INFO L226 Difference]: Without dead ends: 4589 [2021-10-11 02:23:01,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2021-10-11 02:23:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 3719. [2021-10-11 02:23:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3719 states. [2021-10-11 02:23:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 14274 transitions. [2021-10-11 02:23:01,863 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 14274 transitions. Word has length 12 [2021-10-11 02:23:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:01,864 INFO L481 AbstractCegarLoop]: Abstraction has 3719 states and 14274 transitions. [2021-10-11 02:23:01,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 14274 transitions. [2021-10-11 02:23:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 02:23:01,866 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:01,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:01,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:23:01,867 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1807776164, now seen corresponding path program 1 times [2021-10-11 02:23:01,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:01,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273704852] [2021-10-11 02:23:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:01,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273704852] [2021-10-11 02:23:01,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:01,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:23:01,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122681743] [2021-10-11 02:23:01,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:01,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:01,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:01,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:01,987 INFO L87 Difference]: Start difference. First operand 3719 states and 14274 transitions. Second operand 4 states. [2021-10-11 02:23:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:02,058 INFO L93 Difference]: Finished difference Result 4489 states and 16906 transitions. [2021-10-11 02:23:02,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:02,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2021-10-11 02:23:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:02,081 INFO L225 Difference]: With dead ends: 4489 [2021-10-11 02:23:02,081 INFO L226 Difference]: Without dead ends: 4489 [2021-10-11 02:23:02,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2021-10-11 02:23:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 3679. [2021-10-11 02:23:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3679 states. [2021-10-11 02:23:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 14092 transitions. [2021-10-11 02:23:02,256 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 14092 transitions. Word has length 13 [2021-10-11 02:23:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:02,256 INFO L481 AbstractCegarLoop]: Abstraction has 3679 states and 14092 transitions. [2021-10-11 02:23:02,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 14092 transitions. [2021-10-11 02:23:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:23:02,260 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:02,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:02,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:23:02,260 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:02,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:02,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1459005002, now seen corresponding path program 1 times [2021-10-11 02:23:02,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:02,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606310312] [2021-10-11 02:23:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:02,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606310312] [2021-10-11 02:23:02,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:02,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:02,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569402028] [2021-10-11 02:23:02,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:02,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:02,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:02,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:02,405 INFO L87 Difference]: Start difference. First operand 3679 states and 14092 transitions. Second operand 4 states. [2021-10-11 02:23:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:02,569 INFO L93 Difference]: Finished difference Result 3680 states and 12755 transitions. [2021-10-11 02:23:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:02,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2021-10-11 02:23:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:02,582 INFO L225 Difference]: With dead ends: 3680 [2021-10-11 02:23:02,582 INFO L226 Difference]: Without dead ends: 2711 [2021-10-11 02:23:02,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2021-10-11 02:23:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2711. [2021-10-11 02:23:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2021-10-11 02:23:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 9268 transitions. [2021-10-11 02:23:02,677 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 9268 transitions. Word has length 14 [2021-10-11 02:23:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:02,678 INFO L481 AbstractCegarLoop]: Abstraction has 2711 states and 9268 transitions. [2021-10-11 02:23:02,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:02,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 9268 transitions. [2021-10-11 02:23:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:23:02,682 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:02,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:02,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:23:02,683 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1406896467, now seen corresponding path program 1 times [2021-10-11 02:23:02,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:02,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529989680] [2021-10-11 02:23:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:02,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529989680] [2021-10-11 02:23:02,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:02,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:02,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902080223] [2021-10-11 02:23:02,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:02,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:02,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:02,755 INFO L87 Difference]: Start difference. First operand 2711 states and 9268 transitions. Second operand 4 states. [2021-10-11 02:23:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:02,802 INFO L93 Difference]: Finished difference Result 3767 states and 12651 transitions. [2021-10-11 02:23:02,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:02,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2021-10-11 02:23:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:02,812 INFO L225 Difference]: With dead ends: 3767 [2021-10-11 02:23:02,813 INFO L226 Difference]: Without dead ends: 2442 [2021-10-11 02:23:02,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2021-10-11 02:23:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2178. [2021-10-11 02:23:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states. [2021-10-11 02:23:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 7215 transitions. [2021-10-11 02:23:02,889 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 7215 transitions. Word has length 17 [2021-10-11 02:23:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:02,890 INFO L481 AbstractCegarLoop]: Abstraction has 2178 states and 7215 transitions. [2021-10-11 02:23:02,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 7215 transitions. [2021-10-11 02:23:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:23:02,894 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:02,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:02,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:23:02,894 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:02,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:02,895 INFO L82 PathProgramCache]: Analyzing trace with hash 463103875, now seen corresponding path program 1 times [2021-10-11 02:23:02,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:02,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142754424] [2021-10-11 02:23:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:02,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142754424] [2021-10-11 02:23:02,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:02,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:02,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821534667] [2021-10-11 02:23:02,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:02,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:02,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:02,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:02,967 INFO L87 Difference]: Start difference. First operand 2178 states and 7215 transitions. Second operand 5 states. [2021-10-11 02:23:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:03,039 INFO L93 Difference]: Finished difference Result 1832 states and 5594 transitions. [2021-10-11 02:23:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:03,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2021-10-11 02:23:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:03,045 INFO L225 Difference]: With dead ends: 1832 [2021-10-11 02:23:03,045 INFO L226 Difference]: Without dead ends: 1402 [2021-10-11 02:23:03,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2021-10-11 02:23:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2021-10-11 02:23:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2021-10-11 02:23:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 4205 transitions. [2021-10-11 02:23:03,160 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 4205 transitions. Word has length 17 [2021-10-11 02:23:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:03,160 INFO L481 AbstractCegarLoop]: Abstraction has 1402 states and 4205 transitions. [2021-10-11 02:23:03,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 4205 transitions. [2021-10-11 02:23:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-11 02:23:03,165 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:03,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:03,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:23:03,165 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:03,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:03,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1305016551, now seen corresponding path program 1 times [2021-10-11 02:23:03,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:03,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516834159] [2021-10-11 02:23:03,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:03,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516834159] [2021-10-11 02:23:03,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:03,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:03,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368785775] [2021-10-11 02:23:03,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:03,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:03,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:03,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:03,303 INFO L87 Difference]: Start difference. First operand 1402 states and 4205 transitions. Second operand 6 states. [2021-10-11 02:23:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:03,378 INFO L93 Difference]: Finished difference Result 1239 states and 3690 transitions. [2021-10-11 02:23:03,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:23:03,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2021-10-11 02:23:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:03,383 INFO L225 Difference]: With dead ends: 1239 [2021-10-11 02:23:03,383 INFO L226 Difference]: Without dead ends: 1113 [2021-10-11 02:23:03,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2021-10-11 02:23:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2021-10-11 02:23:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2021-10-11 02:23:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 3362 transitions. [2021-10-11 02:23:03,423 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 3362 transitions. Word has length 20 [2021-10-11 02:23:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:03,424 INFO L481 AbstractCegarLoop]: Abstraction has 1113 states and 3362 transitions. [2021-10-11 02:23:03,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 3362 transitions. [2021-10-11 02:23:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 02:23:03,428 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:03,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:03,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:23:03,428 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:03,429 INFO L82 PathProgramCache]: Analyzing trace with hash 571004738, now seen corresponding path program 1 times [2021-10-11 02:23:03,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:03,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292295802] [2021-10-11 02:23:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:03,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292295802] [2021-10-11 02:23:03,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:03,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:03,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705186669] [2021-10-11 02:23:03,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:23:03,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:03,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:23:03,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:03,877 INFO L87 Difference]: Start difference. First operand 1113 states and 3362 transitions. Second operand 7 states. [2021-10-11 02:23:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:04,323 INFO L93 Difference]: Finished difference Result 2163 states and 6121 transitions. [2021-10-11 02:23:04,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-11 02:23:04,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2021-10-11 02:23:04,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:04,330 INFO L225 Difference]: With dead ends: 2163 [2021-10-11 02:23:04,330 INFO L226 Difference]: Without dead ends: 1719 [2021-10-11 02:23:04,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:23:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2021-10-11 02:23:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1378. [2021-10-11 02:23:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2021-10-11 02:23:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 4039 transitions. [2021-10-11 02:23:04,383 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 4039 transitions. Word has length 24 [2021-10-11 02:23:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:04,383 INFO L481 AbstractCegarLoop]: Abstraction has 1378 states and 4039 transitions. [2021-10-11 02:23:04,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:23:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 4039 transitions. [2021-10-11 02:23:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 02:23:04,388 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:04,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:04,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:23:04,389 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash -603647878, now seen corresponding path program 2 times [2021-10-11 02:23:04,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:04,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135655692] [2021-10-11 02:23:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:04,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135655692] [2021-10-11 02:23:04,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:04,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:04,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480573714] [2021-10-11 02:23:04,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:23:04,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:04,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:23:04,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:04,539 INFO L87 Difference]: Start difference. First operand 1378 states and 4039 transitions. Second operand 7 states. [2021-10-11 02:23:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:04,649 INFO L93 Difference]: Finished difference Result 1345 states and 3969 transitions. [2021-10-11 02:23:04,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:23:04,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2021-10-11 02:23:04,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:04,653 INFO L225 Difference]: With dead ends: 1345 [2021-10-11 02:23:04,653 INFO L226 Difference]: Without dead ends: 847 [2021-10-11 02:23:04,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:23:04,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-10-11 02:23:04,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 807. [2021-10-11 02:23:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2021-10-11 02:23:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2368 transitions. [2021-10-11 02:23:04,677 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 2368 transitions. Word has length 24 [2021-10-11 02:23:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:04,677 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 2368 transitions. [2021-10-11 02:23:04,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:23:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 2368 transitions. [2021-10-11 02:23:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-11 02:23:04,680 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:04,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:04,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 02:23:04,680 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:04,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1875056945, now seen corresponding path program 1 times [2021-10-11 02:23:04,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:04,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54018271] [2021-10-11 02:23:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:04,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54018271] [2021-10-11 02:23:04,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:04,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 02:23:04,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323297349] [2021-10-11 02:23:04,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:23:04,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:04,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:23:04,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:04,889 INFO L87 Difference]: Start difference. First operand 807 states and 2368 transitions. Second operand 9 states. [2021-10-11 02:23:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:05,436 INFO L93 Difference]: Finished difference Result 1589 states and 4699 transitions. [2021-10-11 02:23:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-11 02:23:05,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2021-10-11 02:23:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:05,438 INFO L225 Difference]: With dead ends: 1589 [2021-10-11 02:23:05,438 INFO L226 Difference]: Without dead ends: 477 [2021-10-11 02:23:05,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-10-11 02:23:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-10-11 02:23:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 407. [2021-10-11 02:23:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-10-11 02:23:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1100 transitions. [2021-10-11 02:23:05,451 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1100 transitions. Word has length 28 [2021-10-11 02:23:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:05,451 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1100 transitions. [2021-10-11 02:23:05,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:23:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1100 transitions. [2021-10-11 02:23:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-11 02:23:05,453 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:05,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:05,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:23:05,454 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash -686546797, now seen corresponding path program 2 times [2021-10-11 02:23:05,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:05,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627447803] [2021-10-11 02:23:05,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:05,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627447803] [2021-10-11 02:23:05,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:05,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:05,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396842226] [2021-10-11 02:23:05,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 02:23:05,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:05,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 02:23:05,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:23:05,698 INFO L87 Difference]: Start difference. First operand 407 states and 1100 transitions. Second operand 8 states. [2021-10-11 02:23:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:05,913 INFO L93 Difference]: Finished difference Result 546 states and 1436 transitions. [2021-10-11 02:23:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:23:05,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2021-10-11 02:23:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:05,916 INFO L225 Difference]: With dead ends: 546 [2021-10-11 02:23:05,916 INFO L226 Difference]: Without dead ends: 480 [2021-10-11 02:23:05,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:23:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-10-11 02:23:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 407. [2021-10-11 02:23:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-10-11 02:23:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1080 transitions. [2021-10-11 02:23:05,928 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1080 transitions. Word has length 28 [2021-10-11 02:23:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:05,929 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1080 transitions. [2021-10-11 02:23:05,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 02:23:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1080 transitions. [2021-10-11 02:23:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-11 02:23:05,930 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:05,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:05,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 02:23:05,931 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:05,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:05,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1861199413, now seen corresponding path program 3 times [2021-10-11 02:23:05,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:05,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853511035] [2021-10-11 02:23:05,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:23:06,023 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:23:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:23:06,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:23:06,153 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:23:06,153 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:23:06,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 02:23:06,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:23:06 BasicIcfg [2021-10-11 02:23:06,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:23:06,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:23:06,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:23:06,319 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:23:06,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:22:48" (3/4) ... [2021-10-11 02:23:06,321 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:23:06,478 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6087692-64c8-4590-a763-0177b4b481b9/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:23:06,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:23:06,479 INFO L168 Benchmark]: Toolchain (without parser) took 21292.95 ms. Allocated memory was 115.3 MB in the beginning and 794.8 MB in the end (delta: 679.5 MB). Free memory was 86.4 MB in the beginning and 635.8 MB in the end (delta: -549.4 MB). Peak memory consumption was 129.0 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:06,480 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 115.3 MB. Free memory is still 70.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:23:06,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.28 ms. Allocated memory is still 115.3 MB. Free memory was 86.2 MB in the beginning and 63.1 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:06,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.14 ms. Allocated memory is still 115.3 MB. Free memory was 63.1 MB in the beginning and 60.5 MB in the end (delta: 2.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:23:06,481 INFO L168 Benchmark]: Boogie Preprocessor took 44.99 ms. Allocated memory is still 115.3 MB. Free memory was 60.5 MB in the beginning and 58.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:06,482 INFO L168 Benchmark]: RCFGBuilder took 2519.23 ms. Allocated memory was 115.3 MB in the beginning and 192.9 MB in the end (delta: 77.6 MB). Free memory was 58.0 MB in the beginning and 104.8 MB in the end (delta: -46.8 MB). Peak memory consumption was 48.0 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:06,482 INFO L168 Benchmark]: TraceAbstraction took 17692.68 ms. Allocated memory was 192.9 MB in the beginning and 794.8 MB in the end (delta: 601.9 MB). Free memory was 103.7 MB in the beginning and 661.0 MB in the end (delta: -557.3 MB). Peak memory consumption was 298.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:06,483 INFO L168 Benchmark]: Witness Printer took 160.30 ms. Allocated memory is still 794.8 MB. Free memory was 661.0 MB in the beginning and 635.8 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:06,485 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 115.3 MB. Free memory is still 70.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 787.28 ms. Allocated memory is still 115.3 MB. Free memory was 86.2 MB in the beginning and 63.1 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 79.14 ms. Allocated memory is still 115.3 MB. Free memory was 63.1 MB in the beginning and 60.5 MB in the end (delta: 2.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.99 ms. Allocated memory is still 115.3 MB. Free memory was 60.5 MB in the beginning and 58.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2519.23 ms. Allocated memory was 115.3 MB in the beginning and 192.9 MB in the end (delta: 77.6 MB). Free memory was 58.0 MB in the beginning and 104.8 MB in the end (delta: -46.8 MB). Peak memory consumption was 48.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17692.68 ms. Allocated memory was 192.9 MB in the beginning and 794.8 MB in the end (delta: 601.9 MB). Free memory was 103.7 MB in the beginning and 661.0 MB in the end (delta: -557.3 MB). Peak memory consumption was 298.5 MB. Max. memory is 16.1 GB. * Witness Printer took 160.30 ms. Allocated memory is still 794.8 MB. Free memory was 661.0 MB in the beginning and 635.8 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1895 VarBasedMoverChecksPositive, 88 VarBasedMoverChecksNegative, 13 SemBasedMoverChecksPositive, 75 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.9s, 289 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.4s, 129 PlacesBefore, 47 PlacesAfterwards, 118 TransitionsBefore, 34 TransitionsAfterwards, 2774 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 8591 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t545; [L867] FCALL, FORK 0 pthread_create(&t545, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t546; [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t546, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t547; [L871] FCALL, FORK 0 pthread_create(&t547, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t548; [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L805] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L873] FCALL, FORK 0 pthread_create(&t548, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L822] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.3s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.8s, HoareTripleCheckerStatistics: 507 SDtfs, 829 SDslu, 1098 SDs, 0 SdLazy, 500 SolverSat, 160 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4874occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 2906 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 37528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...