./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_rmo.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_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/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 705751e283da1212468c8fcd6c0544284571103c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:08:28,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 07:08:28,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 07:08:28,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 07:08:28,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 07:08:28,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 07:08:28,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 07:08:28,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 07:08:28,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 07:08:28,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 07:08:28,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 07:08:28,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 07:08:28,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 07:08:28,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 07:08:28,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 07:08:28,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 07:08:28,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 07:08:28,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 07:08:28,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 07:08:28,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 07:08:28,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 07:08:28,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 07:08:28,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 07:08:28,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 07:08:28,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 07:08:28,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 07:08:28,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 07:08:28,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 07:08:28,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 07:08:28,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 07:08:28,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 07:08:28,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 07:08:28,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 07:08:28,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 07:08:28,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 07:08:28,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 07:08:28,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 07:08:28,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 07:08:28,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 07:08:28,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 07:08:28,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 07:08:28,289 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 07:08:28,312 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 07:08:28,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 07:08:28,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 07:08:28,313 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 07:08:28,313 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 07:08:28,313 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 07:08:28,314 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 07:08:28,314 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 07:08:28,314 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 07:08:28,314 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 07:08:28,314 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 07:08:28,314 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 07:08:28,315 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 07:08:28,315 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 07:08:28,315 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 07:08:28,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 07:08:28,316 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 07:08:28,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 07:08:28,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 07:08:28,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 07:08:28,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 07:08:28,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 07:08:28,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 07:08:28,317 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 07:08:28,317 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 07:08:28,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 07:08:28,317 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 07:08:28,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 07:08:28,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 07:08:28,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 07:08:28,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:08:28,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 07:08:28,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 07:08:28,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 07:08:28,319 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 07:08:28,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 07:08:28,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 07:08:28,319 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 07:08:28,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 07:08:28,320 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_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/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_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/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 -> 705751e283da1212468c8fcd6c0544284571103c [2020-12-09 07:08:28,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 07:08:28,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 07:08:28,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 07:08:28,539 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 07:08:28,540 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 07:08:28,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix056_rmo.opt.i [2020-12-09 07:08:28,585 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/bin/utaipan/data/515faeeba/93e7d07748ee40c5b7ab88ca6f017dfa/FLAG56ab24846 [2020-12-09 07:08:28,982 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 07:08:28,982 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/sv-benchmarks/c/pthread-wmm/mix056_rmo.opt.i [2020-12-09 07:08:28,993 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/bin/utaipan/data/515faeeba/93e7d07748ee40c5b7ab88ca6f017dfa/FLAG56ab24846 [2020-12-09 07:08:29,002 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/bin/utaipan/data/515faeeba/93e7d07748ee40c5b7ab88ca6f017dfa [2020-12-09 07:08:29,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 07:08:29,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 07:08:29,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 07:08:29,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 07:08:29,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 07:08:29,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:08:29" (1/1) ... [2020-12-09 07:08:29,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625869e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29, skipping insertion in model container [2020-12-09 07:08:29,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:08:29" (1/1) ... [2020-12-09 07:08:29,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 07:08:29,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 07:08:29,152 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_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/sv-benchmarks/c/pthread-wmm/mix056_rmo.opt.i[948,961] [2020-12-09 07:08:29,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:08:29,295 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 07:08:29,306 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_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/sv-benchmarks/c/pthread-wmm/mix056_rmo.opt.i[948,961] [2020-12-09 07:08:29,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:08:29,404 INFO L208 MainTranslator]: Completed translation [2020-12-09 07:08:29,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29 WrapperNode [2020-12-09 07:08:29,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 07:08:29,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 07:08:29,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 07:08:29,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 07:08:29,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29" (1/1) ... [2020-12-09 07:08:29,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29" (1/1) ... [2020-12-09 07:08:29,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 07:08:29,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 07:08:29,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 07:08:29,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 07:08:29,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29" (1/1) ... [2020-12-09 07:08:29,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29" (1/1) ... [2020-12-09 07:08:29,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29" (1/1) ... [2020-12-09 07:08:29,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29" (1/1) ... [2020-12-09 07:08:29,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29" (1/1) ... [2020-12-09 07:08:29,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29" (1/1) ... [2020-12-09 07:08:29,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29" (1/1) ... [2020-12-09 07:08:29,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 07:08:29,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 07:08:29,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 07:08:29,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 07:08:29,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/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 07:08:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 07:08:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 07:08:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 07:08:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 07:08:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 07:08:29,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 07:08:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 07:08:29,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 07:08:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 07:08:29,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 07:08:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 07:08:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 07:08:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 07:08:29,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 07:08:29,549 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 07:08:30,800 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 07:08:30,801 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 07:08:30,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:30 BoogieIcfgContainer [2020-12-09 07:08:30,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 07:08:30,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 07:08:30,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 07:08:30,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 07:08:30,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:08:29" (1/3) ... [2020-12-09 07:08:30,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17de21d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:08:30, skipping insertion in model container [2020-12-09 07:08:30,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:29" (2/3) ... [2020-12-09 07:08:30,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17de21d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:08:30, skipping insertion in model container [2020-12-09 07:08:30,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:30" (3/3) ... [2020-12-09 07:08:30,811 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_rmo.opt.i [2020-12-09 07:08:30,821 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 07:08:30,821 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 07:08:30,824 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 07:08:30,824 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 07:08:30,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,855 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,855 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,855 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,857 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,857 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,858 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,858 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,862 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,863 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,863 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,863 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,863 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,864 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,864 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,865 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,871 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,871 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,873 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,874 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,877 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,877 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,878 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:08:30,880 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 07:08:30,890 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-09 07:08:30,906 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 07:08:30,907 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 07:08:30,907 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 07:08:30,907 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 07:08:30,907 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 07:08:30,907 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 07:08:30,907 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 07:08:30,907 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 07:08:30,917 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 07:08:30,919 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 207 flow [2020-12-09 07:08:30,921 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 207 flow [2020-12-09 07:08:30,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2020-12-09 07:08:30,961 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-12-09 07:08:30,961 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 07:08:30,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-12-09 07:08:30,967 INFO L116 LiptonReduction]: Number of co-enabled transitions 1578 [2020-12-09 07:08:31,090 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:31,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:31,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:08:31,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:31,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:31,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:31,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:31,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:31,387 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 07:08:31,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:31,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 07:08:31,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:31,773 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 07:08:31,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:32,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 07:08:32,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,027 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:32,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:32,062 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-09 07:08:32,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:32,098 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:32,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:32,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,330 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:32,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-09 07:08:32,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:32,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:32,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,399 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:32,401 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:32,403 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:32,405 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:32,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:32,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:32,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:32,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:32,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:32,478 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:32,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:32,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,548 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:32,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:32,605 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:32,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:32,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:32,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:32,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:32,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:32,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:32,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,668 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:32,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,672 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:32,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:32,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:32,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,738 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,738 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:32,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,756 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:32,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:08:32,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:32,947 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,948 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:32,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,967 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:32,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,968 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:32,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 07:08:32,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,977 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-09 07:08:32,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:32,977 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 07:08:32,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,003 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:33,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:33,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:33,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:33,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:33,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:33,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,129 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:33,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:33,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:33,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,163 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:33,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:33,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:33,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,167 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:33,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:33,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:33,170 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:33,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:33,171 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:33,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:33,173 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:33,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:33,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:33,175 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:33,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:34,349 WARN L197 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-12-09 07:08:34,680 WARN L197 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-09 07:08:36,338 WARN L197 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-12-09 07:08:37,064 WARN L197 SmtUtils]: Spent 724.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2020-12-09 07:08:37,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:37,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:37,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,147 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:37,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:37,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:37,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:37,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:37,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:37,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,184 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:37,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:37,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:37,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:37,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:37,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:37,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:08:37,189 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:37,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:37,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,191 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 07:08:37,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:37,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:37,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:08:37,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:37,295 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:37,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:37,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,314 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:37,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,315 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:37,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:37,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:37,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:08:37,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:37,352 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:37,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,353 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:37,353 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,370 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:37,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:37,371 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:37,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:38,033 WARN L197 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 186 [2020-12-09 07:08:38,373 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-09 07:08:39,830 WARN L197 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 266 DAG size of output: 265 [2020-12-09 07:08:40,561 WARN L197 SmtUtils]: Spent 729.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2020-12-09 07:08:40,644 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:40,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 07:08:40,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,659 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:40,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,660 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:40,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:40,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:40,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-09 07:08:40,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:40,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:40,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,701 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:40,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:40,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:40,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,741 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:40,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,741 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:40,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,970 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:40,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,971 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:40,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:40,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:40,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:40,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:40,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:40,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:41,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,003 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,118 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:41,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,119 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:41,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,121 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:41,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:41,122 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:41,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,148 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:41,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,152 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,154 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:41,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:41,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,202 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:41,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:41,203 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-09 07:08:41,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:41,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:41,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,236 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,272 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:41,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,273 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:41,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:41,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:41,276 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:41,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:41,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:41,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,318 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:41,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:41,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,338 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:41,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:41,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:41,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:41,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:41,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:41,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:41,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:41,873 WARN L197 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2020-12-09 07:08:42,230 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2020-12-09 07:08:43,329 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 280 [2020-12-09 07:08:44,426 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 280 [2020-12-09 07:08:44,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,466 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:44,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:44,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,528 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:44,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:08:44,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:44,545 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,546 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:44,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,568 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:44,569 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:08:44,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:44,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:44,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,604 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:44,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:44,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:08:44,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:44,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 07:08:44,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,653 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:44,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:44,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-09 07:08:44,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:44,696 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:44,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:44,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:44,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,007 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-12-09 07:08:45,113 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-12-09 07:08:45,125 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,125 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:45,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:45,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,165 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:45,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:45,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,212 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,213 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:45,213 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:45,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:45,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:45,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,236 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:45,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,244 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,244 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,283 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,283 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:45,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:45,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,332 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:45,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,333 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:45,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:45,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:45,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,359 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:45,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,362 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,362 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,365 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:45,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:45,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-09 07:08:45,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:45,438 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:45,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,440 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:45,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:45,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:45,478 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:45,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:08:45,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,522 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,524 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 07:08:45,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 07:08:45,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 07:08:45,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:45,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:08:45,556 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 07:08:45,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:08:45,876 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-12-09 07:08:46,000 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 07:08:46,282 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-12-09 07:08:46,421 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 07:08:46,424 INFO L131 LiptonReduction]: Checked pairs total: 4119 [2020-12-09 07:08:46,424 INFO L133 LiptonReduction]: Total number of compositions: 82 [2020-12-09 07:08:46,428 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-12-09 07:08:46,455 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-12-09 07:08:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-12-09 07:08:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 07:08:46,461 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:46,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:46,461 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:46,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1688597714, now seen corresponding path program 1 times [2020-12-09 07:08:46,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:46,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533015205] [2020-12-09 07:08:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:46,648 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 07:08:46,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533015205] [2020-12-09 07:08:46,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:46,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 07:08:46,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961523986] [2020-12-09 07:08:46,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:08:46,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:46,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:08:46,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:08:46,664 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-12-09 07:08:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:46,738 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-12-09 07:08:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:08:46,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 07:08:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:46,752 INFO L225 Difference]: With dead ends: 550 [2020-12-09 07:08:46,753 INFO L226 Difference]: Without dead ends: 450 [2020-12-09 07:08:46,753 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 07:08:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-12-09 07:08:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-12-09 07:08:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-12-09 07:08:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-12-09 07:08:46,815 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-12-09 07:08:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:46,815 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-12-09 07:08:46,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:08:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-12-09 07:08:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 07:08:46,817 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:46,817 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:46,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 07:08:46,818 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:46,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:46,818 INFO L82 PathProgramCache]: Analyzing trace with hash -755162037, now seen corresponding path program 1 times [2020-12-09 07:08:46,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:46,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765340950] [2020-12-09 07:08:46,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:46,906 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 07:08:46,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765340950] [2020-12-09 07:08:46,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:46,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 07:08:46,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157615005] [2020-12-09 07:08:46,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:08:46,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:46,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:08:46,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:08:46,908 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-12-09 07:08:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:46,919 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-12-09 07:08:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:08:46,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 07:08:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:46,924 INFO L225 Difference]: With dead ends: 440 [2020-12-09 07:08:46,924 INFO L226 Difference]: Without dead ends: 440 [2020-12-09 07:08:46,924 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 07:08:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-12-09 07:08:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-12-09 07:08:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-12-09 07:08:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-12-09 07:08:46,944 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-12-09 07:08:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:46,944 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-12-09 07:08:46,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:08:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-12-09 07:08:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 07:08:46,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:46,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:46,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 07:08:46,946 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1858919521, now seen corresponding path program 1 times [2020-12-09 07:08:46,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:46,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314977706] [2020-12-09 07:08:46,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:47,030 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 07:08:47,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314977706] [2020-12-09 07:08:47,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:47,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:08:47,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139272058] [2020-12-09 07:08:47,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:08:47,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:08:47,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:08:47,032 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states. [2020-12-09 07:08:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:47,073 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-12-09 07:08:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:08:47,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 07:08:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:47,077 INFO L225 Difference]: With dead ends: 434 [2020-12-09 07:08:47,077 INFO L226 Difference]: Without dead ends: 434 [2020-12-09 07:08:47,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:08:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-12-09 07:08:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-12-09 07:08:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-09 07:08:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-12-09 07:08:47,090 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-12-09 07:08:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:47,090 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-12-09 07:08:47,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:08:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-12-09 07:08:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 07:08:47,092 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:47,092 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:47,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 07:08:47,093 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:47,093 INFO L82 PathProgramCache]: Analyzing trace with hash -83130053, now seen corresponding path program 1 times [2020-12-09 07:08:47,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:47,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538800728] [2020-12-09 07:08:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:47,215 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 07:08:47,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538800728] [2020-12-09 07:08:47,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:47,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:08:47,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904028410] [2020-12-09 07:08:47,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:08:47,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:47,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:08:47,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:08:47,217 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 5 states. [2020-12-09 07:08:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:47,268 INFO L93 Difference]: Finished difference Result 422 states and 1257 transitions. [2020-12-09 07:08:47,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:08:47,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-09 07:08:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:47,272 INFO L225 Difference]: With dead ends: 422 [2020-12-09 07:08:47,272 INFO L226 Difference]: Without dead ends: 422 [2020-12-09 07:08:47,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:08:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-12-09 07:08:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2020-12-09 07:08:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-12-09 07:08:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1257 transitions. [2020-12-09 07:08:47,282 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1257 transitions. Word has length 11 [2020-12-09 07:08:47,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:47,283 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1257 transitions. [2020-12-09 07:08:47,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:08:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1257 transitions. [2020-12-09 07:08:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 07:08:47,284 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:47,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:47,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 07:08:47,284 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:47,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:47,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1790574892, now seen corresponding path program 1 times [2020-12-09 07:08:47,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:47,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33533569] [2020-12-09 07:08:47,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:47,382 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 07:08:47,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33533569] [2020-12-09 07:08:47,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:47,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:08:47,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345457082] [2020-12-09 07:08:47,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:08:47,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:47,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:08:47,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:08:47,383 INFO L87 Difference]: Start difference. First operand 422 states and 1257 transitions. Second operand 5 states. [2020-12-09 07:08:47,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:47,444 INFO L93 Difference]: Finished difference Result 410 states and 1213 transitions. [2020-12-09 07:08:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:08:47,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-09 07:08:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:47,448 INFO L225 Difference]: With dead ends: 410 [2020-12-09 07:08:47,448 INFO L226 Difference]: Without dead ends: 410 [2020-12-09 07:08:47,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:08:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-12-09 07:08:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2020-12-09 07:08:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-12-09 07:08:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1213 transitions. [2020-12-09 07:08:47,458 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1213 transitions. Word has length 11 [2020-12-09 07:08:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:47,458 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1213 transitions. [2020-12-09 07:08:47,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:08:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1213 transitions. [2020-12-09 07:08:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 07:08:47,459 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:47,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:47,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 07:08:47,459 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:47,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:47,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1716580242, now seen corresponding path program 1 times [2020-12-09 07:08:47,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:47,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015472213] [2020-12-09 07:08:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:47,542 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 07:08:47,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015472213] [2020-12-09 07:08:47,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:47,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:08:47,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341665943] [2020-12-09 07:08:47,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:08:47,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:47,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:08:47,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:08:47,544 INFO L87 Difference]: Start difference. First operand 410 states and 1213 transitions. Second operand 6 states. [2020-12-09 07:08:47,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:47,612 INFO L93 Difference]: Finished difference Result 478 states and 1432 transitions. [2020-12-09 07:08:47,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:08:47,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-12-09 07:08:47,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:47,616 INFO L225 Difference]: With dead ends: 478 [2020-12-09 07:08:47,616 INFO L226 Difference]: Without dead ends: 478 [2020-12-09 07:08:47,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:08:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-12-09 07:08:47,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 438. [2020-12-09 07:08:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-12-09 07:08:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1306 transitions. [2020-12-09 07:08:47,628 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1306 transitions. Word has length 12 [2020-12-09 07:08:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:47,628 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 1306 transitions. [2020-12-09 07:08:47,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:08:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1306 transitions. [2020-12-09 07:08:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 07:08:47,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:47,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:47,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 07:08:47,629 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:47,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1717935252, now seen corresponding path program 2 times [2020-12-09 07:08:47,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:47,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618536301] [2020-12-09 07:08:47,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:47,752 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 07:08:47,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618536301] [2020-12-09 07:08:47,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:47,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:08:47,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118217413] [2020-12-09 07:08:47,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:08:47,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:47,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:08:47,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:08:47,754 INFO L87 Difference]: Start difference. First operand 438 states and 1306 transitions. Second operand 6 states. [2020-12-09 07:08:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:47,845 INFO L93 Difference]: Finished difference Result 518 states and 1534 transitions. [2020-12-09 07:08:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:08:47,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-12-09 07:08:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:47,849 INFO L225 Difference]: With dead ends: 518 [2020-12-09 07:08:47,849 INFO L226 Difference]: Without dead ends: 518 [2020-12-09 07:08:47,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:08:47,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-12-09 07:08:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 466. [2020-12-09 07:08:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-12-09 07:08:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1375 transitions. [2020-12-09 07:08:47,862 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1375 transitions. Word has length 12 [2020-12-09 07:08:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:47,862 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 1375 transitions. [2020-12-09 07:08:47,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:08:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1375 transitions. [2020-12-09 07:08:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 07:08:47,863 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:47,863 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:47,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 07:08:47,863 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:47,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:47,863 INFO L82 PathProgramCache]: Analyzing trace with hash -326754992, now seen corresponding path program 3 times [2020-12-09 07:08:47,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:47,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795491541] [2020-12-09 07:08:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:48,015 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 07:08:48,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795491541] [2020-12-09 07:08:48,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:48,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:08:48,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193929401] [2020-12-09 07:08:48,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:08:48,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:48,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:08:48,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:08:48,017 INFO L87 Difference]: Start difference. First operand 466 states and 1375 transitions. Second operand 6 states. [2020-12-09 07:08:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:48,169 INFO L93 Difference]: Finished difference Result 538 states and 1573 transitions. [2020-12-09 07:08:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:08:48,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-12-09 07:08:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:48,175 INFO L225 Difference]: With dead ends: 538 [2020-12-09 07:08:48,175 INFO L226 Difference]: Without dead ends: 538 [2020-12-09 07:08:48,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:08:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-12-09 07:08:48,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 474. [2020-12-09 07:08:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2020-12-09 07:08:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1393 transitions. [2020-12-09 07:08:48,192 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1393 transitions. Word has length 12 [2020-12-09 07:08:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:48,193 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 1393 transitions. [2020-12-09 07:08:48,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:08:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1393 transitions. [2020-12-09 07:08:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 07:08:48,194 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:48,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:48,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 07:08:48,194 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:48,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:48,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1674378185, now seen corresponding path program 1 times [2020-12-09 07:08:48,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:48,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071503778] [2020-12-09 07:08:48,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:48,382 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 07:08:48,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071503778] [2020-12-09 07:08:48,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:48,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:08:48,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829557957] [2020-12-09 07:08:48,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 07:08:48,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:48,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 07:08:48,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:08:48,384 INFO L87 Difference]: Start difference. First operand 474 states and 1393 transitions. Second operand 7 states. [2020-12-09 07:08:48,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:48,460 INFO L93 Difference]: Finished difference Result 550 states and 1626 transitions. [2020-12-09 07:08:48,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:08:48,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-12-09 07:08:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:48,464 INFO L225 Difference]: With dead ends: 550 [2020-12-09 07:08:48,464 INFO L226 Difference]: Without dead ends: 550 [2020-12-09 07:08:48,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:08:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-12-09 07:08:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 502. [2020-12-09 07:08:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2020-12-09 07:08:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1486 transitions. [2020-12-09 07:08:48,478 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1486 transitions. Word has length 13 [2020-12-09 07:08:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:48,478 INFO L481 AbstractCegarLoop]: Abstraction has 502 states and 1486 transitions. [2020-12-09 07:08:48,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 07:08:48,479 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1486 transitions. [2020-12-09 07:08:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 07:08:48,479 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:48,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:48,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 07:08:48,480 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:48,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1716383495, now seen corresponding path program 2 times [2020-12-09 07:08:48,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:48,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267486155] [2020-12-09 07:08:48,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:48,666 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 07:08:48,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267486155] [2020-12-09 07:08:48,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:48,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:08:48,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152137017] [2020-12-09 07:08:48,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 07:08:48,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:48,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 07:08:48,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:08:48,668 INFO L87 Difference]: Start difference. First operand 502 states and 1486 transitions. Second operand 7 states. [2020-12-09 07:08:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:48,782 INFO L93 Difference]: Finished difference Result 486 states and 1434 transitions. [2020-12-09 07:08:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:08:48,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-12-09 07:08:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:48,786 INFO L225 Difference]: With dead ends: 486 [2020-12-09 07:08:48,787 INFO L226 Difference]: Without dead ends: 486 [2020-12-09 07:08:48,787 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:08:48,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2020-12-09 07:08:48,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 410. [2020-12-09 07:08:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-12-09 07:08:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1201 transitions. [2020-12-09 07:08:48,798 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1201 transitions. Word has length 13 [2020-12-09 07:08:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:48,798 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1201 transitions. [2020-12-09 07:08:48,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 07:08:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1201 transitions. [2020-12-09 07:08:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 07:08:48,799 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:48,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:48,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 07:08:48,800 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:48,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:48,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1618030389, now seen corresponding path program 1 times [2020-12-09 07:08:48,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:48,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578219816] [2020-12-09 07:08:48,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:48,856 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 07:08:48,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578219816] [2020-12-09 07:08:48,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:48,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:08:48,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752525064] [2020-12-09 07:08:48,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:08:48,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:48,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:08:48,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:08:48,858 INFO L87 Difference]: Start difference. First operand 410 states and 1201 transitions. Second operand 3 states. [2020-12-09 07:08:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:48,866 INFO L93 Difference]: Finished difference Result 298 states and 753 transitions. [2020-12-09 07:08:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:08:48,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-12-09 07:08:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:48,869 INFO L225 Difference]: With dead ends: 298 [2020-12-09 07:08:48,869 INFO L226 Difference]: Without dead ends: 298 [2020-12-09 07:08:48,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 07:08:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-12-09 07:08:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2020-12-09 07:08:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-12-09 07:08:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 753 transitions. [2020-12-09 07:08:48,875 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 753 transitions. Word has length 13 [2020-12-09 07:08:48,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:48,875 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 753 transitions. [2020-12-09 07:08:48,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:08:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 753 transitions. [2020-12-09 07:08:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 07:08:48,875 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:48,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:48,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 07:08:48,876 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:48,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:48,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1380114439, now seen corresponding path program 1 times [2020-12-09 07:08:48,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:48,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671354611] [2020-12-09 07:08:48,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:48,913 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 07:08:48,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671354611] [2020-12-09 07:08:48,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:48,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:08:48,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086894891] [2020-12-09 07:08:48,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:08:48,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:48,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:08:48,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:08:48,914 INFO L87 Difference]: Start difference. First operand 298 states and 753 transitions. Second operand 4 states. [2020-12-09 07:08:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:48,930 INFO L93 Difference]: Finished difference Result 193 states and 438 transitions. [2020-12-09 07:08:48,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:08:48,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 07:08:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:48,932 INFO L225 Difference]: With dead ends: 193 [2020-12-09 07:08:48,932 INFO L226 Difference]: Without dead ends: 193 [2020-12-09 07:08:48,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:08:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-12-09 07:08:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2020-12-09 07:08:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-12-09 07:08:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 438 transitions. [2020-12-09 07:08:48,937 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 438 transitions. Word has length 14 [2020-12-09 07:08:48,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:48,937 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 438 transitions. [2020-12-09 07:08:48,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:08:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 438 transitions. [2020-12-09 07:08:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 07:08:48,938 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:48,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:08:48,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 07:08:48,938 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:48,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1448775177, now seen corresponding path program 1 times [2020-12-09 07:08:48,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:48,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866753323] [2020-12-09 07:08:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:48,967 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 07:08:48,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866753323] [2020-12-09 07:08:48,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:48,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:08:48,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442202714] [2020-12-09 07:08:48,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:08:48,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:48,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:08:48,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:08:48,969 INFO L87 Difference]: Start difference. First operand 193 states and 438 transitions. Second operand 3 states. [2020-12-09 07:08:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:48,981 INFO L93 Difference]: Finished difference Result 274 states and 601 transitions. [2020-12-09 07:08:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:08:48,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-09 07:08:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:48,983 INFO L225 Difference]: With dead ends: 274 [2020-12-09 07:08:48,983 INFO L226 Difference]: Without dead ends: 194 [2020-12-09 07:08:48,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 07:08:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-12-09 07:08:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2020-12-09 07:08:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-09 07:08:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 396 transitions. [2020-12-09 07:08:48,988 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 396 transitions. Word has length 16 [2020-12-09 07:08:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:48,988 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 396 transitions. [2020-12-09 07:08:48,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:08:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 396 transitions. [2020-12-09 07:08:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 07:08:48,989 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:48,989 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 07:08:48,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 07:08:48,989 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 799491222, now seen corresponding path program 1 times [2020-12-09 07:08:48,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:48,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541110037] [2020-12-09 07:08:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:49,041 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 07:08:49,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541110037] [2020-12-09 07:08:49,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:49,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:08:49,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702621410] [2020-12-09 07:08:49,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:08:49,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:49,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:08:49,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:08:49,043 INFO L87 Difference]: Start difference. First operand 188 states and 396 transitions. Second operand 5 states. [2020-12-09 07:08:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:49,068 INFO L93 Difference]: Finished difference Result 157 states and 336 transitions. [2020-12-09 07:08:49,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:08:49,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-09 07:08:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:49,069 INFO L225 Difference]: With dead ends: 157 [2020-12-09 07:08:49,069 INFO L226 Difference]: Without dead ends: 101 [2020-12-09 07:08:49,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:08:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-12-09 07:08:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2020-12-09 07:08:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-12-09 07:08:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 196 transitions. [2020-12-09 07:08:49,072 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 196 transitions. Word has length 17 [2020-12-09 07:08:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:49,072 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 196 transitions. [2020-12-09 07:08:49,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:08:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 196 transitions. [2020-12-09 07:08:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:08:49,073 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:49,073 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] [2020-12-09 07:08:49,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 07:08:49,073 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:49,073 INFO L82 PathProgramCache]: Analyzing trace with hash 785212334, now seen corresponding path program 1 times [2020-12-09 07:08:49,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:49,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933536964] [2020-12-09 07:08:49,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:49,109 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 07:08:49,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933536964] [2020-12-09 07:08:49,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:49,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:08:49,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600106429] [2020-12-09 07:08:49,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:08:49,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:49,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:08:49,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:08:49,111 INFO L87 Difference]: Start difference. First operand 97 states and 196 transitions. Second operand 4 states. [2020-12-09 07:08:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:49,128 INFO L93 Difference]: Finished difference Result 132 states and 262 transitions. [2020-12-09 07:08:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:08:49,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-09 07:08:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:49,129 INFO L225 Difference]: With dead ends: 132 [2020-12-09 07:08:49,129 INFO L226 Difference]: Without dead ends: 47 [2020-12-09 07:08:49,130 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 07:08:49,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-09 07:08:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-12-09 07:08:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 07:08:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-12-09 07:08:49,131 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-12-09 07:08:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:49,132 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-12-09 07:08:49,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:08:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-12-09 07:08:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:08:49,132 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:49,132 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] [2020-12-09 07:08:49,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 07:08:49,133 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash 998345696, now seen corresponding path program 2 times [2020-12-09 07:08:49,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:49,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802157036] [2020-12-09 07:08:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:08:49,285 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 07:08:49,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802157036] [2020-12-09 07:08:49,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:08:49,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 07:08:49,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234587041] [2020-12-09 07:08:49,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 07:08:49,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:08:49,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 07:08:49,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:08:49,287 INFO L87 Difference]: Start difference. First operand 47 states and 80 transitions. Second operand 8 states. [2020-12-09 07:08:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:08:49,412 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2020-12-09 07:08:49,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:08:49,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-09 07:08:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:08:49,414 INFO L225 Difference]: With dead ends: 61 [2020-12-09 07:08:49,414 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 07:08:49,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:08:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 07:08:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-12-09 07:08:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-09 07:08:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-12-09 07:08:49,415 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 20 [2020-12-09 07:08:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:08:49,415 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-12-09 07:08:49,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 07:08:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-12-09 07:08:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:08:49,416 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:08:49,416 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] [2020-12-09 07:08:49,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 07:08:49,416 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:08:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:08:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1126641346, now seen corresponding path program 3 times [2020-12-09 07:08:49,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:08:49,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543104039] [2020-12-09 07:08:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:08:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:08:49,443 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:08:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:08:49,470 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:08:49,493 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 07:08:49,494 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 07:08:49,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 07:08:49,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:08:49 BasicIcfg [2020-12-09 07:08:49,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 07:08:49,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 07:08:49,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 07:08:49,546 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 07:08:49,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:30" (3/4) ... [2020-12-09 07:08:49,548 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 07:08:49,601 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8c4d5bfb-e4f1-45a5-a41d-d0eb5d8fc49e/bin/utaipan/witness.graphml [2020-12-09 07:08:49,601 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 07:08:49,602 INFO L168 Benchmark]: Toolchain (without parser) took 20597.18 ms. Allocated memory was 98.6 MB in the beginning and 213.9 MB in the end (delta: 115.3 MB). Free memory was 69.3 MB in the beginning and 121.1 MB in the end (delta: -51.8 MB). Peak memory consumption was 65.2 MB. Max. memory is 16.1 GB. [2020-12-09 07:08:49,602 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 67.1 MB. Free memory is still 39.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:08:49,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.53 ms. Allocated memory is still 98.6 MB. Free memory was 69.0 MB in the beginning and 52.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-09 07:08:49,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.39 ms. Allocated memory is still 98.6 MB. Free memory was 52.1 MB in the beginning and 73.6 MB in the end (delta: -21.5 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:08:49,603 INFO L168 Benchmark]: Boogie Preprocessor took 32.01 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 73.6 MB in the beginning and 95.7 MB in the end (delta: -22.1 MB). Peak memory consumption was 3.0 MB. Max. memory is 16.1 GB. [2020-12-09 07:08:49,603 INFO L168 Benchmark]: RCFGBuilder took 1316.84 ms. Allocated memory was 119.5 MB in the beginning and 144.7 MB in the end (delta: 25.2 MB). Free memory was 95.1 MB in the beginning and 107.9 MB in the end (delta: -12.9 MB). Peak memory consumption was 58.0 MB. Max. memory is 16.1 GB. [2020-12-09 07:08:49,604 INFO L168 Benchmark]: TraceAbstraction took 18740.92 ms. Allocated memory was 144.7 MB in the beginning and 213.9 MB in the end (delta: 69.2 MB). Free memory was 107.9 MB in the beginning and 133.6 MB in the end (delta: -25.7 MB). Peak memory consumption was 43.5 MB. Max. memory is 16.1 GB. [2020-12-09 07:08:49,604 INFO L168 Benchmark]: Witness Printer took 55.51 ms. Allocated memory is still 213.9 MB. Free memory was 133.6 MB in the beginning and 121.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 07:08:49,605 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.14 ms. Allocated memory is still 67.1 MB. Free memory is still 39.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 398.53 ms. Allocated memory is still 98.6 MB. Free memory was 69.0 MB in the beginning and 52.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.39 ms. Allocated memory is still 98.6 MB. Free memory was 52.1 MB in the beginning and 73.6 MB in the end (delta: -21.5 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.01 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 73.6 MB in the beginning and 95.7 MB in the end (delta: -22.1 MB). Peak memory consumption was 3.0 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1316.84 ms. Allocated memory was 119.5 MB in the beginning and 144.7 MB in the end (delta: 25.2 MB). Free memory was 95.1 MB in the beginning and 107.9 MB in the end (delta: -12.9 MB). Peak memory consumption was 58.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18740.92 ms. Allocated memory was 144.7 MB in the beginning and 213.9 MB in the end (delta: 69.2 MB). Free memory was 107.9 MB in the beginning and 133.6 MB in the end (delta: -25.7 MB). Peak memory consumption was 43.5 MB. Max. memory is 16.1 GB. * Witness Printer took 55.51 ms. Allocated memory is still 213.9 MB. Free memory was 133.6 MB in the beginning and 121.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1035 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 123 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 15.5s, 104 PlacesBefore, 35 PlacesAfterwards, 96 TransitionsBefore, 25 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 4119 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1504; [L814] FCALL, FORK 0 pthread_create(&t1504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1505; [L816] FCALL, FORK 0 pthread_create(&t1505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1506; [L818] FCALL, FORK 0 pthread_create(&t1506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L756] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.5s, HoareTripleCheckerStatistics: 375 SDtfs, 356 SDslu, 574 SDs, 0 SdLazy, 334 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 290 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 21156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...