./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_tso.opt.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-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan --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 7c74e01d3afb0ed9f191585ecc33df16c773e5f5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 [2020-12-09 06:47:18,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:47:18,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:47:18,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:47:18,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:47:18,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:47:18,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:47:18,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:47:18,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:47:18,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:47:19,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:47:19,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:47:19,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:47:19,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:47:19,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:47:19,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:47:19,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:47:19,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:47:19,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:47:19,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:47:19,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:47:19,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:47:19,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:47:19,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:47:19,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:47:19,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:47:19,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:47:19,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:47:19,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:47:19,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:47:19,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:47:19,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:47:19,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:47:19,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:47:19,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:47:19,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:47:19,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:47:19,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:47:19,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:47:19,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:47:19,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:47:19,030 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 06:47:19,049 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:47:19,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:47:19,050 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:47:19,050 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:47:19,050 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:47:19,050 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:47:19,050 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 06:47:19,050 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:47:19,050 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:47:19,050 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 06:47:19,050 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 06:47:19,051 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:47:19,051 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 06:47:19,051 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 06:47:19,051 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 06:47:19,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:47:19,051 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:47:19,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 06:47:19,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:47:19,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:47:19,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 06:47:19,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:47:19,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 06:47:19,052 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:47:19,052 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:47:19,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 06:47:19,053 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:47:19,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 06:47:19,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:47:19,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:47:19,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:47:19,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:47:19,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:47:19,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 06:47:19,053 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 06:47:19,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 06:47:19,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 06:47:19,054 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:47:19,054 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:47:19,054 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-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/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-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan 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 -> 7c74e01d3afb0ed9f191585ecc33df16c773e5f5 [2020-12-09 06:47:19,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:47:19,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:47:19,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:47:19,248 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:47:19,248 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:47:19,249 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i [2020-12-09 06:47:19,290 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/data/912158ea1/20ecc255056247eab791dae53e2062d6/FLAG680ffe150 [2020-12-09 06:47:19,732 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:47:19,733 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i [2020-12-09 06:47:19,747 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/data/912158ea1/20ecc255056247eab791dae53e2062d6/FLAG680ffe150 [2020-12-09 06:47:19,760 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/data/912158ea1/20ecc255056247eab791dae53e2062d6 [2020-12-09 06:47:19,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:47:19,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:47:19,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:47:19,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:47:19,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:47:19,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:47:19" (1/1) ... [2020-12-09 06:47:19,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69be5779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:19, skipping insertion in model container [2020-12-09 06:47:19,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:47:19" (1/1) ... [2020-12-09 06:47:19,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:47:19,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:47:19,929 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i[948,961] [2020-12-09 06:47:20,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:47:20,076 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 06:47:20,085 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i[948,961] [2020-12-09 06:47:20,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:47:20,201 INFO L208 MainTranslator]: Completed translation [2020-12-09 06:47:20,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20 WrapperNode [2020-12-09 06:47:20,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 06:47:20,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 06:47:20,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 06:47:20,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 06:47:20,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20" (1/1) ... [2020-12-09 06:47:20,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20" (1/1) ... [2020-12-09 06:47:20,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 06:47:20,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 06:47:20,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 06:47:20,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 06:47:20,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20" (1/1) ... [2020-12-09 06:47:20,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20" (1/1) ... [2020-12-09 06:47:20,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20" (1/1) ... [2020-12-09 06:47:20,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20" (1/1) ... [2020-12-09 06:47:20,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20" (1/1) ... [2020-12-09 06:47:20,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20" (1/1) ... [2020-12-09 06:47:20,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20" (1/1) ... [2020-12-09 06:47:20,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 06:47:20,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 06:47:20,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 06:47:20,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 06:47:20,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/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 [2020-12-09 06:47:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 06:47:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 06:47:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 06:47:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 06:47:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 06:47:20,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 06:47:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 06:47:20,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 06:47:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 06:47:20,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 06:47:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-09 06:47:20,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-09 06:47:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 06:47:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 06:47:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 06:47:20,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 06:47:20,339 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 06:47:21,633 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 06:47:21,633 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 06:47:21,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:47:21 BoogieIcfgContainer [2020-12-09 06:47:21,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 06:47:21,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 06:47:21,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 06:47:21,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 06:47:21,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:47:19" (1/3) ... [2020-12-09 06:47:21,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f323fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:47:21, skipping insertion in model container [2020-12-09 06:47:21,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:20" (2/3) ... [2020-12-09 06:47:21,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f323fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:47:21, skipping insertion in model container [2020-12-09 06:47:21,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:47:21" (3/3) ... [2020-12-09 06:47:21,640 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_tso.opt.i [2020-12-09 06:47:21,650 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 06:47:21,650 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 06:47:21,653 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 06:47:21,653 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 06:47:21,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,679 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,679 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,680 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,680 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,681 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,681 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,681 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,681 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,682 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,682 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,683 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,683 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,685 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,685 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,685 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,686 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,686 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,686 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,686 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,686 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,686 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,687 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,691 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,691 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,692 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,692 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,696 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,696 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,697 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:47:21,698 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 06:47:21,705 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-09 06:47:21,719 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 06:47:21,720 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 06:47:21,720 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 06:47:21,720 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 06:47:21,720 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 06:47:21,720 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 06:47:21,720 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 06:47:21,720 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 06:47:21,729 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 06:47:21,731 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 252 flow [2020-12-09 06:47:21,733 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 252 flow [2020-12-09 06:47:21,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2020-12-09 06:47:21,772 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2020-12-09 06:47:21,772 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 06:47:21,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-12-09 06:47:21,780 INFO L116 LiptonReduction]: Number of co-enabled transitions 2598 [2020-12-09 06:47:22,201 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 06:47:22,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:22,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 06:47:22,204 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:22,206 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 06:47:22,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:22,212 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:22,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:22,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:22,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:22,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:22,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:22,283 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:22,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:23,057 WARN L197 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-12-09 06:47:23,384 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-12-09 06:47:24,922 WARN L197 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2020-12-09 06:47:25,599 WARN L197 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2020-12-09 06:47:25,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:25,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:25,656 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:25,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:25,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:47:25,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:25,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 06:47:25,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:25,716 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:47:25,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:25,717 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:47:25,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:25,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:25,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:25,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:25,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:25,784 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:25,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:25,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:25,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:25,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:47:25,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:25,812 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 06:47:25,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:25,964 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:47:25,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:25,965 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 06:47:25,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:25,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:25,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:25,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:25,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:26,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:26,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:26,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:26,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:26,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:26,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:26,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:26,163 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:26,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:26,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:26,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:26,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:26,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:26,186 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:26,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:26,189 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:26,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:26,191 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:26,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:26,286 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 06:47:26,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:26,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:47:26,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:26,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 06:47:26,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:26,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:26,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:26,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:47:26,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:47:26,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:26,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:26,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,809 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:26,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,810 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:26,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:47:26,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:26,839 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 06:47:26,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:26,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:26,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,913 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:26,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,932 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:26,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,933 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:26,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,954 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:26,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,955 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:26,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:26,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:26,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:47:26,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:26,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:47:26,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:27,018 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:27,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:27,019 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:27,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:27,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:27,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:27,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:27,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:27,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:47:27,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:27,062 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 06:47:27,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:27,321 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-12-09 06:47:27,688 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-12-09 06:47:27,804 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 06:47:27,879 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:47:27,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:27,880 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 06:47:27,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:27,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:27,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:27,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:27,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:27,955 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:27,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:27,956 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:27,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:27,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:27,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:27,975 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:27,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,009 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:28,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,010 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:28,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:28,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:28,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,136 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:28,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,137 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:28,137 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,138 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:47:28,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 06:47:28,140 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:47:28,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,170 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,171 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,173 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,175 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,177 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:28,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:28,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:28,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:28,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,256 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,262 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,292 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:47:28,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,293 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:47:28,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:47:28,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 06:47:28,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:47:28,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,468 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:28,472 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:28,484 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,486 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:28,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:28,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,596 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:28,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:28,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:28,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:28,660 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,661 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:47:28,863 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:28,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:28,882 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,882 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:47:28,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:28,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:47:28,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:47:30,252 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-12-09 06:47:30,403 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-09 06:47:30,792 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-12-09 06:47:30,962 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-09 06:47:30,973 INFO L131 LiptonReduction]: Checked pairs total: 6530 [2020-12-09 06:47:30,973 INFO L133 LiptonReduction]: Total number of compositions: 95 [2020-12-09 06:47:30,977 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-12-09 06:47:31,121 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-12-09 06:47:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-12-09 06:47:31,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 06:47:31,128 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:31,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:47:31,129 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:31,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:31,133 INFO L82 PathProgramCache]: Analyzing trace with hash -212030370, now seen corresponding path program 1 times [2020-12-09 06:47:31,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:31,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051089306] [2020-12-09 06:47:31,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:31,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051089306] [2020-12-09 06:47:31,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:31,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 06:47:31,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307979127] [2020-12-09 06:47:31,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 06:47:31,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:31,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 06:47:31,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:47:31,367 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-12-09 06:47:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:31,475 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-12-09 06:47:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 06:47:31,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 06:47:31,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:31,522 INFO L225 Difference]: With dead ends: 3082 [2020-12-09 06:47:31,522 INFO L226 Difference]: Without dead ends: 2602 [2020-12-09 06:47:31,524 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 [2020-12-09 06:47:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-12-09 06:47:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-12-09 06:47:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-12-09 06:47:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-12-09 06:47:31,716 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-12-09 06:47:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:31,717 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-12-09 06:47:31,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 06:47:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-12-09 06:47:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 06:47:31,721 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:31,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:47:31,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 06:47:31,722 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:31,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1303453965, now seen corresponding path program 1 times [2020-12-09 06:47:31,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:31,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843559641] [2020-12-09 06:47:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:31,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843559641] [2020-12-09 06:47:31,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:31,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 06:47:31,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512026541] [2020-12-09 06:47:31,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:47:31,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:31,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:47:31,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:47:31,848 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-12-09 06:47:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:31,914 INFO L93 Difference]: Finished difference Result 2762 states and 10352 transitions. [2020-12-09 06:47:31,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:47:31,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-09 06:47:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:31,939 INFO L225 Difference]: With dead ends: 2762 [2020-12-09 06:47:31,939 INFO L226 Difference]: Without dead ends: 2282 [2020-12-09 06:47:31,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:47:31,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-12-09 06:47:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-12-09 06:47:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-12-09 06:47:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-12-09 06:47:32,034 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12 [2020-12-09 06:47:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:32,034 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-12-09 06:47:32,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:47:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-12-09 06:47:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 06:47:32,038 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:32,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:47:32,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 06:47:32,038 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:32,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1557426930, now seen corresponding path program 1 times [2020-12-09 06:47:32,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:32,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808702174] [2020-12-09 06:47:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:32,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808702174] [2020-12-09 06:47:32,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:32,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 06:47:32,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957101641] [2020-12-09 06:47:32,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:47:32,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:32,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:47:32,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:47:32,127 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 4 states. [2020-12-09 06:47:32,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:32,170 INFO L93 Difference]: Finished difference Result 2538 states and 9408 transitions. [2020-12-09 06:47:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:47:32,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 06:47:32,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:32,186 INFO L225 Difference]: With dead ends: 2538 [2020-12-09 06:47:32,187 INFO L226 Difference]: Without dead ends: 2218 [2020-12-09 06:47:32,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:47:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-12-09 06:47:32,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-12-09 06:47:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-12-09 06:47:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-12-09 06:47:32,268 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2020-12-09 06:47:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:32,268 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-12-09 06:47:32,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:47:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-12-09 06:47:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 06:47:32,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:32,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:47:32,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 06:47:32,271 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:32,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:32,271 INFO L82 PathProgramCache]: Analyzing trace with hash -898851598, now seen corresponding path program 1 times [2020-12-09 06:47:32,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:32,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041068266] [2020-12-09 06:47:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:32,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041068266] [2020-12-09 06:47:32,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:32,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 06:47:32,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554073605] [2020-12-09 06:47:32,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:47:32,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:32,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:47:32,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:47:32,324 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 4 states. [2020-12-09 06:47:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:32,385 INFO L93 Difference]: Finished difference Result 2410 states and 8912 transitions. [2020-12-09 06:47:32,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:47:32,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-09 06:47:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:32,407 INFO L225 Difference]: With dead ends: 2410 [2020-12-09 06:47:32,407 INFO L226 Difference]: Without dead ends: 2154 [2020-12-09 06:47:32,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:47:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-12-09 06:47:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-12-09 06:47:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-12-09 06:47:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-12-09 06:47:32,485 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 15 [2020-12-09 06:47:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:32,485 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-12-09 06:47:32,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:47:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-12-09 06:47:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 06:47:32,489 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:32,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:47:32,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 06:47:32,489 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:32,490 INFO L82 PathProgramCache]: Analyzing trace with hash -616250505, now seen corresponding path program 1 times [2020-12-09 06:47:32,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:32,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063491262] [2020-12-09 06:47:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:32,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063491262] [2020-12-09 06:47:32,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:32,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:47:32,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387315722] [2020-12-09 06:47:32,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:47:32,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:32,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:47:32,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:47:32,647 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 6 states. [2020-12-09 06:47:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:32,809 INFO L93 Difference]: Finished difference Result 2650 states and 9872 transitions. [2020-12-09 06:47:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 06:47:32,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-09 06:47:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:32,834 INFO L225 Difference]: With dead ends: 2650 [2020-12-09 06:47:32,834 INFO L226 Difference]: Without dead ends: 2394 [2020-12-09 06:47:32,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:47:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2020-12-09 06:47:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2394. [2020-12-09 06:47:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2020-12-09 06:47:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 9048 transitions. [2020-12-09 06:47:32,935 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 9048 transitions. Word has length 16 [2020-12-09 06:47:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:32,935 INFO L481 AbstractCegarLoop]: Abstraction has 2394 states and 9048 transitions. [2020-12-09 06:47:32,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:47:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 9048 transitions. [2020-12-09 06:47:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 06:47:32,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:32,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:47:32,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 06:47:32,940 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:32,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:32,941 INFO L82 PathProgramCache]: Analyzing trace with hash -570093675, now seen corresponding path program 2 times [2020-12-09 06:47:32,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:32,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263885927] [2020-12-09 06:47:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:33,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263885927] [2020-12-09 06:47:33,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:33,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:47:33,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323775896] [2020-12-09 06:47:33,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:47:33,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:33,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:47:33,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:47:33,040 INFO L87 Difference]: Start difference. First operand 2394 states and 9048 transitions. Second operand 6 states. [2020-12-09 06:47:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:33,120 INFO L93 Difference]: Finished difference Result 2562 states and 9460 transitions. [2020-12-09 06:47:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:47:33,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-09 06:47:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:33,139 INFO L225 Difference]: With dead ends: 2562 [2020-12-09 06:47:33,139 INFO L226 Difference]: Without dead ends: 2306 [2020-12-09 06:47:33,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:47:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2020-12-09 06:47:33,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2020-12-09 06:47:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2020-12-09 06:47:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 8664 transitions. [2020-12-09 06:47:33,223 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 8664 transitions. Word has length 16 [2020-12-09 06:47:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:33,223 INFO L481 AbstractCegarLoop]: Abstraction has 2306 states and 8664 transitions. [2020-12-09 06:47:33,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:47:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 8664 transitions. [2020-12-09 06:47:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 06:47:33,228 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:33,228 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:47:33,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 06:47:33,229 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:33,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash 788564047, now seen corresponding path program 1 times [2020-12-09 06:47:33,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:33,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840301056] [2020-12-09 06:47:33,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:33,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840301056] [2020-12-09 06:47:33,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:33,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:47:33,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482762476] [2020-12-09 06:47:33,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:47:33,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:47:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:47:33,317 INFO L87 Difference]: Start difference. First operand 2306 states and 8664 transitions. Second operand 6 states. [2020-12-09 06:47:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:33,396 INFO L93 Difference]: Finished difference Result 2598 states and 9576 transitions. [2020-12-09 06:47:33,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:47:33,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-09 06:47:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:33,404 INFO L225 Difference]: With dead ends: 2598 [2020-12-09 06:47:33,404 INFO L226 Difference]: Without dead ends: 2402 [2020-12-09 06:47:33,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:47:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2020-12-09 06:47:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2106. [2020-12-09 06:47:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-12-09 06:47:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7832 transitions. [2020-12-09 06:47:33,454 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7832 transitions. Word has length 17 [2020-12-09 06:47:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:33,454 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7832 transitions. [2020-12-09 06:47:33,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:47:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7832 transitions. [2020-12-09 06:47:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 06:47:33,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:33,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:47:33,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 06:47:33,458 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash 424461334, now seen corresponding path program 1 times [2020-12-09 06:47:33,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:33,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663207894] [2020-12-09 06:47:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:33,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663207894] [2020-12-09 06:47:33,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:33,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:47:33,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565705431] [2020-12-09 06:47:33,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:47:33,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:33,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:47:33,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:47:33,504 INFO L87 Difference]: Start difference. First operand 2106 states and 7832 transitions. Second operand 4 states. [2020-12-09 06:47:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:33,548 INFO L93 Difference]: Finished difference Result 3130 states and 11240 transitions. [2020-12-09 06:47:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:47:33,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-09 06:47:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:33,554 INFO L225 Difference]: With dead ends: 3130 [2020-12-09 06:47:33,554 INFO L226 Difference]: Without dead ends: 2266 [2020-12-09 06:47:33,555 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 [2020-12-09 06:47:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2020-12-09 06:47:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2074. [2020-12-09 06:47:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2020-12-09 06:47:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 7368 transitions. [2020-12-09 06:47:33,599 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 7368 transitions. Word has length 18 [2020-12-09 06:47:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:33,600 INFO L481 AbstractCegarLoop]: Abstraction has 2074 states and 7368 transitions. [2020-12-09 06:47:33,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:47:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 7368 transitions. [2020-12-09 06:47:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 06:47:33,603 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:33,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:47:33,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 06:47:33,603 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:33,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:33,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1500258638, now seen corresponding path program 1 times [2020-12-09 06:47:33,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:33,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534947386] [2020-12-09 06:47:33,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:33,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534947386] [2020-12-09 06:47:33,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:33,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:47:33,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102255925] [2020-12-09 06:47:33,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:47:33,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:33,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:47:33,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:47:33,652 INFO L87 Difference]: Start difference. First operand 2074 states and 7368 transitions. Second operand 4 states. [2020-12-09 06:47:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:33,684 INFO L93 Difference]: Finished difference Result 2138 states and 6909 transitions. [2020-12-09 06:47:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:47:33,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-09 06:47:33,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:33,688 INFO L225 Difference]: With dead ends: 2138 [2020-12-09 06:47:33,688 INFO L226 Difference]: Without dead ends: 1626 [2020-12-09 06:47:33,689 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 [2020-12-09 06:47:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2020-12-09 06:47:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1626. [2020-12-09 06:47:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-12-09 06:47:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 5224 transitions. [2020-12-09 06:47:33,722 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 5224 transitions. Word has length 18 [2020-12-09 06:47:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:33,722 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 5224 transitions. [2020-12-09 06:47:33,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:47:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 5224 transitions. [2020-12-09 06:47:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 06:47:33,725 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:33,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:47:33,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 06:47:33,725 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:33,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:33,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1691256525, now seen corresponding path program 1 times [2020-12-09 06:47:33,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:33,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735140339] [2020-12-09 06:47:33,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:33,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735140339] [2020-12-09 06:47:33,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:33,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:47:33,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654970781] [2020-12-09 06:47:33,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:47:33,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:33,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:47:33,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:47:33,776 INFO L87 Difference]: Start difference. First operand 1626 states and 5224 transitions. Second operand 5 states. [2020-12-09 06:47:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:33,816 INFO L93 Difference]: Finished difference Result 1373 states and 4010 transitions. [2020-12-09 06:47:33,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:47:33,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-09 06:47:33,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:33,820 INFO L225 Difference]: With dead ends: 1373 [2020-12-09 06:47:33,820 INFO L226 Difference]: Without dead ends: 1050 [2020-12-09 06:47:33,820 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 [2020-12-09 06:47:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2020-12-09 06:47:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1050. [2020-12-09 06:47:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2020-12-09 06:47:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 3006 transitions. [2020-12-09 06:47:33,846 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 3006 transitions. Word has length 19 [2020-12-09 06:47:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:33,846 INFO L481 AbstractCegarLoop]: Abstraction has 1050 states and 3006 transitions. [2020-12-09 06:47:33,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:47:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 3006 transitions. [2020-12-09 06:47:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 06:47:33,848 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:33,848 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] [2020-12-09 06:47:33,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 06:47:33,848 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1807945115, now seen corresponding path program 1 times [2020-12-09 06:47:33,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:33,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121514063] [2020-12-09 06:47:33,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:33,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121514063] [2020-12-09 06:47:33,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:33,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:47:33,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96185337] [2020-12-09 06:47:33,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:47:33,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:47:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:47:33,891 INFO L87 Difference]: Start difference. First operand 1050 states and 3006 transitions. Second operand 4 states. [2020-12-09 06:47:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:33,920 INFO L93 Difference]: Finished difference Result 1535 states and 4204 transitions. [2020-12-09 06:47:33,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:47:33,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-12-09 06:47:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:33,922 INFO L225 Difference]: With dead ends: 1535 [2020-12-09 06:47:33,923 INFO L226 Difference]: Without dead ends: 1070 [2020-12-09 06:47:33,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:47:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2020-12-09 06:47:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1030. [2020-12-09 06:47:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2020-12-09 06:47:33,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 2794 transitions. [2020-12-09 06:47:33,940 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 2794 transitions. Word has length 21 [2020-12-09 06:47:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:33,940 INFO L481 AbstractCegarLoop]: Abstraction has 1030 states and 2794 transitions. [2020-12-09 06:47:33,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:47:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 2794 transitions. [2020-12-09 06:47:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 06:47:33,942 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:33,942 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] [2020-12-09 06:47:33,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 06:47:33,942 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:33,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:33,943 INFO L82 PathProgramCache]: Analyzing trace with hash 744690865, now seen corresponding path program 1 times [2020-12-09 06:47:33,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:33,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932572002] [2020-12-09 06:47:33,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:33,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932572002] [2020-12-09 06:47:33,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:33,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:47:33,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761629742] [2020-12-09 06:47:33,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:47:33,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:33,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:47:33,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:47:33,994 INFO L87 Difference]: Start difference. First operand 1030 states and 2794 transitions. Second operand 6 states. [2020-12-09 06:47:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:34,038 INFO L93 Difference]: Finished difference Result 875 states and 2316 transitions. [2020-12-09 06:47:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:47:34,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-09 06:47:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:34,040 INFO L225 Difference]: With dead ends: 875 [2020-12-09 06:47:34,040 INFO L226 Difference]: Without dead ends: 704 [2020-12-09 06:47:34,041 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 [2020-12-09 06:47:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2020-12-09 06:47:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 684. [2020-12-09 06:47:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2020-12-09 06:47:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1786 transitions. [2020-12-09 06:47:34,052 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1786 transitions. Word has length 21 [2020-12-09 06:47:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:34,052 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 1786 transitions. [2020-12-09 06:47:34,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:47:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1786 transitions. [2020-12-09 06:47:34,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 06:47:34,053 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:34,053 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] [2020-12-09 06:47:34,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 06:47:34,053 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:34,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:34,054 INFO L82 PathProgramCache]: Analyzing trace with hash -630177842, now seen corresponding path program 1 times [2020-12-09 06:47:34,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:34,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166182043] [2020-12-09 06:47:34,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:34,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166182043] [2020-12-09 06:47:34,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:34,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:47:34,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320857245] [2020-12-09 06:47:34,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:47:34,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:34,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:47:34,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:47:34,136 INFO L87 Difference]: Start difference. First operand 684 states and 1786 transitions. Second operand 7 states. [2020-12-09 06:47:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:34,259 INFO L93 Difference]: Finished difference Result 1076 states and 2760 transitions. [2020-12-09 06:47:34,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:47:34,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-09 06:47:34,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:34,260 INFO L225 Difference]: With dead ends: 1076 [2020-12-09 06:47:34,260 INFO L226 Difference]: Without dead ends: 583 [2020-12-09 06:47:34,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-12-09 06:47:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-12-09 06:47:34,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 523. [2020-12-09 06:47:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-12-09 06:47:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1236 transitions. [2020-12-09 06:47:34,269 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 1236 transitions. Word has length 24 [2020-12-09 06:47:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:34,270 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 1236 transitions. [2020-12-09 06:47:34,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:47:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1236 transitions. [2020-12-09 06:47:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 06:47:34,271 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:34,271 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] [2020-12-09 06:47:34,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 06:47:34,271 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:34,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:34,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1375101256, now seen corresponding path program 1 times [2020-12-09 06:47:34,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:34,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957213653] [2020-12-09 06:47:34,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:34,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957213653] [2020-12-09 06:47:34,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:34,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:47:34,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639695385] [2020-12-09 06:47:34,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 06:47:34,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:34,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 06:47:34,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:47:34,417 INFO L87 Difference]: Start difference. First operand 523 states and 1236 transitions. Second operand 8 states. [2020-12-09 06:47:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:34,532 INFO L93 Difference]: Finished difference Result 631 states and 1447 transitions. [2020-12-09 06:47:34,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:47:34,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-09 06:47:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:34,533 INFO L225 Difference]: With dead ends: 631 [2020-12-09 06:47:34,533 INFO L226 Difference]: Without dead ends: 328 [2020-12-09 06:47:34,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 06:47:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-12-09 06:47:34,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2020-12-09 06:47:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-12-09 06:47:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions. [2020-12-09 06:47:34,538 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 24 [2020-12-09 06:47:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:34,538 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 700 transitions. [2020-12-09 06:47:34,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 06:47:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions. [2020-12-09 06:47:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 06:47:34,539 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:34,539 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] [2020-12-09 06:47:34,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 06:47:34,539 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:34,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:34,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1317308865, now seen corresponding path program 1 times [2020-12-09 06:47:34,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:34,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309479486] [2020-12-09 06:47:34,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:47:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:47:34,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309479486] [2020-12-09 06:47:34,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:47:34,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:47:34,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379155867] [2020-12-09 06:47:34,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:47:34,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:47:34,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:47:34,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:47:34,604 INFO L87 Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 7 states. [2020-12-09 06:47:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:47:34,647 INFO L93 Difference]: Finished difference Result 293 states and 643 transitions. [2020-12-09 06:47:34,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 06:47:34,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-09 06:47:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:47:34,648 INFO L225 Difference]: With dead ends: 293 [2020-12-09 06:47:34,648 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 06:47:34,648 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 [2020-12-09 06:47:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 06:47:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-12-09 06:47:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 06:47:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-12-09 06:47:34,650 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24 [2020-12-09 06:47:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:47:34,650 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-12-09 06:47:34,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:47:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-12-09 06:47:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 06:47:34,650 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:47:34,650 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] [2020-12-09 06:47:34,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 06:47:34,651 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:47:34,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:47:34,651 INFO L82 PathProgramCache]: Analyzing trace with hash 189494572, now seen corresponding path program 1 times [2020-12-09 06:47:34,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:47:34,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49777069] [2020-12-09 06:47:34,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:47:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:47:34,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:47:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:47:34,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:47:34,736 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 06:47:34,736 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 06:47:34,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 06:47:34,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:47:34 BasicIcfg [2020-12-09 06:47:34,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 06:47:34,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 06:47:34,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 06:47:34,805 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 06:47:34,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:47:21" (3/4) ... [2020-12-09 06:47:34,807 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 06:47:34,872 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cdb0ab7b-c22f-4d24-8059-a8dbde7b88dd/bin/utaipan/witness.graphml [2020-12-09 06:47:34,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 06:47:34,872 INFO L168 Benchmark]: Toolchain (without parser) took 15108.67 ms. Allocated memory was 96.5 MB in the beginning and 251.7 MB in the end (delta: 155.2 MB). Free memory was 73.4 MB in the beginning and 185.6 MB in the end (delta: -112.2 MB). Peak memory consumption was 165.0 MB. Max. memory is 16.1 GB. [2020-12-09 06:47:34,873 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 73.4 MB. Free memory was 43.6 MB in the beginning and 43.5 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:47:34,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.98 ms. Allocated memory is still 96.5 MB. Free memory was 73.2 MB in the beginning and 71.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 39.0 MB. Max. memory is 16.1 GB. [2020-12-09 06:47:34,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.97 ms. Allocated memory is still 96.5 MB. Free memory was 70.7 MB in the beginning and 67.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:47:34,873 INFO L168 Benchmark]: Boogie Preprocessor took 27.43 ms. Allocated memory is still 96.5 MB. Free memory was 67.8 MB in the beginning and 65.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:47:34,874 INFO L168 Benchmark]: RCFGBuilder took 1363.50 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 65.7 MB in the beginning and 81.2 MB in the end (delta: -15.5 MB). Peak memory consumption was 46.7 MB. Max. memory is 16.1 GB. [2020-12-09 06:47:34,874 INFO L168 Benchmark]: TraceAbstraction took 13168.58 ms. Allocated memory was 117.4 MB in the beginning and 251.7 MB in the end (delta: 134.2 MB). Free memory was 81.0 MB in the beginning and 70.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 146.5 MB. Max. memory is 16.1 GB. [2020-12-09 06:47:34,874 INFO L168 Benchmark]: Witness Printer took 66.97 ms. Allocated memory is still 251.7 MB. Free memory was 70.8 MB in the beginning and 185.6 MB in the end (delta: -114.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 06:47:34,876 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.16 ms. Allocated memory is still 73.4 MB. Free memory was 43.6 MB in the beginning and 43.5 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 436.98 ms. Allocated memory is still 96.5 MB. Free memory was 73.2 MB in the beginning and 71.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 39.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.97 ms. Allocated memory is still 96.5 MB. Free memory was 70.7 MB in the beginning and 67.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.43 ms. Allocated memory is still 96.5 MB. Free memory was 67.8 MB in the beginning and 65.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1363.50 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 65.7 MB in the beginning and 81.2 MB in the end (delta: -15.5 MB). Peak memory consumption was 46.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13168.58 ms. Allocated memory was 117.4 MB in the beginning and 251.7 MB in the end (delta: 134.2 MB). Free memory was 81.0 MB in the beginning and 70.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 146.5 MB. Max. memory is 16.1 GB. * Witness Printer took 66.97 ms. Allocated memory is still 251.7 MB. Free memory was 70.8 MB in the beginning and 185.6 MB in the end (delta: -114.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1554 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 50 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 168 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.2s, 127 PlacesBefore, 46 PlacesAfterwards, 116 TransitionsBefore, 34 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 6530 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1277; [L845] FCALL, FORK 0 pthread_create(&t1277, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1278; [L847] FCALL, FORK 0 pthread_create(&t1278, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1279; [L849] FCALL, FORK 0 pthread_create(&t1279, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1280; [L851] FCALL, FORK 0 pthread_create(&t1280, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L783] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 620 SDtfs, 783 SDslu, 1231 SDs, 0 SdLazy, 388 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 614 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 23413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...