./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/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 4d17dd244bf26472e4a76adf40fa7c8b5948f716 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:16:06,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 10:16:06,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 10:16:06,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 10:16:06,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 10:16:06,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 10:16:06,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 10:16:06,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 10:16:06,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 10:16:06,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 10:16:06,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 10:16:06,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 10:16:06,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 10:16:06,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 10:16:06,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 10:16:06,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 10:16:06,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 10:16:06,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 10:16:06,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 10:16:06,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 10:16:06,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 10:16:06,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 10:16:06,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 10:16:06,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 10:16:06,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 10:16:06,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 10:16:06,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 10:16:06,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 10:16:06,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 10:16:06,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 10:16:06,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 10:16:06,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 10:16:06,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 10:16:06,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 10:16:06,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 10:16:06,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 10:16:06,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 10:16:06,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 10:16:06,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 10:16:06,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 10:16:06,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 10:16:06,470 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 10:16:06,486 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 10:16:06,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 10:16:06,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 10:16:06,487 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 10:16:06,487 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 10:16:06,487 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 10:16:06,488 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 10:16:06,488 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 10:16:06,488 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 10:16:06,488 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 10:16:06,488 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 10:16:06,488 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 10:16:06,488 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 10:16:06,488 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 10:16:06,489 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 10:16:06,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 10:16:06,489 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 10:16:06,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 10:16:06,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 10:16:06,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 10:16:06,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 10:16:06,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 10:16:06,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 10:16:06,490 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 10:16:06,490 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 10:16:06,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 10:16:06,490 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 10:16:06,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 10:16:06,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 10:16:06,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 10:16:06,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 10:16:06,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 10:16:06,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 10:16:06,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 10:16:06,491 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 10:16:06,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 10:16:06,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 10:16:06,492 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 10:16:06,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 10:16:06,492 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_fffb69f6-2645-4c50-9a23-8b8d0d65d781/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_fffb69f6-2645-4c50-9a23-8b8d0d65d781/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 -> 4d17dd244bf26472e4a76adf40fa7c8b5948f716 [2020-12-09 10:16:06,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 10:16:06,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 10:16:06,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 10:16:06,674 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 10:16:06,675 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 10:16:06,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix054_rmo.opt.i [2020-12-09 10:16:06,723 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/bin/utaipan/data/d7422424e/d8995c58fc634deca31b000ee8c3faa3/FLAG9e18c7f27 [2020-12-09 10:16:07,162 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 10:16:07,163 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/sv-benchmarks/c/pthread-wmm/mix054_rmo.opt.i [2020-12-09 10:16:07,174 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/bin/utaipan/data/d7422424e/d8995c58fc634deca31b000ee8c3faa3/FLAG9e18c7f27 [2020-12-09 10:16:07,185 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/bin/utaipan/data/d7422424e/d8995c58fc634deca31b000ee8c3faa3 [2020-12-09 10:16:07,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 10:16:07,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 10:16:07,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 10:16:07,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 10:16:07,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 10:16:07,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:16:07" (1/1) ... [2020-12-09 10:16:07,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3db07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07, skipping insertion in model container [2020-12-09 10:16:07,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:16:07" (1/1) ... [2020-12-09 10:16:07,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 10:16:07,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 10:16:07,349 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_fffb69f6-2645-4c50-9a23-8b8d0d65d781/sv-benchmarks/c/pthread-wmm/mix054_rmo.opt.i[948,961] [2020-12-09 10:16:07,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:16:07,479 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 10:16:07,487 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_fffb69f6-2645-4c50-9a23-8b8d0d65d781/sv-benchmarks/c/pthread-wmm/mix054_rmo.opt.i[948,961] [2020-12-09 10:16:07,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:16:07,585 INFO L208 MainTranslator]: Completed translation [2020-12-09 10:16:07,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07 WrapperNode [2020-12-09 10:16:07,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 10:16:07,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 10:16:07,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 10:16:07,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 10:16:07,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07" (1/1) ... [2020-12-09 10:16:07,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07" (1/1) ... [2020-12-09 10:16:07,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 10:16:07,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 10:16:07,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 10:16:07,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 10:16:07,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07" (1/1) ... [2020-12-09 10:16:07,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07" (1/1) ... [2020-12-09 10:16:07,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07" (1/1) ... [2020-12-09 10:16:07,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07" (1/1) ... [2020-12-09 10:16:07,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07" (1/1) ... [2020-12-09 10:16:07,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07" (1/1) ... [2020-12-09 10:16:07,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07" (1/1) ... [2020-12-09 10:16:07,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 10:16:07,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 10:16:07,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 10:16:07,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 10:16:07,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/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 10:16:07,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 10:16:07,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 10:16:07,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 10:16:07,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 10:16:07,716 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 10:16:07,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 10:16:07,716 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 10:16:07,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 10:16:07,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 10:16:07,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 10:16:07,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 10:16:07,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 10:16:07,717 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 10:16:08,967 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 10:16:08,968 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 10:16:08,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:16:08 BoogieIcfgContainer [2020-12-09 10:16:08,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 10:16:08,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 10:16:08,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 10:16:08,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 10:16:08,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:16:07" (1/3) ... [2020-12-09 10:16:08,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fad745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:16:08, skipping insertion in model container [2020-12-09 10:16:08,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:07" (2/3) ... [2020-12-09 10:16:08,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fad745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:16:08, skipping insertion in model container [2020-12-09 10:16:08,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:16:08" (3/3) ... [2020-12-09 10:16:08,977 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_rmo.opt.i [2020-12-09 10:16:08,988 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 10:16:08,988 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 10:16:08,991 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 10:16:08,991 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 10:16:09,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,015 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,015 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,016 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,016 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,019 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,019 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,019 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,019 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,019 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,019 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,020 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,020 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,026 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,026 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,028 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,028 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,029 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:16:09,031 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 10:16:09,041 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-09 10:16:09,061 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 10:16:09,061 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 10:16:09,062 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 10:16:09,062 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 10:16:09,062 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 10:16:09,062 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 10:16:09,062 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 10:16:09,062 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 10:16:09,073 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 10:16:09,074 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 170 flow [2020-12-09 10:16:09,077 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 170 flow [2020-12-09 10:16:09,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-12-09 10:16:09,116 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-12-09 10:16:09,116 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 10:16:09,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-12-09 10:16:09,122 INFO L116 LiptonReduction]: Number of co-enabled transitions 918 [2020-12-09 10:16:09,350 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-09 10:16:09,718 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-09 10:16:09,828 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-09 10:16:10,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:10,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:10,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,273 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:16:10,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:10,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 10:16:10,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:10,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:10,367 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,369 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,373 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:10,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:10,378 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:10,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:10,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:10,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:16:10,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:16:10,448 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:16:10,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:10,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:10,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:10,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:10,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,772 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:10,773 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,774 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,776 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:10,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:10,778 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:10,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,784 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:10,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:10,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:10,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:16:10,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:16:10,845 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:16:10,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-12-09 10:16:10,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:10,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,947 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:10,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,948 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:10,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,957 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 10:16:10,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,958 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-09 10:16:10,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,959 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 10:16:10,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:10,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:10,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:10,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:11,007 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:11,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:11,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:11,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:11,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:16:11,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:11,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 10:16:11,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:11,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:11,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:11,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:11,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:11,746 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 10:16:11,871 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 10:16:12,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:12,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:12,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,013 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:16:12,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:16:12,016 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:16:12,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:12,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,054 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:12,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:12,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:12,059 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:12,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:12,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:16:12,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:16:12,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:16:12,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:12,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:12,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:12,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:16:12,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,429 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:12,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 10:16:12,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:13,498 WARN L197 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2020-12-09 10:16:13,897 WARN L197 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-12-09 10:16:15,483 WARN L197 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 311 DAG size of output: 267 [2020-12-09 10:16:16,190 WARN L197 SmtUtils]: Spent 704.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2020-12-09 10:16:17,003 WARN L197 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-12-09 10:16:17,362 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2020-12-09 10:16:18,953 WARN L197 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 320 DAG size of output: 274 [2020-12-09 10:16:19,623 WARN L197 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2020-12-09 10:16:19,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 10:16:19,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:19,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:19,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:19,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:19,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:19,701 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:19,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:19,701 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:19,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:19,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:19,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:19,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:19,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:19,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:19,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:16:19,754 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 10:16:19,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:16:19,766 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:19,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:19,767 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:19,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:19,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:19,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:16:19,769 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 10:16:19,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:16:19,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:19,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:19,793 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:19,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:19,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:16:19,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:19,812 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 10:16:19,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:19,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:19,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:19,833 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:19,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:19,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:16:19,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:19,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 10:16:19,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:20,050 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:16:20,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:20,051 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 10:16:20,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:20,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:20,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:20,070 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:20,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:20,445 WARN L197 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2020-12-09 10:16:20,819 WARN L197 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2020-12-09 10:16:21,761 WARN L197 SmtUtils]: Spent 940.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2020-12-09 10:16:22,723 WARN L197 SmtUtils]: Spent 960.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2020-12-09 10:16:22,730 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:22,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:22,730 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:22,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:22,731 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:22,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:16:22,732 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 10:16:22,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:16:22,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:22,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:22,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:22,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:22,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:16:22,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:16:22,749 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 10:16:22,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:16:22,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:22,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:22,772 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:22,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:22,786 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:22,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:22,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:22,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:22,809 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 10:16:22,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:22,809 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 10:16:22,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:16:22,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 10:16:22,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:22,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 10:16:22,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:16:22,993 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2020-12-09 10:16:23,187 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2020-12-09 10:16:23,531 WARN L197 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-12-09 10:16:23,659 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-09 10:16:23,951 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-12-09 10:16:24,075 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-09 10:16:24,077 INFO L131 LiptonReduction]: Checked pairs total: 2251 [2020-12-09 10:16:24,077 INFO L133 LiptonReduction]: Total number of compositions: 70 [2020-12-09 10:16:24,081 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-12-09 10:16:24,090 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-12-09 10:16:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-12-09 10:16:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 10:16:24,097 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:24,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 10:16:24,098 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash 877701863, now seen corresponding path program 1 times [2020-12-09 10:16:24,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:24,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779411052] [2020-12-09 10:16:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:24,256 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 10:16:24,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779411052] [2020-12-09 10:16:24,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:24,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 10:16:24,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25527554] [2020-12-09 10:16:24,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:16:24,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:16:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:16:24,277 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-12-09 10:16:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:24,344 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-12-09 10:16:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:16:24,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 10:16:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:24,354 INFO L225 Difference]: With dead ends: 137 [2020-12-09 10:16:24,354 INFO L226 Difference]: Without dead ends: 112 [2020-12-09 10:16:24,355 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 10:16:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-09 10:16:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-12-09 10:16:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-09 10:16:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-12-09 10:16:24,388 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-12-09 10:16:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:24,388 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-12-09 10:16:24,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:16:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-12-09 10:16:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 10:16:24,389 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:24,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:24,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 10:16:24,389 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:24,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1657961880, now seen corresponding path program 1 times [2020-12-09 10:16:24,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:24,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072614413] [2020-12-09 10:16:24,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:24,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072614413] [2020-12-09 10:16:24,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:24,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:16:24,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209169122] [2020-12-09 10:16:24,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:16:24,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:24,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:16:24,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:16:24,544 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 4 states. [2020-12-09 10:16:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:24,574 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-12-09 10:16:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:16:24,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-12-09 10:16:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:24,576 INFO L225 Difference]: With dead ends: 110 [2020-12-09 10:16:24,576 INFO L226 Difference]: Without dead ends: 110 [2020-12-09 10:16:24,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:16:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-09 10:16:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-12-09 10:16:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 10:16:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-12-09 10:16:24,586 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-12-09 10:16:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:24,587 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-12-09 10:16:24,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:16:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-12-09 10:16:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 10:16:24,587 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:24,587 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:24,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 10:16:24,587 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:24,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash -142789626, now seen corresponding path program 1 times [2020-12-09 10:16:24,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:24,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721722523] [2020-12-09 10:16:24,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:24,708 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 10:16:24,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721722523] [2020-12-09 10:16:24,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:24,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:16:24,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036912790] [2020-12-09 10:16:24,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:16:24,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:24,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:16:24,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:16:24,710 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 5 states. [2020-12-09 10:16:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:24,761 INFO L93 Difference]: Finished difference Result 114 states and 257 transitions. [2020-12-09 10:16:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:16:24,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-09 10:16:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:24,764 INFO L225 Difference]: With dead ends: 114 [2020-12-09 10:16:24,764 INFO L226 Difference]: Without dead ends: 114 [2020-12-09 10:16:24,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:16:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-12-09 10:16:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-12-09 10:16:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-09 10:16:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 257 transitions. [2020-12-09 10:16:24,772 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 257 transitions. Word has length 8 [2020-12-09 10:16:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:24,773 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 257 transitions. [2020-12-09 10:16:24,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:16:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 257 transitions. [2020-12-09 10:16:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 10:16:24,773 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:24,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:24,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 10:16:24,773 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:24,774 INFO L82 PathProgramCache]: Analyzing trace with hash -142813806, now seen corresponding path program 2 times [2020-12-09 10:16:24,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:24,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457989989] [2020-12-09 10:16:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:24,835 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 10:16:24,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457989989] [2020-12-09 10:16:24,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:24,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:16:24,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182102319] [2020-12-09 10:16:24,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:16:24,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:24,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:16:24,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:16:24,836 INFO L87 Difference]: Start difference. First operand 114 states and 257 transitions. Second operand 4 states. [2020-12-09 10:16:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:24,865 INFO L93 Difference]: Finished difference Result 110 states and 245 transitions. [2020-12-09 10:16:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:16:24,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 10:16:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:24,866 INFO L225 Difference]: With dead ends: 110 [2020-12-09 10:16:24,867 INFO L226 Difference]: Without dead ends: 110 [2020-12-09 10:16:24,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:16:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-09 10:16:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2020-12-09 10:16:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-09 10:16:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 237 transitions. [2020-12-09 10:16:24,872 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 237 transitions. Word has length 8 [2020-12-09 10:16:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:24,872 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 237 transitions. [2020-12-09 10:16:24,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:16:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 237 transitions. [2020-12-09 10:16:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 10:16:24,873 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:24,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:24,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 10:16:24,873 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:24,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:24,874 INFO L82 PathProgramCache]: Analyzing trace with hash -131530002, now seen corresponding path program 1 times [2020-12-09 10:16:24,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:24,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074671773] [2020-12-09 10:16:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:24,928 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 10:16:24,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074671773] [2020-12-09 10:16:24,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:24,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:16:24,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248706436] [2020-12-09 10:16:24,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:16:24,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:24,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:16:24,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:16:24,929 INFO L87 Difference]: Start difference. First operand 106 states and 237 transitions. Second operand 5 states. [2020-12-09 10:16:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:24,985 INFO L93 Difference]: Finished difference Result 107 states and 239 transitions. [2020-12-09 10:16:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:16:24,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 10:16:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:24,986 INFO L225 Difference]: With dead ends: 107 [2020-12-09 10:16:24,986 INFO L226 Difference]: Without dead ends: 107 [2020-12-09 10:16:24,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:16:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-12-09 10:16:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-12-09 10:16:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-12-09 10:16:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 239 transitions. [2020-12-09 10:16:24,991 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 239 transitions. Word has length 9 [2020-12-09 10:16:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:24,991 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 239 transitions. [2020-12-09 10:16:24,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:16:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 239 transitions. [2020-12-09 10:16:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 10:16:24,992 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:24,992 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:24,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 10:16:24,992 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:24,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:24,992 INFO L82 PathProgramCache]: Analyzing trace with hash -132859902, now seen corresponding path program 2 times [2020-12-09 10:16:24,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:24,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081042291] [2020-12-09 10:16:24,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:25,052 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 10:16:25,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081042291] [2020-12-09 10:16:25,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:25,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:16:25,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046824488] [2020-12-09 10:16:25,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:16:25,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:16:25,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:16:25,054 INFO L87 Difference]: Start difference. First operand 107 states and 239 transitions. Second operand 5 states. [2020-12-09 10:16:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:25,114 INFO L93 Difference]: Finished difference Result 104 states and 231 transitions. [2020-12-09 10:16:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:16:25,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 10:16:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:25,116 INFO L225 Difference]: With dead ends: 104 [2020-12-09 10:16:25,116 INFO L226 Difference]: Without dead ends: 104 [2020-12-09 10:16:25,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:16:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-09 10:16:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2020-12-09 10:16:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-09 10:16:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 229 transitions. [2020-12-09 10:16:25,122 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 229 transitions. Word has length 9 [2020-12-09 10:16:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:25,122 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 229 transitions. [2020-12-09 10:16:25,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:16:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 229 transitions. [2020-12-09 10:16:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 10:16:25,123 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:25,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:25,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 10:16:25,123 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash 217536880, now seen corresponding path program 1 times [2020-12-09 10:16:25,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:25,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204593695] [2020-12-09 10:16:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:25,201 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 10:16:25,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204593695] [2020-12-09 10:16:25,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:25,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:16:25,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625865958] [2020-12-09 10:16:25,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:16:25,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:25,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:16:25,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:16:25,203 INFO L87 Difference]: Start difference. First operand 103 states and 229 transitions. Second operand 5 states. [2020-12-09 10:16:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:25,243 INFO L93 Difference]: Finished difference Result 120 states and 271 transitions. [2020-12-09 10:16:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:16:25,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 10:16:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:25,245 INFO L225 Difference]: With dead ends: 120 [2020-12-09 10:16:25,245 INFO L226 Difference]: Without dead ends: 120 [2020-12-09 10:16:25,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:16:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-12-09 10:16:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2020-12-09 10:16:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 10:16:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 247 transitions. [2020-12-09 10:16:25,249 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 247 transitions. Word has length 10 [2020-12-09 10:16:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:25,249 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 247 transitions. [2020-12-09 10:16:25,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:16:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 247 transitions. [2020-12-09 10:16:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 10:16:25,250 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:25,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:25,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 10:16:25,250 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:25,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash 217574080, now seen corresponding path program 2 times [2020-12-09 10:16:25,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:25,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102001349] [2020-12-09 10:16:25,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:25,313 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 10:16:25,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102001349] [2020-12-09 10:16:25,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:25,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:16:25,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713213412] [2020-12-09 10:16:25,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:16:25,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:25,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:16:25,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:16:25,314 INFO L87 Difference]: Start difference. First operand 110 states and 247 transitions. Second operand 5 states. [2020-12-09 10:16:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:25,386 INFO L93 Difference]: Finished difference Result 122 states and 271 transitions. [2020-12-09 10:16:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 10:16:25,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 10:16:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:25,389 INFO L225 Difference]: With dead ends: 122 [2020-12-09 10:16:25,389 INFO L226 Difference]: Without dead ends: 122 [2020-12-09 10:16:25,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 10:16:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-12-09 10:16:25,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2020-12-09 10:16:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-09 10:16:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 250 transitions. [2020-12-09 10:16:25,393 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 250 transitions. Word has length 10 [2020-12-09 10:16:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:25,393 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 250 transitions. [2020-12-09 10:16:25,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:16:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 250 transitions. [2020-12-09 10:16:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 10:16:25,394 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:25,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:25,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 10:16:25,394 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:25,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash 218079845, now seen corresponding path program 1 times [2020-12-09 10:16:25,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:25,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348366516] [2020-12-09 10:16:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:25,439 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 10:16:25,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348366516] [2020-12-09 10:16:25,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:25,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:16:25,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185701730] [2020-12-09 10:16:25,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:16:25,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:25,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:16:25,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:16:25,440 INFO L87 Difference]: Start difference. First operand 112 states and 250 transitions. Second operand 4 states. [2020-12-09 10:16:25,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:25,466 INFO L93 Difference]: Finished difference Result 93 states and 176 transitions. [2020-12-09 10:16:25,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:16:25,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 10:16:25,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:25,467 INFO L225 Difference]: With dead ends: 93 [2020-12-09 10:16:25,467 INFO L226 Difference]: Without dead ends: 66 [2020-12-09 10:16:25,467 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 10:16:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-12-09 10:16:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-12-09 10:16:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 10:16:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 110 transitions. [2020-12-09 10:16:25,469 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 110 transitions. Word has length 10 [2020-12-09 10:16:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:25,469 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 110 transitions. [2020-12-09 10:16:25,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:16:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 110 transitions. [2020-12-09 10:16:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 10:16:25,470 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:25,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:25,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 10:16:25,470 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:25,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1107419065, now seen corresponding path program 1 times [2020-12-09 10:16:25,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:25,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826077207] [2020-12-09 10:16:25,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:25,527 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 10:16:25,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826077207] [2020-12-09 10:16:25,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:25,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 10:16:25,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686943574] [2020-12-09 10:16:25,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:16:25,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:25,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:16:25,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:16:25,529 INFO L87 Difference]: Start difference. First operand 64 states and 110 transitions. Second operand 5 states. [2020-12-09 10:16:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:25,556 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2020-12-09 10:16:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 10:16:25,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-09 10:16:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:25,557 INFO L225 Difference]: With dead ends: 49 [2020-12-09 10:16:25,557 INFO L226 Difference]: Without dead ends: 40 [2020-12-09 10:16:25,557 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 10:16:25,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-09 10:16:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-12-09 10:16:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-09 10:16:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-12-09 10:16:25,558 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 11 [2020-12-09 10:16:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:25,558 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-12-09 10:16:25,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:16:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2020-12-09 10:16:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 10:16:25,559 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:25,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:25,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 10:16:25,559 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1136566135, now seen corresponding path program 1 times [2020-12-09 10:16:25,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:25,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570685786] [2020-12-09 10:16:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:25,600 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 10:16:25,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570685786] [2020-12-09 10:16:25,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:25,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:16:25,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61671793] [2020-12-09 10:16:25,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:16:25,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:16:25,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:16:25,602 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 4 states. [2020-12-09 10:16:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:25,623 INFO L93 Difference]: Finished difference Result 54 states and 82 transitions. [2020-12-09 10:16:25,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:16:25,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-09 10:16:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:25,624 INFO L225 Difference]: With dead ends: 54 [2020-12-09 10:16:25,624 INFO L226 Difference]: Without dead ends: 24 [2020-12-09 10:16:25,625 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 10:16:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-09 10:16:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-12-09 10:16:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-09 10:16:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-12-09 10:16:25,626 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2020-12-09 10:16:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:25,626 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-12-09 10:16:25,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:16:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-12-09 10:16:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 10:16:25,626 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:25,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:25,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 10:16:25,626 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:16:25,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:25,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1135126263, now seen corresponding path program 2 times [2020-12-09 10:16:25,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:25,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433766015] [2020-12-09 10:16:25,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 10:16:25,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 10:16:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 10:16:25,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 10:16:25,705 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 10:16:25,705 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 10:16:25,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 10:16:25,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:16:25 BasicIcfg [2020-12-09 10:16:25,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 10:16:25,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 10:16:25,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 10:16:25,746 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 10:16:25,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:16:08" (3/4) ... [2020-12-09 10:16:25,748 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 10:16:25,802 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fffb69f6-2645-4c50-9a23-8b8d0d65d781/bin/utaipan/witness.graphml [2020-12-09 10:16:25,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 10:16:25,803 INFO L168 Benchmark]: Toolchain (without parser) took 18613.87 ms. Allocated memory was 109.1 MB in the beginning and 192.9 MB in the end (delta: 83.9 MB). Free memory was 78.1 MB in the beginning and 123.8 MB in the end (delta: -45.7 MB). Peak memory consumption was 40.8 MB. Max. memory is 16.1 GB. [2020-12-09 10:16:25,804 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 71.3 MB. Free memory was 37.2 MB in the beginning and 37.1 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 10:16:25,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.36 ms. Allocated memory is still 109.1 MB. Free memory was 77.9 MB in the beginning and 81.8 MB in the end (delta: -3.9 MB). Peak memory consumption was 38.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:16:25,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.68 ms. Allocated memory is still 109.1 MB. Free memory was 81.8 MB in the beginning and 78.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:16:25,805 INFO L168 Benchmark]: Boogie Preprocessor took 24.40 ms. Allocated memory is still 109.1 MB. Free memory was 78.9 MB in the beginning and 76.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:16:25,805 INFO L168 Benchmark]: RCFGBuilder took 1314.33 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 76.9 MB in the beginning and 94.7 MB in the end (delta: -17.8 MB). Peak memory consumption was 54.9 MB. Max. memory is 16.1 GB. [2020-12-09 10:16:25,805 INFO L168 Benchmark]: TraceAbstraction took 16774.41 ms. Allocated memory was 132.1 MB in the beginning and 192.9 MB in the end (delta: 60.8 MB). Free memory was 94.7 MB in the beginning and 132.2 MB in the end (delta: -37.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 16.1 GB. [2020-12-09 10:16:25,806 INFO L168 Benchmark]: Witness Printer took 56.42 ms. Allocated memory is still 192.9 MB. Free memory was 132.2 MB in the beginning and 123.8 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 10:16:25,808 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 71.3 MB. Free memory was 37.2 MB in the beginning and 37.1 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 394.36 ms. Allocated memory is still 109.1 MB. Free memory was 77.9 MB in the beginning and 81.8 MB in the end (delta: -3.9 MB). Peak memory consumption was 38.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.68 ms. Allocated memory is still 109.1 MB. Free memory was 81.8 MB in the beginning and 78.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.40 ms. Allocated memory is still 109.1 MB. Free memory was 78.9 MB in the beginning and 76.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1314.33 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 76.9 MB in the beginning and 94.7 MB in the end (delta: -17.8 MB). Peak memory consumption was 54.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16774.41 ms. Allocated memory was 132.1 MB in the beginning and 192.9 MB in the end (delta: 60.8 MB). Free memory was 94.7 MB in the beginning and 132.2 MB in the end (delta: -37.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 16.1 GB. * Witness Printer took 56.42 ms. Allocated memory is still 192.9 MB. Free memory was 132.2 MB in the beginning and 123.8 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 521 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 33 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 47 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 14.9s, 85 PlacesBefore, 26 PlacesAfterwards, 80 TransitionsBefore, 19 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 70 TotalNumberOfCompositions, 2251 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1451; [L793] FCALL, FORK 0 pthread_create(&t1451, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1452; [L795] FCALL, FORK 0 pthread_create(&t1452, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.0s, HoareTripleCheckerStatistics: 168 SDtfs, 155 SDslu, 190 SDs, 0 SdLazy, 180 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 4495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...