./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/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 67f75038da5597fb60fd0aa63a920af562c2c67b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-a4ecdab [2020-11-22 13:00:38,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-22 13:00:38,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-22 13:00:38,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-22 13:00:38,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-22 13:00:38,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-22 13:00:38,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-22 13:00:38,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-22 13:00:38,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-22 13:00:38,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-22 13:00:38,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-22 13:00:39,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-22 13:00:39,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-22 13:00:39,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-22 13:00:39,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-22 13:00:39,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-22 13:00:39,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-22 13:00:39,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-22 13:00:39,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-22 13:00:39,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-22 13:00:39,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-22 13:00:39,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-22 13:00:39,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-22 13:00:39,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-22 13:00:39,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-22 13:00:39,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-22 13:00:39,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-22 13:00:39,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-22 13:00:39,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-22 13:00:39,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-22 13:00:39,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-22 13:00:39,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-22 13:00:39,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-22 13:00:39,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-22 13:00:39,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-22 13:00:39,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-22 13:00:39,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-22 13:00:39,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-22 13:00:39,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-22 13:00:39,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-22 13:00:39,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-22 13:00:39,056 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-22 13:00:39,096 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-22 13:00:39,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-22 13:00:39,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-22 13:00:39,103 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-22 13:00:39,103 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-22 13:00:39,103 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-22 13:00:39,104 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-22 13:00:39,104 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-22 13:00:39,104 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-22 13:00:39,104 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-22 13:00:39,105 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-22 13:00:39,105 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-22 13:00:39,106 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-22 13:00:39,106 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-22 13:00:39,106 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-22 13:00:39,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-22 13:00:39,107 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-22 13:00:39,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-22 13:00:39,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-22 13:00:39,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-22 13:00:39,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-22 13:00:39,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-22 13:00:39,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-22 13:00:39,109 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-22 13:00:39,109 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-22 13:00:39,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-22 13:00:39,109 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-22 13:00:39,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-22 13:00:39,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-22 13:00:39,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-22 13:00:39,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-22 13:00:39,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 13:00:39,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-22 13:00:39,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-22 13:00:39,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-22 13:00:39,112 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-22 13:00:39,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-22 13:00:39,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-22 13:00:39,112 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-22 13:00:39,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-22 13:00:39,113 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_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/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_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/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 -> 67f75038da5597fb60fd0aa63a920af562c2c67b [2020-11-22 13:00:39,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-22 13:00:39,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-22 13:00:39,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-22 13:00:39,447 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-22 13:00:39,453 INFO L275 PluginConnector]: CDTParser initialized [2020-11-22 13:00:39,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i [2020-11-22 13:00:39,534 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/bin/utaipan/data/c766b7ee5/288b95331e4b487f965df9832d25206a/FLAGc1cd9dbd2 [2020-11-22 13:00:40,224 INFO L306 CDTParser]: Found 1 translation units. [2020-11-22 13:00:40,234 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i [2020-11-22 13:00:40,260 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/bin/utaipan/data/c766b7ee5/288b95331e4b487f965df9832d25206a/FLAGc1cd9dbd2 [2020-11-22 13:00:40,477 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/bin/utaipan/data/c766b7ee5/288b95331e4b487f965df9832d25206a [2020-11-22 13:00:40,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-22 13:00:40,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-22 13:00:40,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-22 13:00:40,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-22 13:00:40,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-22 13:00:40,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:00:40" (1/1) ... [2020-11-22 13:00:40,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60705466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:40, skipping insertion in model container [2020-11-22 13:00:40,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:00:40" (1/1) ... [2020-11-22 13:00:40,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-22 13:00:40,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-22 13:00:41,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 13:00:41,020 INFO L203 MainTranslator]: Completed pre-run [2020-11-22 13:00:41,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 13:00:41,269 INFO L208 MainTranslator]: Completed translation [2020-11-22 13:00:41,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41 WrapperNode [2020-11-22 13:00:41,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-22 13:00:41,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-22 13:00:41,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-22 13:00:41,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-22 13:00:41,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41" (1/1) ... [2020-11-22 13:00:41,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41" (1/1) ... [2020-11-22 13:00:41,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-22 13:00:41,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-22 13:00:41,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-22 13:00:41,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-22 13:00:41,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41" (1/1) ... [2020-11-22 13:00:41,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41" (1/1) ... [2020-11-22 13:00:41,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41" (1/1) ... [2020-11-22 13:00:41,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41" (1/1) ... [2020-11-22 13:00:41,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41" (1/1) ... [2020-11-22 13:00:41,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41" (1/1) ... [2020-11-22 13:00:41,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41" (1/1) ... [2020-11-22 13:00:41,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-22 13:00:41,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-22 13:00:41,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-22 13:00:41,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-22 13:00:41,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/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-11-22 13:00:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-22 13:00:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-22 13:00:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-22 13:00:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-22 13:00:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-22 13:00:41,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-22 13:00:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-22 13:00:41,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-22 13:00:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-22 13:00:41,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-22 13:00:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-22 13:00:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-22 13:00:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-22 13:00:41,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-22 13:00:41,552 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-22 13:00:44,192 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-22 13:00:44,192 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-22 13:00:44,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:00:44 BoogieIcfgContainer [2020-11-22 13:00:44,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-22 13:00:44,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-22 13:00:44,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-22 13:00:44,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-22 13:00:44,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:00:40" (1/3) ... [2020-11-22 13:00:44,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c95184f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:00:44, skipping insertion in model container [2020-11-22 13:00:44,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:41" (2/3) ... [2020-11-22 13:00:44,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c95184f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:00:44, skipping insertion in model container [2020-11-22 13:00:44,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:00:44" (3/3) ... [2020-11-22 13:00:44,205 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2020-11-22 13:00:44,216 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-22 13:00:44,217 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-22 13:00:44,221 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-22 13:00:44,222 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-22 13:00:44,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,263 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,263 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,264 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,264 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,267 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,267 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,268 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,269 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,270 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,272 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,296 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,296 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,297 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,302 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,306 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,306 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:00:44,313 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-22 13:00:44,325 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-22 13:00:44,355 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-22 13:00:44,355 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-22 13:00:44,355 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-22 13:00:44,355 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-22 13:00:44,355 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-22 13:00:44,355 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-22 13:00:44,355 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-22 13:00:44,355 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-22 13:00:44,372 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-22 13:00:44,374 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-22 13:00:44,380 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-22 13:00:44,382 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-11-22 13:00:44,441 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-11-22 13:00:44,441 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-22 13:00:44,446 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-22 13:00:44,451 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-11-22 13:00:44,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:00:44,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:44,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:00:44,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:44,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:00:44,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:44,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-22 13:00:44,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:44,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:00:44,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:44,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:44,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:44,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:44,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:44,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:44,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:44,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:44,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:44,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:44,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:44,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:00:44,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:44,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:00:44,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:44,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:00:44,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:44,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:00:44,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:44,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:00:44,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:44,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:44,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 13:00:44,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:00:44,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:00:45,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:00:45,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:45,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 13:00:45,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:00:45,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:00:45,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:45,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:45,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:45,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:45,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:45,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:45,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:45,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:45,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:45,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:00:45,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:00:45,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:00:45,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:00:45,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:00:45,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:00:45,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:45,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:00:45,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:47,108 WARN L193 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-11-22 13:00:47,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-22 13:00:47,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:47,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:00:47,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:48,324 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-11-22 13:00:48,627 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-22 13:00:49,051 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-22 13:00:49,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:00:49,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:00:49,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:00:49,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:00:49,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:00:49,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:49,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:49,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:49,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:49,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:49,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:49,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:49,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:49,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:49,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:00:49,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:00:49,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:00:49,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:00:49,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-22 13:00:49,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:49,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 13:00:49,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:00:49,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:49,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:49,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-22 13:00:49,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:49,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:49,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:49,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:49,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:49,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:49,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:49,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:49,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:49,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:49,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:49,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:49,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:49,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:49,844 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-22 13:00:49,971 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-22 13:00:50,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:50,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:50,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:50,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:50,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:50,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:50,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-22 13:00:50,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:50,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:50,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:50,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:50,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:50,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:50,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:50,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:50,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:50,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 13:00:50,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:50,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:50,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:50,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-22 13:00:50,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:50,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:50,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:50,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:50,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:50,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:50,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:50,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:50,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:50,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:50,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:50,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:50,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:50,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:51,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:51,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:00:51,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:51,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:51,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:51,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:51,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-22 13:00:51,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:51,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:51,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:51,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:51,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:51,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:51,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:51,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:51,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:51,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-22 13:00:51,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:51,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:51,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:51,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-22 13:00:51,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:52,213 WARN L193 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 123 [2020-11-22 13:00:52,620 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-11-22 13:00:53,248 WARN L193 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-11-22 13:00:53,570 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-22 13:00:54,368 WARN L193 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-11-22 13:00:54,610 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-22 13:00:55,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 13:00:55,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:55,353 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-22 13:00:55,503 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-22 13:00:55,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 13:00:55,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:55,978 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-11-22 13:00:56,344 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-11-22 13:00:56,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:00:56,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:56,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:56,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:56,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:56,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:56,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:00:56,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:56,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:56,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:56,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:56,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:56,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:56,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:00:56,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:00:56,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:00:56,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:00:56,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:56,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:56,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:56,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:56,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:00:56,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:00:56,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:00:56,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:00:56,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:56,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:56,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:00:56,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:00:56,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:56,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:00:56,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:00:56,866 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-11-22 13:00:57,081 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-22 13:00:57,123 INFO L131 LiptonReduction]: Checked pairs total: 4967 [2020-11-22 13:00:57,123 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-11-22 13:00:57,129 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-11-22 13:00:57,195 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-11-22 13:00:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-11-22 13:00:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-22 13:00:57,202 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:57,203 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:57,203 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1674161771, now seen corresponding path program 1 times [2020-11-22 13:00:57,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:57,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625484524] [2020-11-22 13:00:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:00:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:00:57,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625484524] [2020-11-22 13:00:57,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:00:57,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 13:00:57,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140317490] [2020-11-22 13:00:57,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:00:57,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:00:57,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:00:57,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:00:57,481 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-11-22 13:00:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:00:57,589 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-11-22 13:00:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:00:57,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-22 13:00:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:00:57,618 INFO L225 Difference]: With dead ends: 550 [2020-11-22 13:00:57,619 INFO L226 Difference]: Without dead ends: 450 [2020-11-22 13:00:57,620 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-11-22 13:00:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-11-22 13:00:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-11-22 13:00:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-11-22 13:00:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-11-22 13:00:57,728 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-11-22 13:00:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:00:57,729 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-11-22 13:00:57,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:00:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-11-22 13:00:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-22 13:00:57,731 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:57,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:57,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-22 13:00:57,732 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:57,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:57,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1743214513, now seen corresponding path program 1 times [2020-11-22 13:00:57,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:57,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266141066] [2020-11-22 13:00:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:00:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:00:57,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266141066] [2020-11-22 13:00:57,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:00:57,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 13:00:57,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703986018] [2020-11-22 13:00:57,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:00:57,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:00:57,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:00:57,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:00:57,908 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-11-22 13:00:57,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:00:57,948 INFO L93 Difference]: Finished difference Result 445 states and 1339 transitions. [2020-11-22 13:00:57,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:00:57,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-22 13:00:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:00:57,954 INFO L225 Difference]: With dead ends: 445 [2020-11-22 13:00:57,954 INFO L226 Difference]: Without dead ends: 445 [2020-11-22 13:00:57,954 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-11-22 13:00:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-11-22 13:00:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2020-11-22 13:00:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-11-22 13:00:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1339 transitions. [2020-11-22 13:00:57,972 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1339 transitions. Word has length 9 [2020-11-22 13:00:57,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:00:57,972 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 1339 transitions. [2020-11-22 13:00:57,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:00:57,972 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1339 transitions. [2020-11-22 13:00:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-22 13:00:57,974 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:57,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:57,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-22 13:00:57,974 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:57,975 INFO L82 PathProgramCache]: Analyzing trace with hash 79771207, now seen corresponding path program 1 times [2020-11-22 13:00:57,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:57,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443582483] [2020-11-22 13:00:57,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:00:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:00:58,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443582483] [2020-11-22 13:00:58,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:00:58,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 13:00:58,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779831875] [2020-11-22 13:00:58,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:00:58,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:00:58,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:00:58,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:00:58,101 INFO L87 Difference]: Start difference. First operand 445 states and 1339 transitions. Second operand 3 states. [2020-11-22 13:00:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:00:58,127 INFO L93 Difference]: Finished difference Result 444 states and 1335 transitions. [2020-11-22 13:00:58,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:00:58,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-22 13:00:58,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:00:58,138 INFO L225 Difference]: With dead ends: 444 [2020-11-22 13:00:58,139 INFO L226 Difference]: Without dead ends: 444 [2020-11-22 13:00:58,139 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-11-22 13:00:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2020-11-22 13:00:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2020-11-22 13:00:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-11-22 13:00:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1335 transitions. [2020-11-22 13:00:58,156 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1335 transitions. Word has length 10 [2020-11-22 13:00:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:00:58,157 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1335 transitions. [2020-11-22 13:00:58,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:00:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1335 transitions. [2020-11-22 13:00:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-22 13:00:58,164 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:58,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:58,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-22 13:00:58,164 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:58,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:58,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1794923896, now seen corresponding path program 1 times [2020-11-22 13:00:58,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:58,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604362098] [2020-11-22 13:00:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:00:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:00:58,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604362098] [2020-11-22 13:00:58,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:00:58,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 13:00:58,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132990132] [2020-11-22 13:00:58,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:00:58,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:00:58,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:00:58,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:00:58,234 INFO L87 Difference]: Start difference. First operand 444 states and 1335 transitions. Second operand 3 states. [2020-11-22 13:00:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:00:58,251 INFO L93 Difference]: Finished difference Result 439 states and 1316 transitions. [2020-11-22 13:00:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:00:58,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-22 13:00:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:00:58,256 INFO L225 Difference]: With dead ends: 439 [2020-11-22 13:00:58,256 INFO L226 Difference]: Without dead ends: 439 [2020-11-22 13:00:58,256 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-11-22 13:00:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-11-22 13:00:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2020-11-22 13:00:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-11-22 13:00:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1316 transitions. [2020-11-22 13:00:58,274 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1316 transitions. Word has length 10 [2020-11-22 13:00:58,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:00:58,274 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 1316 transitions. [2020-11-22 13:00:58,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:00:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1316 transitions. [2020-11-22 13:00:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-22 13:00:58,278 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:58,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:58,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-22 13:00:58,278 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:58,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:58,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1822060928, now seen corresponding path program 1 times [2020-11-22 13:00:58,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:58,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085697797] [2020-11-22 13:00:58,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:00:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:00:58,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085697797] [2020-11-22 13:00:58,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:00:58,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 13:00:58,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396060865] [2020-11-22 13:00:58,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:00:58,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:00:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:00:58,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:00:58,374 INFO L87 Difference]: Start difference. First operand 439 states and 1316 transitions. Second operand 3 states. [2020-11-22 13:00:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:00:58,387 INFO L93 Difference]: Finished difference Result 432 states and 1290 transitions. [2020-11-22 13:00:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:00:58,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-22 13:00:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:00:58,392 INFO L225 Difference]: With dead ends: 432 [2020-11-22 13:00:58,392 INFO L226 Difference]: Without dead ends: 432 [2020-11-22 13:00:58,393 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-11-22 13:00:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-22 13:00:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-11-22 13:00:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-11-22 13:00:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1290 transitions. [2020-11-22 13:00:58,408 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1290 transitions. Word has length 11 [2020-11-22 13:00:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:00:58,408 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1290 transitions. [2020-11-22 13:00:58,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:00:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1290 transitions. [2020-11-22 13:00:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-22 13:00:58,409 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:58,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:58,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-22 13:00:58,410 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:58,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:58,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1822060866, now seen corresponding path program 1 times [2020-11-22 13:00:58,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:58,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458970531] [2020-11-22 13:00:58,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:00:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:00:58,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458970531] [2020-11-22 13:00:58,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:00:58,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 13:00:58,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249257266] [2020-11-22 13:00:58,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:00:58,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:00:58,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:00:58,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:00:58,520 INFO L87 Difference]: Start difference. First operand 432 states and 1290 transitions. Second operand 4 states. [2020-11-22 13:00:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:00:58,559 INFO L93 Difference]: Finished difference Result 427 states and 1272 transitions. [2020-11-22 13:00:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:00:58,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-22 13:00:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:00:58,564 INFO L225 Difference]: With dead ends: 427 [2020-11-22 13:00:58,564 INFO L226 Difference]: Without dead ends: 427 [2020-11-22 13:00:58,564 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-11-22 13:00:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-11-22 13:00:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-11-22 13:00:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-11-22 13:00:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1272 transitions. [2020-11-22 13:00:58,579 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1272 transitions. Word has length 11 [2020-11-22 13:00:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:00:58,580 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 1272 transitions. [2020-11-22 13:00:58,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:00:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1272 transitions. [2020-11-22 13:00:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-22 13:00:58,581 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:58,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:58,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-22 13:00:58,582 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:58,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:58,582 INFO L82 PathProgramCache]: Analyzing trace with hash -649314907, now seen corresponding path program 1 times [2020-11-22 13:00:58,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:58,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550755780] [2020-11-22 13:00:58,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:00:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:00:58,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550755780] [2020-11-22 13:00:58,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:00:58,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:00:58,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003325571] [2020-11-22 13:00:58,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 13:00:58,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:00:58,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 13:00:58,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:00:58,788 INFO L87 Difference]: Start difference. First operand 427 states and 1272 transitions. Second operand 5 states. [2020-11-22 13:00:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:00:58,854 INFO L93 Difference]: Finished difference Result 416 states and 1232 transitions. [2020-11-22 13:00:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:00:58,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-22 13:00:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:00:58,858 INFO L225 Difference]: With dead ends: 416 [2020-11-22 13:00:58,859 INFO L226 Difference]: Without dead ends: 416 [2020-11-22 13:00:58,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:00:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-11-22 13:00:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2020-11-22 13:00:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-11-22 13:00:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1232 transitions. [2020-11-22 13:00:58,877 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1232 transitions. Word has length 12 [2020-11-22 13:00:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:00:58,877 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1232 transitions. [2020-11-22 13:00:58,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 13:00:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1232 transitions. [2020-11-22 13:00:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-22 13:00:58,878 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:58,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:58,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-22 13:00:58,879 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash -649314070, now seen corresponding path program 1 times [2020-11-22 13:00:58,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:58,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929319732] [2020-11-22 13:00:58,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:00:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:00:58,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929319732] [2020-11-22 13:00:58,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:00:58,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 13:00:58,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235486656] [2020-11-22 13:00:58,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:00:58,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:00:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:00:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:00:58,981 INFO L87 Difference]: Start difference. First operand 416 states and 1232 transitions. Second operand 4 states. [2020-11-22 13:00:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:00:59,042 INFO L93 Difference]: Finished difference Result 420 states and 1243 transitions. [2020-11-22 13:00:59,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:00:59,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-22 13:00:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:00:59,047 INFO L225 Difference]: With dead ends: 420 [2020-11-22 13:00:59,047 INFO L226 Difference]: Without dead ends: 420 [2020-11-22 13:00:59,049 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-11-22 13:00:59,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-11-22 13:00:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-11-22 13:00:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-11-22 13:00:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1243 transitions. [2020-11-22 13:00:59,064 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1243 transitions. Word has length 12 [2020-11-22 13:00:59,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:00:59,064 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1243 transitions. [2020-11-22 13:00:59,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:00:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1243 transitions. [2020-11-22 13:00:59,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-22 13:00:59,065 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:59,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:59,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-22 13:00:59,066 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:59,066 INFO L82 PathProgramCache]: Analyzing trace with hash -651042940, now seen corresponding path program 2 times [2020-11-22 13:00:59,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:59,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339315187] [2020-11-22 13:00:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:00:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:00:59,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339315187] [2020-11-22 13:00:59,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:00:59,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:00:59,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375550590] [2020-11-22 13:00:59,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 13:00:59,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:00:59,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 13:00:59,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:00:59,185 INFO L87 Difference]: Start difference. First operand 420 states and 1243 transitions. Second operand 5 states. [2020-11-22 13:00:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:00:59,243 INFO L93 Difference]: Finished difference Result 411 states and 1213 transitions. [2020-11-22 13:00:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:00:59,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-22 13:00:59,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:00:59,248 INFO L225 Difference]: With dead ends: 411 [2020-11-22 13:00:59,248 INFO L226 Difference]: Without dead ends: 411 [2020-11-22 13:00:59,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11-22 13:00:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-11-22 13:00:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2020-11-22 13:00:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-11-22 13:00:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1202 transitions. [2020-11-22 13:00:59,262 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1202 transitions. Word has length 12 [2020-11-22 13:00:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:00:59,262 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1202 transitions. [2020-11-22 13:00:59,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 13:00:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1202 transitions. [2020-11-22 13:00:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 13:00:59,263 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:59,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:59,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-22 13:00:59,264 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:59,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:59,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1346072291, now seen corresponding path program 1 times [2020-11-22 13:00:59,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:59,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497911430] [2020-11-22 13:00:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:00:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:00:59,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497911430] [2020-11-22 13:00:59,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:00:59,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 13:00:59,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163240668] [2020-11-22 13:00:59,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 13:00:59,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:00:59,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 13:00:59,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-22 13:00:59,475 INFO L87 Difference]: Start difference. First operand 407 states and 1202 transitions. Second operand 6 states. [2020-11-22 13:00:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:00:59,611 INFO L93 Difference]: Finished difference Result 432 states and 1264 transitions. [2020-11-22 13:00:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:00:59,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-22 13:00:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:00:59,617 INFO L225 Difference]: With dead ends: 432 [2020-11-22 13:00:59,617 INFO L226 Difference]: Without dead ends: 432 [2020-11-22 13:00:59,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-11-22 13:00:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-22 13:00:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 424. [2020-11-22 13:00:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-22 13:00:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1246 transitions. [2020-11-22 13:00:59,633 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1246 transitions. Word has length 13 [2020-11-22 13:00:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:00:59,633 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1246 transitions. [2020-11-22 13:00:59,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 13:00:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1246 transitions. [2020-11-22 13:00:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 13:00:59,635 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:59,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:59,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-22 13:00:59,635 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:59,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash 233943692, now seen corresponding path program 1 times [2020-11-22 13:00:59,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:59,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622751091] [2020-11-22 13:00:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:00:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:00:59,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622751091] [2020-11-22 13:00:59,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:00:59,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 13:00:59,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359987759] [2020-11-22 13:00:59,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:00:59,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:00:59,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:00:59,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:00:59,676 INFO L87 Difference]: Start difference. First operand 424 states and 1246 transitions. Second operand 3 states. [2020-11-22 13:00:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:00:59,692 INFO L93 Difference]: Finished difference Result 585 states and 1675 transitions. [2020-11-22 13:00:59,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:00:59,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-22 13:00:59,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:00:59,697 INFO L225 Difference]: With dead ends: 585 [2020-11-22 13:00:59,697 INFO L226 Difference]: Without dead ends: 432 [2020-11-22 13:00:59,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:00:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-22 13:00:59,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 414. [2020-11-22 13:00:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-11-22 13:00:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1168 transitions. [2020-11-22 13:00:59,711 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1168 transitions. Word has length 13 [2020-11-22 13:00:59,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:00:59,711 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 1168 transitions. [2020-11-22 13:00:59,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:00:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1168 transitions. [2020-11-22 13:00:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-22 13:00:59,712 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:00:59,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:00:59,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-22 13:00:59,713 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:00:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:00:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1221433980, now seen corresponding path program 1 times [2020-11-22 13:00:59,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:00:59,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128585817] [2020-11-22 13:00:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:00:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:01:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:01:00,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128585817] [2020-11-22 13:01:00,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:01:00,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 13:01:00,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560823728] [2020-11-22 13:01:00,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-22 13:01:00,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:01:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-22 13:01:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-22 13:01:00,113 INFO L87 Difference]: Start difference. First operand 414 states and 1168 transitions. Second operand 7 states. [2020-11-22 13:01:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:01:00,389 INFO L93 Difference]: Finished difference Result 468 states and 1279 transitions. [2020-11-22 13:01:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 13:01:00,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-22 13:01:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:01:00,395 INFO L225 Difference]: With dead ends: 468 [2020-11-22 13:01:00,395 INFO L226 Difference]: Without dead ends: 270 [2020-11-22 13:01:00,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-22 13:01:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-11-22 13:01:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 252. [2020-11-22 13:01:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-11-22 13:01:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 673 transitions. [2020-11-22 13:01:00,417 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 673 transitions. Word has length 14 [2020-11-22 13:01:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:01:00,420 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 673 transitions. [2020-11-22 13:01:00,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-22 13:01:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 673 transitions. [2020-11-22 13:01:00,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-22 13:01:00,422 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:01:00,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:01:00,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-22 13:01:00,422 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:01:00,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:01:00,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1337648298, now seen corresponding path program 1 times [2020-11-22 13:01:00,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:01:00,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322571313] [2020-11-22 13:01:00,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:01:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:01:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:01:00,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322571313] [2020-11-22 13:01:00,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:01:00,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:01:00,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96654212] [2020-11-22 13:01:00,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:01:00,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:01:00,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:01:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:01:00,515 INFO L87 Difference]: Start difference. First operand 252 states and 673 transitions. Second operand 4 states. [2020-11-22 13:01:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:01:00,551 INFO L93 Difference]: Finished difference Result 251 states and 586 transitions. [2020-11-22 13:01:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 13:01:00,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-22 13:01:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:01:00,554 INFO L225 Difference]: With dead ends: 251 [2020-11-22 13:01:00,554 INFO L226 Difference]: Without dead ends: 181 [2020-11-22 13:01:00,554 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-11-22 13:01:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-11-22 13:01:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-11-22 13:01:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-11-22 13:01:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 411 transitions. [2020-11-22 13:01:00,560 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 411 transitions. Word has length 14 [2020-11-22 13:01:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:01:00,561 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 411 transitions. [2020-11-22 13:01:00,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:01:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 411 transitions. [2020-11-22 13:01:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-22 13:01:00,561 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:01:00,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:01:00,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-22 13:01:00,562 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:01:00,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:01:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1350041670, now seen corresponding path program 1 times [2020-11-22 13:01:00,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:01:00,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371003359] [2020-11-22 13:01:00,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:01:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:01:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:01:00,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371003359] [2020-11-22 13:01:00,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:01:00,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 13:01:00,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860972079] [2020-11-22 13:01:00,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 13:01:00,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:01:00,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 13:01:00,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:01:00,642 INFO L87 Difference]: Start difference. First operand 181 states and 411 transitions. Second operand 5 states. [2020-11-22 13:01:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:01:00,706 INFO L93 Difference]: Finished difference Result 150 states and 302 transitions. [2020-11-22 13:01:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 13:01:00,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-22 13:01:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:01:00,708 INFO L225 Difference]: With dead ends: 150 [2020-11-22 13:01:00,708 INFO L226 Difference]: Without dead ends: 112 [2020-11-22 13:01:00,709 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-11-22 13:01:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-22 13:01:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-22 13:01:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-22 13:01:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 216 transitions. [2020-11-22 13:01:00,711 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 216 transitions. Word has length 15 [2020-11-22 13:01:00,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:01:00,711 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 216 transitions. [2020-11-22 13:01:00,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 13:01:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 216 transitions. [2020-11-22 13:01:00,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-22 13:01:00,712 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:01:00,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:01:00,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-22 13:01:00,712 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:01:00,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:01:00,712 INFO L82 PathProgramCache]: Analyzing trace with hash -380102878, now seen corresponding path program 1 times [2020-11-22 13:01:00,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:01:00,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839531549] [2020-11-22 13:01:00,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:01:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:01:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:01:00,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839531549] [2020-11-22 13:01:00,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:01:00,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 13:01:00,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146348581] [2020-11-22 13:01:00,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:01:00,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:01:00,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:01:00,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:01:00,758 INFO L87 Difference]: Start difference. First operand 112 states and 216 transitions. Second operand 3 states. [2020-11-22 13:01:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:01:00,770 INFO L93 Difference]: Finished difference Result 151 states and 281 transitions. [2020-11-22 13:01:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:01:00,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-11-22 13:01:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:01:00,772 INFO L225 Difference]: With dead ends: 151 [2020-11-22 13:01:00,772 INFO L226 Difference]: Without dead ends: 109 [2020-11-22 13:01:00,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:01:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-22 13:01:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2020-11-22 13:01:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-22 13:01:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 190 transitions. [2020-11-22 13:01:00,776 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 190 transitions. Word has length 16 [2020-11-22 13:01:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:01:00,776 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 190 transitions. [2020-11-22 13:01:00,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:01:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 190 transitions. [2020-11-22 13:01:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-22 13:01:00,780 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:01:00,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:01:00,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-22 13:01:00,780 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:01:00,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:01:00,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1101711683, now seen corresponding path program 1 times [2020-11-22 13:01:00,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:01:00,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122742287] [2020-11-22 13:01:00,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:01:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:01:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:01:00,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122742287] [2020-11-22 13:01:00,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:01:00,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 13:01:00,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890592521] [2020-11-22 13:01:00,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 13:01:00,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:01:00,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 13:01:00,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 13:01:00,882 INFO L87 Difference]: Start difference. First operand 107 states and 190 transitions. Second operand 6 states. [2020-11-22 13:01:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:01:00,956 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2020-11-22 13:01:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 13:01:00,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-22 13:01:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:01:00,957 INFO L225 Difference]: With dead ends: 93 [2020-11-22 13:01:00,958 INFO L226 Difference]: Without dead ends: 35 [2020-11-22 13:01:00,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-22 13:01:00,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-22 13:01:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-22 13:01:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-22 13:01:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-11-22 13:01:00,959 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2020-11-22 13:01:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:01:00,960 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-11-22 13:01:00,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 13:01:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-11-22 13:01:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-22 13:01:00,960 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:01:00,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:01:00,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-22 13:01:00,960 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:01:00,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:01:00,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1131077601, now seen corresponding path program 1 times [2020-11-22 13:01:00,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:01:00,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394675550] [2020-11-22 13:01:00,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:01:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 13:01:01,022 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 13:01:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 13:01:01,068 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 13:01:01,114 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-22 13:01:01,114 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-22 13:01:01,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-22 13:01:01,116 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-22 13:01:01,129 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L820-->L827: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In1210886777 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In1210886777 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In1210886777 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In1210886777 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1210886777 0)) (or (and .cse0 (= ~y~0_Out1210886777 ~y$w_buff0~0_In1210886777) .cse1) (and .cse2 (or (and (= ~y~0_Out1210886777 ~y~0_In1210886777) .cse3) (and .cse4 (= ~y~0_Out1210886777 ~y$w_buff1~0_In1210886777) .cse5)))) (or (and .cse0 (= ~y$w_buff0_used~0_Out1210886777 0) .cse1) (and .cse2 (= ~y$w_buff0_used~0_In1210886777 ~y$w_buff0_used~0_Out1210886777))) (or (and .cse4 (= ~y$w_buff1_used~0_Out1210886777 0) .cse5) (and (= ~y$w_buff1_used~0_Out1210886777 ~y$w_buff1_used~0_In1210886777) .cse3)) (= ~y$r_buff1_thd0~0_Out1210886777 ~y$r_buff1_thd0~0_In1210886777) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1210886777 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1210886777|) (= ~y$r_buff0_thd0~0_Out1210886777 ~y$r_buff0_thd0~0_In1210886777)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1210886777|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1210886777, ~y$w_buff1~0=~y$w_buff1~0_In1210886777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1210886777, ~y$w_buff0~0=~y$w_buff0~0_In1210886777, ~y~0=~y~0_In1210886777, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1210886777, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1210886777} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1210886777, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1210886777|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1210886777|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1210886777|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1210886777|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1210886777|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1210886777|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1210886777|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1210886777, ~y$w_buff1~0=~y$w_buff1~0_In1210886777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1210886777, ~y$w_buff0~0=~y$w_buff0~0_In1210886777, ~y~0=~y~0_Out1210886777, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1210886777, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1210886777} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-22 13:01:01,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,136 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [773] [2020-11-22 13:01:01,138 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,138 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,139 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,139 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,140 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,140 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,148 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,149 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,149 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,149 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,149 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,150 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,150 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,150 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,150 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,150 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,150 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,150 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:01:01 BasicIcfg [2020-11-22 13:01:01,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-22 13:01:01,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-22 13:01:01,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-22 13:01:01,220 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-22 13:01:01,220 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:00:44" (3/4) ... [2020-11-22 13:01:01,222 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-22 13:01:01,231 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L820-->L827: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In1210886777 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In1210886777 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In1210886777 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In1210886777 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1210886777 0)) (or (and .cse0 (= ~y~0_Out1210886777 ~y$w_buff0~0_In1210886777) .cse1) (and .cse2 (or (and (= ~y~0_Out1210886777 ~y~0_In1210886777) .cse3) (and .cse4 (= ~y~0_Out1210886777 ~y$w_buff1~0_In1210886777) .cse5)))) (or (and .cse0 (= ~y$w_buff0_used~0_Out1210886777 0) .cse1) (and .cse2 (= ~y$w_buff0_used~0_In1210886777 ~y$w_buff0_used~0_Out1210886777))) (or (and .cse4 (= ~y$w_buff1_used~0_Out1210886777 0) .cse5) (and (= ~y$w_buff1_used~0_Out1210886777 ~y$w_buff1_used~0_In1210886777) .cse3)) (= ~y$r_buff1_thd0~0_Out1210886777 ~y$r_buff1_thd0~0_In1210886777) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1210886777 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1210886777|) (= ~y$r_buff0_thd0~0_Out1210886777 ~y$r_buff0_thd0~0_In1210886777)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1210886777|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1210886777, ~y$w_buff1~0=~y$w_buff1~0_In1210886777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1210886777, ~y$w_buff0~0=~y$w_buff0~0_In1210886777, ~y~0=~y~0_In1210886777, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1210886777, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1210886777} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1210886777, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1210886777|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1210886777|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1210886777|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1210886777|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1210886777|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1210886777|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1210886777|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1210886777, ~y$w_buff1~0=~y$w_buff1~0_In1210886777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1210886777, ~y$w_buff0~0=~y$w_buff0~0_In1210886777, ~y~0=~y~0_Out1210886777, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1210886777, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1210886777} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-22 13:01:01,233 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,233 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,234 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [773] [2020-11-22 13:01:01,234 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,235 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,235 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,235 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,235 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,240 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,240 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,240 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,240 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,241 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:01:01,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:01:01,338 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2e1922d2-7d65-4e8b-916f-c9c13fc9e1a7/bin/utaipan/witness.graphml [2020-11-22 13:01:01,338 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-22 13:01:01,340 INFO L168 Benchmark]: Toolchain (without parser) took 20857.42 ms. Allocated memory was 92.3 MB in the beginning and 264.2 MB in the end (delta: 172.0 MB). Free memory was 63.8 MB in the beginning and 101.6 MB in the end (delta: -37.8 MB). Peak memory consumption was 135.1 MB. Max. memory is 16.1 GB. [2020-11-22 13:01:01,340 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 75.5 MB. Free memory is still 43.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-22 13:01:01,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.18 ms. Allocated memory is still 92.3 MB. Free memory was 63.6 MB in the beginning and 58.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 27.5 MB. Max. memory is 16.1 GB. [2020-11-22 13:01:01,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.54 ms. Allocated memory is still 92.3 MB. Free memory was 58.6 MB in the beginning and 55.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-22 13:01:01,341 INFO L168 Benchmark]: Boogie Preprocessor took 93.78 ms. Allocated memory is still 92.3 MB. Free memory was 55.6 MB in the beginning and 53.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 13:01:01,342 INFO L168 Benchmark]: RCFGBuilder took 2720.47 ms. Allocated memory was 92.3 MB in the beginning and 125.8 MB in the end (delta: 33.6 MB). Free memory was 53.4 MB in the beginning and 48.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 46.3 MB. Max. memory is 16.1 GB. [2020-11-22 13:01:01,342 INFO L168 Benchmark]: TraceAbstraction took 17022.71 ms. Allocated memory was 125.8 MB in the beginning and 264.2 MB in the end (delta: 138.4 MB). Free memory was 48.7 MB in the beginning and 114.2 MB in the end (delta: -65.5 MB). Peak memory consumption was 72.9 MB. Max. memory is 16.1 GB. [2020-11-22 13:01:01,342 INFO L168 Benchmark]: Witness Printer took 119.04 ms. Allocated memory is still 264.2 MB. Free memory was 114.2 MB in the beginning and 101.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-22 13:01:01,344 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.29 ms. Allocated memory is still 75.5 MB. Free memory is still 43.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 784.18 ms. Allocated memory is still 92.3 MB. Free memory was 63.6 MB in the beginning and 58.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 27.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 107.54 ms. Allocated memory is still 92.3 MB. Free memory was 58.6 MB in the beginning and 55.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 93.78 ms. Allocated memory is still 92.3 MB. Free memory was 55.6 MB in the beginning and 53.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2720.47 ms. Allocated memory was 92.3 MB in the beginning and 125.8 MB in the end (delta: 33.6 MB). Free memory was 53.4 MB in the beginning and 48.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 46.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17022.71 ms. Allocated memory was 125.8 MB in the beginning and 264.2 MB in the end (delta: 138.4 MB). Free memory was 48.7 MB in the beginning and 114.2 MB in the end (delta: -65.5 MB). Peak memory consumption was 72.9 MB. Max. memory is 16.1 GB. * Witness Printer took 119.04 ms. Allocated memory is still 264.2 MB. Free memory was 114.2 MB in the beginning and 101.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1114 VarBasedMoverChecksPositive, 77 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 56 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 115 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.7s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 26 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 4967 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2498; [L812] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2499; [L814] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2500; [L816] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "safe030_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L754] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe030_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.8s, HoareTripleCheckerStatistics: 340 SDtfs, 286 SDslu, 375 SDs, 0 SdLazy, 236 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 50 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 14560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...