./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_power.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_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/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 44d69b6c34c60af2ee6c7100a2da5b2c479afd97 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:12:16,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 16:12:16,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 16:12:16,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 16:12:16,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 16:12:16,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 16:12:16,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 16:12:16,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 16:12:16,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 16:12:16,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 16:12:16,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 16:12:16,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 16:12:16,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 16:12:16,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 16:12:16,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 16:12:16,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 16:12:16,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 16:12:16,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 16:12:16,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 16:12:16,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 16:12:16,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 16:12:16,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 16:12:16,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 16:12:16,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 16:12:16,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 16:12:16,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 16:12:16,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 16:12:16,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 16:12:16,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 16:12:16,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 16:12:16,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 16:12:16,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 16:12:16,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 16:12:16,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 16:12:16,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 16:12:16,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 16:12:16,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 16:12:16,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 16:12:16,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 16:12:16,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 16:12:16,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 16:12:16,358 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 16:12:16,375 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 16:12:16,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 16:12:16,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 16:12:16,376 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 16:12:16,376 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 16:12:16,376 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 16:12:16,376 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 16:12:16,376 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 16:12:16,376 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 16:12:16,376 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 16:12:16,377 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 16:12:16,377 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 16:12:16,377 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 16:12:16,377 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 16:12:16,377 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 16:12:16,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 16:12:16,378 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 16:12:16,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 16:12:16,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 16:12:16,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 16:12:16,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 16:12:16,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 16:12:16,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 16:12:16,379 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 16:12:16,379 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 16:12:16,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 16:12:16,379 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 16:12:16,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 16:12:16,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 16:12:16,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 16:12:16,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:12:16,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 16:12:16,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 16:12:16,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 16:12:16,380 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 16:12:16,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 16:12:16,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 16:12:16,381 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 16:12:16,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 16:12:16,381 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_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/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_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/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 -> 44d69b6c34c60af2ee6c7100a2da5b2c479afd97 [2020-12-09 16:12:16,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 16:12:16,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 16:12:16,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 16:12:16,562 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 16:12:16,563 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 16:12:16,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix047_power.opt.i [2020-12-09 16:12:16,605 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/bin/utaipan/data/db71bb5da/c6d3857c9b7a4d179c387b9a92dab730/FLAG298de223d [2020-12-09 16:12:17,046 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 16:12:17,046 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/sv-benchmarks/c/pthread-wmm/mix047_power.opt.i [2020-12-09 16:12:17,058 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/bin/utaipan/data/db71bb5da/c6d3857c9b7a4d179c387b9a92dab730/FLAG298de223d [2020-12-09 16:12:17,070 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/bin/utaipan/data/db71bb5da/c6d3857c9b7a4d179c387b9a92dab730 [2020-12-09 16:12:17,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 16:12:17,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 16:12:17,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 16:12:17,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 16:12:17,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 16:12:17,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:12:17" (1/1) ... [2020-12-09 16:12:17,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24029f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17, skipping insertion in model container [2020-12-09 16:12:17,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:12:17" (1/1) ... [2020-12-09 16:12:17,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 16:12:17,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 16:12:17,240 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_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/sv-benchmarks/c/pthread-wmm/mix047_power.opt.i[950,963] [2020-12-09 16:12:17,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:12:17,374 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 16:12:17,382 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_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/sv-benchmarks/c/pthread-wmm/mix047_power.opt.i[950,963] [2020-12-09 16:12:17,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:12:17,475 INFO L208 MainTranslator]: Completed translation [2020-12-09 16:12:17,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17 WrapperNode [2020-12-09 16:12:17,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 16:12:17,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 16:12:17,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 16:12:17,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 16:12:17,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17" (1/1) ... [2020-12-09 16:12:17,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17" (1/1) ... [2020-12-09 16:12:17,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 16:12:17,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 16:12:17,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 16:12:17,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 16:12:17,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17" (1/1) ... [2020-12-09 16:12:17,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17" (1/1) ... [2020-12-09 16:12:17,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17" (1/1) ... [2020-12-09 16:12:17,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17" (1/1) ... [2020-12-09 16:12:17,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17" (1/1) ... [2020-12-09 16:12:17,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17" (1/1) ... [2020-12-09 16:12:17,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17" (1/1) ... [2020-12-09 16:12:17,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 16:12:17,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 16:12:17,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 16:12:17,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 16:12:17,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/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 16:12:17,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 16:12:17,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 16:12:17,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 16:12:17,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 16:12:17,594 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 16:12:17,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 16:12:17,595 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 16:12:17,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 16:12:17,595 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 16:12:17,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 16:12:17,595 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-09 16:12:17,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-09 16:12:17,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 16:12:17,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 16:12:17,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 16:12:17,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 16:12:17,597 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 16:12:18,904 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 16:12:18,904 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 16:12:18,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:12:18 BoogieIcfgContainer [2020-12-09 16:12:18,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 16:12:18,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 16:12:18,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 16:12:18,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 16:12:18,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:12:17" (1/3) ... [2020-12-09 16:12:18,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7407e995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:12:18, skipping insertion in model container [2020-12-09 16:12:18,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:12:17" (2/3) ... [2020-12-09 16:12:18,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7407e995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:12:18, skipping insertion in model container [2020-12-09 16:12:18,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:12:18" (3/3) ... [2020-12-09 16:12:18,912 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_power.opt.i [2020-12-09 16:12:18,925 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 16:12:18,925 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 16:12:18,928 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 16:12:18,929 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 16:12:18,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,960 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,960 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,960 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,960 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,962 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,965 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,965 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,965 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,965 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,965 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,966 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,970 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,970 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,971 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,971 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,973 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,973 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,975 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,975 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,976 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 16:12:18,977 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 16:12:18,984 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-09 16:12:18,998 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 16:12:18,998 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 16:12:18,998 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 16:12:18,998 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 16:12:18,999 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 16:12:18,999 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 16:12:18,999 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 16:12:18,999 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 16:12:19,007 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 16:12:19,009 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 252 flow [2020-12-09 16:12:19,011 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 252 flow [2020-12-09 16:12:19,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2020-12-09 16:12:19,049 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2020-12-09 16:12:19,049 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 16:12:19,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-12-09 16:12:19,056 INFO L116 LiptonReduction]: Number of co-enabled transitions 2598 [2020-12-09 16:12:19,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 16:12:19,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:19,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 16:12:19,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:19,463 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 16:12:19,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:19,468 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:19,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:19,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:19,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:19,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:19,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:19,512 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:19,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:20,389 WARN L197 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-12-09 16:12:20,686 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-12-09 16:12:22,271 WARN L197 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2020-12-09 16:12:22,988 WARN L197 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2020-12-09 16:12:23,050 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:23,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,051 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:23,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 16:12:23,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:23,093 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 16:12:23,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:23,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 16:12:23,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 16:12:23,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:23,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:23,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:23,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,191 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:23,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 16:12:23,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:23,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 16:12:23,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:23,383 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 16:12:23,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:23,383 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 16:12:23,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:23,414 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:23,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,415 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:23,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,513 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:23,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:23,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,536 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:23,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,538 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:23,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:23,572 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:23,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:23,573 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:23,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:23,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:23,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:23,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:23,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:23,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:23,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:23,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:23,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:23,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:23,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:23,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:23,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:23,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 16:12:23,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:24,020 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 16:12:24,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:24,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 16:12:24,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:24,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:24,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:24,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 16:12:24,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 16:12:24,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:24,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:24,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:24,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,228 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:24,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 16:12:24,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:24,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 16:12:24,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:24,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:24,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:24,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,362 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:24,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,363 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:24,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,389 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:24,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:24,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:24,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:24,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 16:12:24,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 16:12:24,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:24,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:24,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,466 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:24,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:24,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:24,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 16:12:24,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:24,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 16:12:24,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:24,786 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-12-09 16:12:25,178 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-12-09 16:12:25,286 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 16:12:25,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 16:12:25,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:25,352 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 16:12:25,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:25,375 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:25,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:25,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,429 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:25,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:25,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,447 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:25,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,448 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:25,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:25,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:25,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:25,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:25,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:25,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,576 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:25,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 16:12:25,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 16:12:25,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 16:12:25,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:25,607 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:25,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:25,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:25,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:25,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,705 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:25,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,707 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,710 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,711 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,713 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,714 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,743 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 16:12:25,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,744 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 16:12:25,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,745 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 16:12:25,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 16:12:25,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 16:12:25,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:25,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:25,923 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:25,924 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:25,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:25,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:25,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:25,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:25,940 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:25,940 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:26,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,043 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:26,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:26,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:26,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:26,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,107 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,109 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:26,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:26,125 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,126 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:26,129 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:12:26,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:26,304 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:26,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:12:26,317 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:26,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 16:12:26,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:12:27,698 WARN L197 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-12-09 16:12:27,865 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-09 16:12:28,217 WARN L197 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-12-09 16:12:28,356 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-09 16:12:28,367 INFO L131 LiptonReduction]: Checked pairs total: 6530 [2020-12-09 16:12:28,367 INFO L133 LiptonReduction]: Total number of compositions: 95 [2020-12-09 16:12:28,371 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-12-09 16:12:28,506 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-12-09 16:12:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-12-09 16:12:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 16:12:28,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:28,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:28,513 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash -212030370, now seen corresponding path program 1 times [2020-12-09 16:12:28,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:28,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133131128] [2020-12-09 16:12:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:28,697 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 16:12:28,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133131128] [2020-12-09 16:12:28,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:28,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 16:12:28,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153483726] [2020-12-09 16:12:28,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:12:28,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:12:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:12:28,717 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-12-09 16:12:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:28,802 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-12-09 16:12:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:12:28,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 16:12:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:28,838 INFO L225 Difference]: With dead ends: 3082 [2020-12-09 16:12:28,839 INFO L226 Difference]: Without dead ends: 2602 [2020-12-09 16:12:28,839 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 16:12:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-12-09 16:12:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-12-09 16:12:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-12-09 16:12:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-12-09 16:12:28,971 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-12-09 16:12:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:28,972 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-12-09 16:12:28,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:12:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-12-09 16:12:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 16:12:28,975 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:28,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:28,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 16:12:28,975 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:28,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1303453965, now seen corresponding path program 1 times [2020-12-09 16:12:28,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:28,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131051098] [2020-12-09 16:12:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:29,094 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 16:12:29,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131051098] [2020-12-09 16:12:29,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:29,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:12:29,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906343338] [2020-12-09 16:12:29,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:12:29,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:29,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:12:29,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:12:29,096 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-12-09 16:12:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:29,145 INFO L93 Difference]: Finished difference Result 2762 states and 10352 transitions. [2020-12-09 16:12:29,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:12:29,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-09 16:12:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:29,162 INFO L225 Difference]: With dead ends: 2762 [2020-12-09 16:12:29,162 INFO L226 Difference]: Without dead ends: 2282 [2020-12-09 16:12:29,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:12:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-12-09 16:12:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-12-09 16:12:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-12-09 16:12:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-12-09 16:12:29,237 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12 [2020-12-09 16:12:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:29,238 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-12-09 16:12:29,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:12:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-12-09 16:12:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 16:12:29,240 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:29,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:29,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 16:12:29,240 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:29,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:29,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1557426930, now seen corresponding path program 1 times [2020-12-09 16:12:29,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:29,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275125771] [2020-12-09 16:12:29,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:29,358 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 16:12:29,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275125771] [2020-12-09 16:12:29,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:29,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:12:29,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031259790] [2020-12-09 16:12:29,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:12:29,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:29,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:12:29,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:12:29,360 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 6 states. [2020-12-09 16:12:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:29,470 INFO L93 Difference]: Finished difference Result 2474 states and 9152 transitions. [2020-12-09 16:12:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 16:12:29,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-09 16:12:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:29,485 INFO L225 Difference]: With dead ends: 2474 [2020-12-09 16:12:29,485 INFO L226 Difference]: Without dead ends: 2154 [2020-12-09 16:12:29,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-09 16:12:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-12-09 16:12:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-12-09 16:12:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-12-09 16:12:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-12-09 16:12:29,539 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 14 [2020-12-09 16:12:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:29,540 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-12-09 16:12:29,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:12:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-12-09 16:12:29,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 16:12:29,542 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:29,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:29,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 16:12:29,543 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:29,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2094626102, now seen corresponding path program 1 times [2020-12-09 16:12:29,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:29,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114482046] [2020-12-09 16:12:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:29,598 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 16:12:29,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114482046] [2020-12-09 16:12:29,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:29,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:12:29,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289502186] [2020-12-09 16:12:29,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:12:29,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:29,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:12:29,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:12:29,599 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 4 states. [2020-12-09 16:12:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:29,633 INFO L93 Difference]: Finished difference Result 2346 states and 8612 transitions. [2020-12-09 16:12:29,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:12:29,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 16:12:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:29,648 INFO L225 Difference]: With dead ends: 2346 [2020-12-09 16:12:29,648 INFO L226 Difference]: Without dead ends: 2090 [2020-12-09 16:12:29,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:12:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-12-09 16:12:29,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2020-12-09 16:12:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-12-09 16:12:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7828 transitions. [2020-12-09 16:12:29,722 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7828 transitions. Word has length 16 [2020-12-09 16:12:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:29,722 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7828 transitions. [2020-12-09 16:12:29,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:12:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7828 transitions. [2020-12-09 16:12:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 16:12:29,725 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:29,726 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 16:12:29,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 16:12:29,726 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:29,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:29,726 INFO L82 PathProgramCache]: Analyzing trace with hash -642297683, now seen corresponding path program 1 times [2020-12-09 16:12:29,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:29,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920617159] [2020-12-09 16:12:29,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:29,823 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 16:12:29,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920617159] [2020-12-09 16:12:29,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:29,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:12:29,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840130250] [2020-12-09 16:12:29,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 16:12:29,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:29,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 16:12:29,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:12:29,825 INFO L87 Difference]: Start difference. First operand 2090 states and 7828 transitions. Second operand 7 states. [2020-12-09 16:12:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:29,998 INFO L93 Difference]: Finished difference Result 2726 states and 10016 transitions. [2020-12-09 16:12:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 16:12:29,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-12-09 16:12:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:30,014 INFO L225 Difference]: With dead ends: 2726 [2020-12-09 16:12:30,014 INFO L226 Difference]: Without dead ends: 2474 [2020-12-09 16:12:30,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-12-09 16:12:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2020-12-09 16:12:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2418. [2020-12-09 16:12:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2020-12-09 16:12:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 8988 transitions. [2020-12-09 16:12:30,085 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 8988 transitions. Word has length 17 [2020-12-09 16:12:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:30,085 INFO L481 AbstractCegarLoop]: Abstraction has 2418 states and 8988 transitions. [2020-12-09 16:12:30,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 16:12:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 8988 transitions. [2020-12-09 16:12:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 16:12:30,088 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:30,089 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 16:12:30,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 16:12:30,089 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:30,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:30,089 INFO L82 PathProgramCache]: Analyzing trace with hash -650622512, now seen corresponding path program 1 times [2020-12-09 16:12:30,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:30,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179164931] [2020-12-09 16:12:30,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:30,141 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 16:12:30,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179164931] [2020-12-09 16:12:30,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:30,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:12:30,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844423296] [2020-12-09 16:12:30,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:12:30,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:30,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:12:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:12:30,142 INFO L87 Difference]: Start difference. First operand 2418 states and 8988 transitions. Second operand 4 states. [2020-12-09 16:12:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:30,178 INFO L93 Difference]: Finished difference Result 2534 states and 9282 transitions. [2020-12-09 16:12:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:12:30,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-09 16:12:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:30,194 INFO L225 Difference]: With dead ends: 2534 [2020-12-09 16:12:30,194 INFO L226 Difference]: Without dead ends: 2394 [2020-12-09 16:12:30,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:12:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2020-12-09 16:12:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2394. [2020-12-09 16:12:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2020-12-09 16:12:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 8888 transitions. [2020-12-09 16:12:30,248 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 8888 transitions. Word has length 17 [2020-12-09 16:12:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:30,248 INFO L481 AbstractCegarLoop]: Abstraction has 2394 states and 8888 transitions. [2020-12-09 16:12:30,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:12:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 8888 transitions. [2020-12-09 16:12:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 16:12:30,252 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:30,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:30,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 16:12:30,252 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash 424461334, now seen corresponding path program 1 times [2020-12-09 16:12:30,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:30,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729759157] [2020-12-09 16:12:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:30,301 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 16:12:30,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729759157] [2020-12-09 16:12:30,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:30,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:12:30,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777821620] [2020-12-09 16:12:30,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:12:30,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:30,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:12:30,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:12:30,302 INFO L87 Difference]: Start difference. First operand 2394 states and 8888 transitions. Second operand 4 states. [2020-12-09 16:12:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:30,345 INFO L93 Difference]: Finished difference Result 3562 states and 12788 transitions. [2020-12-09 16:12:30,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:12:30,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-09 16:12:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:30,353 INFO L225 Difference]: With dead ends: 3562 [2020-12-09 16:12:30,353 INFO L226 Difference]: Without dead ends: 2554 [2020-12-09 16:12:30,353 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 16:12:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2020-12-09 16:12:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2362. [2020-12-09 16:12:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2020-12-09 16:12:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 8352 transitions. [2020-12-09 16:12:30,404 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 8352 transitions. Word has length 18 [2020-12-09 16:12:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:30,404 INFO L481 AbstractCegarLoop]: Abstraction has 2362 states and 8352 transitions. [2020-12-09 16:12:30,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:12:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 8352 transitions. [2020-12-09 16:12:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 16:12:30,408 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:30,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:30,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 16:12:30,409 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1500258638, now seen corresponding path program 1 times [2020-12-09 16:12:30,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:30,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051395912] [2020-12-09 16:12:30,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:30,460 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 16:12:30,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051395912] [2020-12-09 16:12:30,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:30,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:12:30,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203634181] [2020-12-09 16:12:30,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:12:30,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:12:30,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:12:30,462 INFO L87 Difference]: Start difference. First operand 2362 states and 8352 transitions. Second operand 4 states. [2020-12-09 16:12:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:30,492 INFO L93 Difference]: Finished difference Result 2468 states and 7932 transitions. [2020-12-09 16:12:30,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:12:30,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-09 16:12:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:30,504 INFO L225 Difference]: With dead ends: 2468 [2020-12-09 16:12:30,504 INFO L226 Difference]: Without dead ends: 1860 [2020-12-09 16:12:30,504 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 16:12:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2020-12-09 16:12:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1860. [2020-12-09 16:12:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2020-12-09 16:12:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 5956 transitions. [2020-12-09 16:12:30,537 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 5956 transitions. Word has length 18 [2020-12-09 16:12:30,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:30,538 INFO L481 AbstractCegarLoop]: Abstraction has 1860 states and 5956 transitions. [2020-12-09 16:12:30,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:12:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 5956 transitions. [2020-12-09 16:12:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 16:12:30,541 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:30,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:30,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 16:12:30,541 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:30,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:30,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1691256525, now seen corresponding path program 1 times [2020-12-09 16:12:30,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:30,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030853470] [2020-12-09 16:12:30,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:30,591 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 16:12:30,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030853470] [2020-12-09 16:12:30,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:30,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:12:30,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679725450] [2020-12-09 16:12:30,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:12:30,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:30,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:12:30,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:12:30,592 INFO L87 Difference]: Start difference. First operand 1860 states and 5956 transitions. Second operand 5 states. [2020-12-09 16:12:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:30,630 INFO L93 Difference]: Finished difference Result 1586 states and 4616 transitions. [2020-12-09 16:12:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 16:12:30,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-09 16:12:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:30,633 INFO L225 Difference]: With dead ends: 1586 [2020-12-09 16:12:30,633 INFO L226 Difference]: Without dead ends: 1194 [2020-12-09 16:12:30,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:12:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-12-09 16:12:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2020-12-09 16:12:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2020-12-09 16:12:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 3402 transitions. [2020-12-09 16:12:30,652 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 3402 transitions. Word has length 19 [2020-12-09 16:12:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:30,653 INFO L481 AbstractCegarLoop]: Abstraction has 1194 states and 3402 transitions. [2020-12-09 16:12:30,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:12:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 3402 transitions. [2020-12-09 16:12:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 16:12:30,655 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:30,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:30,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 16:12:30,655 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:30,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1807945115, now seen corresponding path program 1 times [2020-12-09 16:12:30,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:30,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436546919] [2020-12-09 16:12:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:30,696 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 16:12:30,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436546919] [2020-12-09 16:12:30,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:30,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:12:30,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647218581] [2020-12-09 16:12:30,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:12:30,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:30,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:12:30,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:12:30,698 INFO L87 Difference]: Start difference. First operand 1194 states and 3402 transitions. Second operand 4 states. [2020-12-09 16:12:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:30,724 INFO L93 Difference]: Finished difference Result 1745 states and 4762 transitions. [2020-12-09 16:12:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:12:30,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-12-09 16:12:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:30,726 INFO L225 Difference]: With dead ends: 1745 [2020-12-09 16:12:30,727 INFO L226 Difference]: Without dead ends: 1214 [2020-12-09 16:12:30,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:12:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-12-09 16:12:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1162. [2020-12-09 16:12:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2020-12-09 16:12:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 3142 transitions. [2020-12-09 16:12:30,746 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 3142 transitions. Word has length 21 [2020-12-09 16:12:30,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:30,746 INFO L481 AbstractCegarLoop]: Abstraction has 1162 states and 3142 transitions. [2020-12-09 16:12:30,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:12:30,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 3142 transitions. [2020-12-09 16:12:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 16:12:30,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:30,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:30,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 16:12:30,748 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:30,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:30,749 INFO L82 PathProgramCache]: Analyzing trace with hash 744690865, now seen corresponding path program 1 times [2020-12-09 16:12:30,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:30,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390388676] [2020-12-09 16:12:30,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:30,800 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 16:12:30,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390388676] [2020-12-09 16:12:30,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:30,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:12:30,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77074989] [2020-12-09 16:12:30,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:12:30,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:30,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:12:30,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:12:30,801 INFO L87 Difference]: Start difference. First operand 1162 states and 3142 transitions. Second operand 6 states. [2020-12-09 16:12:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:30,855 INFO L93 Difference]: Finished difference Result 989 states and 2610 transitions. [2020-12-09 16:12:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 16:12:30,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-09 16:12:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:30,858 INFO L225 Difference]: With dead ends: 989 [2020-12-09 16:12:30,858 INFO L226 Difference]: Without dead ends: 794 [2020-12-09 16:12:30,858 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:12:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-12-09 16:12:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 714. [2020-12-09 16:12:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2020-12-09 16:12:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1858 transitions. [2020-12-09 16:12:30,878 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1858 transitions. Word has length 21 [2020-12-09 16:12:30,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:30,878 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 1858 transitions. [2020-12-09 16:12:30,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:12:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1858 transitions. [2020-12-09 16:12:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 16:12:30,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:30,880 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:30,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 16:12:30,881 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:30,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:30,881 INFO L82 PathProgramCache]: Analyzing trace with hash -630177842, now seen corresponding path program 1 times [2020-12-09 16:12:30,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:30,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167130936] [2020-12-09 16:12:30,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:30,940 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 16:12:30,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167130936] [2020-12-09 16:12:30,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:30,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:12:30,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654950356] [2020-12-09 16:12:30,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:12:30,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:30,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:12:30,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:12:30,942 INFO L87 Difference]: Start difference. First operand 714 states and 1858 transitions. Second operand 5 states. [2020-12-09 16:12:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:30,979 INFO L93 Difference]: Finished difference Result 932 states and 2356 transitions. [2020-12-09 16:12:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:12:30,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-12-09 16:12:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:30,981 INFO L225 Difference]: With dead ends: 932 [2020-12-09 16:12:30,981 INFO L226 Difference]: Without dead ends: 503 [2020-12-09 16:12:30,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:12:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2020-12-09 16:12:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 497. [2020-12-09 16:12:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-12-09 16:12:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1160 transitions. [2020-12-09 16:12:30,990 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1160 transitions. Word has length 24 [2020-12-09 16:12:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:30,990 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 1160 transitions. [2020-12-09 16:12:30,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:12:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1160 transitions. [2020-12-09 16:12:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 16:12:30,992 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:30,992 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:30,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 16:12:30,992 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:30,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1375101256, now seen corresponding path program 1 times [2020-12-09 16:12:30,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:30,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216452175] [2020-12-09 16:12:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:31,114 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 16:12:31,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216452175] [2020-12-09 16:12:31,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:31,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 16:12:31,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366804842] [2020-12-09 16:12:31,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 16:12:31,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:31,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 16:12:31,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 16:12:31,115 INFO L87 Difference]: Start difference. First operand 497 states and 1160 transitions. Second operand 8 states. [2020-12-09 16:12:31,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:31,236 INFO L93 Difference]: Finished difference Result 685 states and 1552 transitions. [2020-12-09 16:12:31,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 16:12:31,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-09 16:12:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:31,237 INFO L225 Difference]: With dead ends: 685 [2020-12-09 16:12:31,238 INFO L226 Difference]: Without dead ends: 483 [2020-12-09 16:12:31,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-12-09 16:12:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2020-12-09 16:12:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 429. [2020-12-09 16:12:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2020-12-09 16:12:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 941 transitions. [2020-12-09 16:12:31,244 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 941 transitions. Word has length 24 [2020-12-09 16:12:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:31,245 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 941 transitions. [2020-12-09 16:12:31,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 16:12:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 941 transitions. [2020-12-09 16:12:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 16:12:31,246 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:31,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:31,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 16:12:31,246 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:31,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1110779720, now seen corresponding path program 2 times [2020-12-09 16:12:31,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:31,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431486684] [2020-12-09 16:12:31,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:31,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 16:12:31,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431486684] [2020-12-09 16:12:31,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:31,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 16:12:31,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146025341] [2020-12-09 16:12:31,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 16:12:31,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 16:12:31,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 16:12:31,384 INFO L87 Difference]: Start difference. First operand 429 states and 941 transitions. Second operand 8 states. [2020-12-09 16:12:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:31,505 INFO L93 Difference]: Finished difference Result 477 states and 1054 transitions. [2020-12-09 16:12:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 16:12:31,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-09 16:12:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:31,507 INFO L225 Difference]: With dead ends: 477 [2020-12-09 16:12:31,507 INFO L226 Difference]: Without dead ends: 370 [2020-12-09 16:12:31,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 16:12:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-12-09 16:12:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 322. [2020-12-09 16:12:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-12-09 16:12:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions. [2020-12-09 16:12:31,513 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 24 [2020-12-09 16:12:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:31,513 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 700 transitions. [2020-12-09 16:12:31,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 16:12:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions. [2020-12-09 16:12:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 16:12:31,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:31,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:31,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 16:12:31,514 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:31,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:31,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1317308865, now seen corresponding path program 1 times [2020-12-09 16:12:31,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:31,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446143770] [2020-12-09 16:12:31,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:12:31,595 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 16:12:31,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446143770] [2020-12-09 16:12:31,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:12:31,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 16:12:31,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785356600] [2020-12-09 16:12:31,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 16:12:31,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:12:31,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 16:12:31,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:12:31,596 INFO L87 Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 7 states. [2020-12-09 16:12:31,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:12:31,643 INFO L93 Difference]: Finished difference Result 293 states and 643 transitions. [2020-12-09 16:12:31,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 16:12:31,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-09 16:12:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:12:31,644 INFO L225 Difference]: With dead ends: 293 [2020-12-09 16:12:31,644 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 16:12:31,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-09 16:12:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 16:12:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-12-09 16:12:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 16:12:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-12-09 16:12:31,646 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24 [2020-12-09 16:12:31,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:12:31,646 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-12-09 16:12:31,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 16:12:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-12-09 16:12:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 16:12:31,647 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:12:31,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:12:31,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 16:12:31,647 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:12:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:12:31,647 INFO L82 PathProgramCache]: Analyzing trace with hash 189494572, now seen corresponding path program 1 times [2020-12-09 16:12:31,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:12:31,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407416196] [2020-12-09 16:12:31,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:12:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 16:12:31,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 16:12:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 16:12:31,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 16:12:31,736 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 16:12:31,737 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 16:12:31,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 16:12:31,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:12:31 BasicIcfg [2020-12-09 16:12:31,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 16:12:31,818 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 16:12:31,818 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 16:12:31,818 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 16:12:31,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:12:18" (3/4) ... [2020-12-09 16:12:31,820 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 16:12:31,900 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ee4f36b7-6e40-4ce0-8c88-9a5058dae35e/bin/utaipan/witness.graphml [2020-12-09 16:12:31,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 16:12:31,900 INFO L168 Benchmark]: Toolchain (without parser) took 14826.07 ms. Allocated memory was 98.6 MB in the beginning and 299.9 MB in the end (delta: 201.3 MB). Free memory was 68.7 MB in the beginning and 179.1 MB in the end (delta: -110.4 MB). Peak memory consumption was 90.3 MB. Max. memory is 16.1 GB. [2020-12-09 16:12:31,900 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 98.6 MB. Free memory is still 63.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 16:12:31,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.40 ms. Allocated memory is still 98.6 MB. Free memory was 68.6 MB in the beginning and 51.0 MB in the end (delta: 17.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 16:12:31,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.35 ms. Allocated memory is still 98.6 MB. Free memory was 51.0 MB in the beginning and 47.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 16:12:31,901 INFO L168 Benchmark]: Boogie Preprocessor took 25.82 ms. Allocated memory is still 98.6 MB. Free memory was 47.8 MB in the beginning and 45.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 16:12:31,901 INFO L168 Benchmark]: RCFGBuilder took 1363.56 ms. Allocated memory was 98.6 MB in the beginning and 142.6 MB in the end (delta: 44.0 MB). Free memory was 45.7 MB in the beginning and 83.7 MB in the end (delta: -38.1 MB). Peak memory consumption was 55.3 MB. Max. memory is 16.1 GB. [2020-12-09 16:12:31,902 INFO L168 Benchmark]: TraceAbstraction took 12910.44 ms. Allocated memory was 142.6 MB in the beginning and 299.9 MB in the end (delta: 157.3 MB). Free memory was 83.7 MB in the beginning and 198.0 MB in the end (delta: -114.3 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.1 GB. [2020-12-09 16:12:31,902 INFO L168 Benchmark]: Witness Printer took 81.70 ms. Allocated memory is still 299.9 MB. Free memory was 198.0 MB in the beginning and 179.1 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-09 16:12:31,903 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.13 ms. Allocated memory is still 98.6 MB. Free memory is still 63.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 400.40 ms. Allocated memory is still 98.6 MB. Free memory was 68.6 MB in the beginning and 51.0 MB in the end (delta: 17.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.35 ms. Allocated memory is still 98.6 MB. Free memory was 51.0 MB in the beginning and 47.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.82 ms. Allocated memory is still 98.6 MB. Free memory was 47.8 MB in the beginning and 45.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1363.56 ms. Allocated memory was 98.6 MB in the beginning and 142.6 MB in the end (delta: 44.0 MB). Free memory was 45.7 MB in the beginning and 83.7 MB in the end (delta: -38.1 MB). Peak memory consumption was 55.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12910.44 ms. Allocated memory was 142.6 MB in the beginning and 299.9 MB in the end (delta: 157.3 MB). Free memory was 83.7 MB in the beginning and 198.0 MB in the end (delta: -114.3 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.1 GB. * Witness Printer took 81.70 ms. Allocated memory is still 299.9 MB. Free memory was 198.0 MB in the beginning and 179.1 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1554 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 50 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 168 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.3s, 127 PlacesBefore, 46 PlacesAfterwards, 116 TransitionsBefore, 34 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 6530 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L783] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 609 SDtfs, 714 SDslu, 1217 SDs, 0 SdLazy, 365 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 488 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 29022 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...